./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe017_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/safe017_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 cde23df1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe017_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-cde23df-m
[2024-06-14 15:58:22,663 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 15:58:22,738 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 15:58:22,743 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 15:58:22,743 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 15:58:22,766 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 15:58:22,767 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 15:58:22,767 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 15:58:22,767 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 15:58:22,770 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 15:58:22,771 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 15:58:22,771 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 15:58:22,771 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 15:58:22,772 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 15:58:22,772 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 15:58:22,773 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 15:58:22,773 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 15:58:22,773 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 15:58:22,773 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 15:58:22,774 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 15:58:22,774 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 15:58:22,774 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 15:58:22,774 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 15:58:22,775 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 15:58:22,775 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 15:58:22,775 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 15:58:22,775 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 15:58:22,775 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 15:58:22,776 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 15:58:22,776 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 15:58:22,777 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 15:58:22,777 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 15:58:22,777 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:58:22,778 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 15:58:22,778 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 15:58:22,778 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 15:58:22,778 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 15:58:22,778 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 15:58:22,778 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 15:58:22,779 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 15:58:22,779 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 15:58:22,779 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 15:58:22,779 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 15:58:22,779 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-14 15:58:22,996 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 15:58:23,016 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 15:58:23,019 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 15:58:23,020 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 15:58:23,021 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 15:58:23,022 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-14 15:58:23,215 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 15:58:23,215 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 15:58:23,217 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-14 15:58:24,340 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 15:58:24,509 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 15:58:24,517 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-14 15:58:24,530 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01245fed0/64800b7e49ae49b581dd6743b94836b5/FLAGdb9933824
[2024-06-14 15:58:24,541 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01245fed0/64800b7e49ae49b581dd6743b94836b5
[2024-06-14 15:58:24,541 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 15:58:24,542 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 15:58:24,543 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 15:58:24,543 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 15:58:24,548 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 15:58:24,549 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:58:23" (1/2) ...
[2024-06-14 15:58:24,550 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e17a0cf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:58:24, skipping insertion in model container
[2024-06-14 15:58:24,550 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:58:23" (1/2) ...
[2024-06-14 15:58:24,551 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@34e09fc3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:58:24, skipping insertion in model container
[2024-06-14 15:58:24,551 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:58:24" (2/2) ...
[2024-06-14 15:58:24,551 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e17a0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:24, skipping insertion in model container
[2024-06-14 15:58:24,551 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:58:24" (2/2) ...
[2024-06-14 15:58:24,552 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 15:58:24,625 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 15:58:24,626 INFO  L97    edCorrectnessWitness]: Location invariant before [L818-L818] ((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_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_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))
[2024-06-14 15:58:24,627 INFO  L97    edCorrectnessWitness]: Location invariant before [L816-L816] ((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_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_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))
[2024-06-14 15:58:24,627 INFO  L97    edCorrectnessWitness]: Location invariant before [L819-L819] ((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_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_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))
[2024-06-14 15:58:24,628 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 15:58:24,628 INFO  L106   edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1;
[2024-06-14 15:58:24,665 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 15:58:24,985 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:58:24,992 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 15:58:25,289 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:58:25,329 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 15:58:25,329 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25 WrapperNode
[2024-06-14 15:58:25,329 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 15:58:25,330 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 15:58:25,330 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 15:58:25,331 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 15:58:25,336 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (1/1) ...
[2024-06-14 15:58:25,376 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (1/1) ...
[2024-06-14 15:58:25,471 INFO  L138                Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142
[2024-06-14 15:58:25,471 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 15:58:25,472 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 15:58:25,472 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 15:58:25,472 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 15:58:25,482 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (1/1) ...
[2024-06-14 15:58:25,482 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (1/1) ...
[2024-06-14 15:58:25,505 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (1/1) ...
[2024-06-14 15:58:25,540 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-14 15:58:25,540 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (1/1) ...
[2024-06-14 15:58:25,541 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (1/1) ...
[2024-06-14 15:58:25,568 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (1/1) ...
[2024-06-14 15:58:25,570 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (1/1) ...
[2024-06-14 15:58:25,580 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (1/1) ...
[2024-06-14 15:58:25,585 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (1/1) ...
[2024-06-14 15:58:25,600 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 15:58:25,601 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 15:58:25,602 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 15:58:25,602 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 15:58:25,603 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (1/1) ...
[2024-06-14 15:58:25,608 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:58:25,615 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 15:58:25,628 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-14 15:58:25,649 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-14 15:58:25,663 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 15:58:25,663 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 15:58:25,663 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 15:58:25,663 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 15:58:25,663 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 15:58:25,664 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 15:58:25,664 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 15:58:25,664 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 15:58:25,664 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 15:58:25,664 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 15:58:25,664 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 15:58:25,665 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 15:58:25,666 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 15:58:25,788 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 15:58:25,791 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 15:58:26,752 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 15:58:26,753 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 15:58:26,929 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 15:58:26,929 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 15:58:26,930 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:58:26 BoogieIcfgContainer
[2024-06-14 15:58:26,930 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 15:58:26,933 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 15:58:26,933 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 15:58:26,935 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 15:58:26,935 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:58:23" (1/4) ...
[2024-06-14 15:58:26,936 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79407d71 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:58:26, skipping insertion in model container
[2024-06-14 15:58:26,936 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:58:24" (2/4) ...
[2024-06-14 15:58:26,936 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79407d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:58:26, skipping insertion in model container
[2024-06-14 15:58:26,936 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:58:25" (3/4) ...
[2024-06-14 15:58:26,937 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79407d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:58:26, skipping insertion in model container
[2024-06-14 15:58:26,938 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:58:26" (4/4) ...
[2024-06-14 15:58:26,938 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-14 15:58:26,950 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 15:58:26,951 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 15:58:26,951 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 15:58:27,026 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 15:58:27,051 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow
[2024-06-14 15:58:27,093 INFO  L124   PetriNetUnfolderBase]: 0/37 cut-off events.
[2024-06-14 15:58:27,094 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:58:27,095 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 15:58:27,095 INFO  L82        GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow
[2024-06-14 15:58:27,097 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow
[2024-06-14 15:58:27,110 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 15:58:27,115 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;@2c64c5ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 15:58:27,115 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 15:58:27,123 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 15:58:27,123 INFO  L124   PetriNetUnfolderBase]: 0/7 cut-off events.
[2024-06-14 15:58:27,123 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:58:27,123 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:27,124 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:27,124 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:27,128 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:27,128 INFO  L85        PathProgramCache]: Analyzing trace with hash -1507050491, now seen corresponding path program 1 times
[2024-06-14 15:58:27,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:27,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992311812]
[2024-06-14 15:58:27,138 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:27,138 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:27,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:31,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:31,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:31,077 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992311812]
[2024-06-14 15:58:31,077 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992311812] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:31,078 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:31,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 15:58:31,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688278217]
[2024-06-14 15:58:31,079 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:31,085 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 15:58:31,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:31,106 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 15:58:31,107 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 15:58:31,181 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-14 15:58:31,183 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand  has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:31,183 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:31,183 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-14 15:58:31,184 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:31,886 INFO  L124   PetriNetUnfolderBase]: 1156/1754 cut-off events.
[2024-06-14 15:58:31,887 INFO  L125   PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-06-14 15:58:31,893 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3583 conditions, 1754 events. 1156/1754 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7866 event pairs, 805 based on Foata normal form. 1/1718 useless extension candidates. Maximal degree in co-relation 3568. Up to 1740 conditions per place. 
[2024-06-14 15:58:31,903 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 33 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2024-06-14 15:58:31,903 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 171 flow
[2024-06-14 15:58:31,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 15:58:31,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 15:58:31,913 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions.
[2024-06-14 15:58:31,915 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5583333333333333
[2024-06-14 15:58:31,917 INFO  L175             Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 67 transitions.
[2024-06-14 15:58:31,918 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 171 flow
[2024-06-14 15:58:31,920 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 15:58:31,922 INFO  L231             Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow
[2024-06-14 15:58:31,924 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34}
[2024-06-14 15:58:31,927 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places.
[2024-06-14 15:58:31,927 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow
[2024-06-14 15:58:31,927 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:31,928 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:31,928 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:31,928 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 15:58:31,928 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:31,929 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:31,929 INFO  L85        PathProgramCache]: Analyzing trace with hash -871499996, now seen corresponding path program 1 times
[2024-06-14 15:58:31,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:31,930 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879446651]
[2024-06-14 15:58:31,930 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:31,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:32,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:35,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:35,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:35,223 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879446651]
[2024-06-14 15:58:35,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879446651] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:35,223 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:35,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 15:58:35,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931187205]
[2024-06-14 15:58:35,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:35,226 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 15:58:35,226 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:35,226 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 15:58:35,226 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-14 15:58:35,296 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-14 15:58:35,296 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:35,296 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:35,296 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-14 15:58:35,296 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:35,833 INFO  L124   PetriNetUnfolderBase]: 1150/1745 cut-off events.
[2024-06-14 15:58:35,833 INFO  L125   PetriNetUnfolderBase]: For 338/346 co-relation queries the response was YES.
[2024-06-14 15:58:35,835 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4054 conditions, 1745 events. 1150/1745 cut-off events. For 338/346 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7766 event pairs, 699 based on Foata normal form. 6/1749 useless extension candidates. Maximal degree in co-relation 4039. Up to 1716 conditions per place. 
[2024-06-14 15:58:35,841 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 40 selfloop transitions, 7 changer transitions 0/51 dead transitions.
[2024-06-14 15:58:35,842 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 238 flow
[2024-06-14 15:58:35,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 15:58:35,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 15:58:35,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions.
[2024-06-14 15:58:35,843 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5375
[2024-06-14 15:58:35,843 INFO  L175             Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 86 transitions.
[2024-06-14 15:58:35,843 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 238 flow
[2024-06-14 15:58:35,844 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 15:58:35,845 INFO  L231             Difference]: Finished difference. Result has 44 places, 37 transitions, 134 flow
[2024-06-14 15:58:35,845 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=44, PETRI_TRANSITIONS=37}
[2024-06-14 15:58:35,846 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places.
[2024-06-14 15:58:35,846 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 134 flow
[2024-06-14 15:58:35,846 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:35,847 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:35,847 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:35,847 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 15:58:35,847 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:35,847 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:35,847 INFO  L85        PathProgramCache]: Analyzing trace with hash -1246694692, now seen corresponding path program 1 times
[2024-06-14 15:58:35,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:35,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855356622]
[2024-06-14 15:58:35,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:35,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:35,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:38,532 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:38,533 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:38,533 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855356622]
[2024-06-14 15:58:38,533 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855356622] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:38,533 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:38,533 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 15:58:38,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854400484]
[2024-06-14 15:58:38,534 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:38,534 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 15:58:38,534 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:38,535 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 15:58:38,535 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-14 15:58:38,624 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-14 15:58:38,625 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 134 flow. Second operand  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:38,625 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:38,625 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-14 15:58:38,625 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:39,335 INFO  L124   PetriNetUnfolderBase]: 1405/2113 cut-off events.
[2024-06-14 15:58:39,335 INFO  L125   PetriNetUnfolderBase]: For 1053/1053 co-relation queries the response was YES.
[2024-06-14 15:58:39,338 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5409 conditions, 2113 events. 1405/2113 cut-off events. For 1053/1053 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9500 event pairs, 627 based on Foata normal form. 7/2119 useless extension candidates. Maximal degree in co-relation 5392. Up to 1974 conditions per place. 
[2024-06-14 15:58:39,346 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 62 selfloop transitions, 14 changer transitions 0/79 dead transitions.
[2024-06-14 15:58:39,347 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 423 flow
[2024-06-14 15:58:39,347 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:58:39,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:58:39,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions.
[2024-06-14 15:58:39,349 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.555
[2024-06-14 15:58:39,349 INFO  L175             Difference]: Start difference. First operand has 44 places, 37 transitions, 134 flow. Second operand 5 states and 111 transitions.
[2024-06-14 15:58:39,349 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 423 flow
[2024-06-14 15:58:39,351 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 402 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-06-14 15:58:39,353 INFO  L231             Difference]: Finished difference. Result has 49 places, 50 transitions, 231 flow
[2024-06-14 15:58:39,353 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=49, PETRI_TRANSITIONS=50}
[2024-06-14 15:58:39,354 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places.
[2024-06-14 15:58:39,354 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 231 flow
[2024-06-14 15:58:39,354 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:39,355 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:39,355 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:39,355 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 15:58:39,355 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-14 15:58:39,356 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:39,356 INFO  L85        PathProgramCache]: Analyzing trace with hash 7171651, now seen corresponding path program 1 times
[2024-06-14 15:58:39,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:39,356 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313663834]
[2024-06-14 15:58:39,356 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:39,356 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:39,402 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:42,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:42,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:42,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313663834]
[2024-06-14 15:58:42,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313663834] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:42,492 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:42,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:58:42,492 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869081858]
[2024-06-14 15:58:42,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:42,493 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:58:42,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:42,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:58:42,494 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:58:42,579 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-14 15:58:42,579 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 231 flow. Second operand  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:42,580 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:42,580 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-14 15:58:42,580 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:43,428 INFO  L124   PetriNetUnfolderBase]: 1427/2146 cut-off events.
[2024-06-14 15:58:43,428 INFO  L125   PetriNetUnfolderBase]: For 2544/2546 co-relation queries the response was YES.
[2024-06-14 15:58:43,432 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6651 conditions, 2146 events. 1427/2146 cut-off events. For 2544/2546 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9646 event pairs, 503 based on Foata normal form. 9/2154 useless extension candidates. Maximal degree in co-relation 6631. Up to 1963 conditions per place. 
[2024-06-14 15:58:43,440 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 70 selfloop transitions, 18 changer transitions 0/91 dead transitions.
[2024-06-14 15:58:43,440 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 549 flow
[2024-06-14 15:58:43,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:58:43,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:58:43,444 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions.
[2024-06-14 15:58:43,445 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5458333333333333
[2024-06-14 15:58:43,445 INFO  L175             Difference]: Start difference. First operand has 49 places, 50 transitions, 231 flow. Second operand 6 states and 131 transitions.
[2024-06-14 15:58:43,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 549 flow
[2024-06-14 15:58:43,451 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 545 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-06-14 15:58:43,452 INFO  L231             Difference]: Finished difference. Result has 55 places, 54 transitions, 300 flow
[2024-06-14 15:58:43,453 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=55, PETRI_TRANSITIONS=54}
[2024-06-14 15:58:43,454 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places.
[2024-06-14 15:58:43,454 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 300 flow
[2024-06-14 15:58:43,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:43,454 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:43,455 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:43,455 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 15:58:43,455 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:43,455 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:43,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 1080602535, now seen corresponding path program 1 times
[2024-06-14 15:58:43,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:43,456 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992628652]
[2024-06-14 15:58:43,456 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:43,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:43,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:46,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:46,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:46,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992628652]
[2024-06-14 15:58:46,249 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992628652] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:46,249 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:46,249 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:58:46,249 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624381930]
[2024-06-14 15:58:46,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:46,250 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:58:46,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:46,251 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:58:46,251 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:58:46,339 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-14 15:58:46,340 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 300 flow. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:46,340 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:46,340 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-14 15:58:46,340 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:47,262 INFO  L124   PetriNetUnfolderBase]: 1523/2313 cut-off events.
[2024-06-14 15:58:47,262 INFO  L125   PetriNetUnfolderBase]: For 4121/4123 co-relation queries the response was YES.
[2024-06-14 15:58:47,266 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7924 conditions, 2313 events. 1523/2313 cut-off events. For 4121/4123 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10747 event pairs, 364 based on Foata normal form. 28/2340 useless extension candidates. Maximal degree in co-relation 7901. Up to 1884 conditions per place. 
[2024-06-14 15:58:47,276 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 81 selfloop transitions, 31 changer transitions 0/115 dead transitions.
[2024-06-14 15:58:47,276 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 115 transitions, 778 flow
[2024-06-14 15:58:47,278 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:58:47,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:58:47,279 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions.
[2024-06-14 15:58:47,280 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.55
[2024-06-14 15:58:47,280 INFO  L175             Difference]: Start difference. First operand has 55 places, 54 transitions, 300 flow. Second operand 7 states and 154 transitions.
[2024-06-14 15:58:47,280 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 115 transitions, 778 flow
[2024-06-14 15:58:47,284 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 115 transitions, 737 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-14 15:58:47,287 INFO  L231             Difference]: Finished difference. Result has 61 places, 68 transitions, 469 flow
[2024-06-14 15:58:47,288 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=61, PETRI_TRANSITIONS=68}
[2024-06-14 15:58:47,290 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places.
[2024-06-14 15:58:47,290 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 469 flow
[2024-06-14 15:58:47,290 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:47,294 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:47,294 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:47,295 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 15:58:47,295 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:47,295 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:47,295 INFO  L85        PathProgramCache]: Analyzing trace with hash -674294270, now seen corresponding path program 1 times
[2024-06-14 15:58:47,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:47,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338277752]
[2024-06-14 15:58:47,296 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:47,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:47,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:53,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:53,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:53,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338277752]
[2024-06-14 15:58:53,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338277752] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:53,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:53,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:58:53,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224465880]
[2024-06-14 15:58:53,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:53,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:58:53,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:53,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:58:53,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:58:53,622 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 15:58:53,623 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 469 flow. Second operand  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:53,623 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:53,623 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 15:58:53,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:54,316 INFO  L124   PetriNetUnfolderBase]: 1513/2298 cut-off events.
[2024-06-14 15:58:54,317 INFO  L125   PetriNetUnfolderBase]: For 7550/7550 co-relation queries the response was YES.
[2024-06-14 15:58:54,320 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9256 conditions, 2298 events. 1513/2298 cut-off events. For 7550/7550 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10568 event pairs, 549 based on Foata normal form. 4/2301 useless extension candidates. Maximal degree in co-relation 9228. Up to 2267 conditions per place. 
[2024-06-14 15:58:54,328 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 68 selfloop transitions, 10 changer transitions 0/81 dead transitions.
[2024-06-14 15:58:54,329 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 81 transitions, 665 flow
[2024-06-14 15:58:54,329 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:58:54,329 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:58:54,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions.
[2024-06-14 15:58:54,330 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41
[2024-06-14 15:58:54,330 INFO  L175             Difference]: Start difference. First operand has 61 places, 68 transitions, 469 flow. Second operand 5 states and 82 transitions.
[2024-06-14 15:58:54,330 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 81 transitions, 665 flow
[2024-06-14 15:58:54,334 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 647 flow, removed 9 selfloop flow, removed 0 redundant places.
[2024-06-14 15:58:54,335 INFO  L231             Difference]: Finished difference. Result has 67 places, 70 transitions, 499 flow
[2024-06-14 15:58:54,335 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=499, PETRI_PLACES=67, PETRI_TRANSITIONS=70}
[2024-06-14 15:58:54,336 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places.
[2024-06-14 15:58:54,336 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 499 flow
[2024-06-14 15:58:54,336 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:54,336 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:54,336 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:54,336 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 15:58:54,337 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:54,337 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:54,337 INFO  L85        PathProgramCache]: Analyzing trace with hash -492888641, now seen corresponding path program 1 times
[2024-06-14 15:58:54,338 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:54,340 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585934883]
[2024-06-14 15:58:54,340 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:54,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:54,379 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:59,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-14 15:58:59,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:59,279 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585934883]
[2024-06-14 15:58:59,279 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585934883] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:59,279 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:59,279 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:58:59,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99517379]
[2024-06-14 15:58:59,279 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:59,280 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:58:59,280 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:59,281 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:58:59,281 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:58:59,386 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 15:58:59,387 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 499 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:58:59,387 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:59,387 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 15:58:59,387 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:00,068 INFO  L124   PetriNetUnfolderBase]: 1525/2317 cut-off events.
[2024-06-14 15:59:00,069 INFO  L125   PetriNetUnfolderBase]: For 8771/8773 co-relation queries the response was YES.
[2024-06-14 15:59:00,073 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9502 conditions, 2317 events. 1525/2317 cut-off events. For 8771/8773 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10680 event pairs, 467 based on Foata normal form. 10/2326 useless extension candidates. Maximal degree in co-relation 9469. Up to 2165 conditions per place. 
[2024-06-14 15:59:00,082 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 75 selfloop transitions, 18 changer transitions 0/96 dead transitions.
[2024-06-14 15:59:00,082 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 96 transitions, 803 flow
[2024-06-14 15:59:00,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:59:00,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:59:00,084 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-14 15:59:00,084 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44166666666666665
[2024-06-14 15:59:00,084 INFO  L175             Difference]: Start difference. First operand has 67 places, 70 transitions, 499 flow. Second operand 6 states and 106 transitions.
[2024-06-14 15:59:00,084 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 96 transitions, 803 flow
[2024-06-14 15:59:00,091 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 781 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-06-14 15:59:00,092 INFO  L231             Difference]: Finished difference. Result has 71 places, 74 transitions, 569 flow
[2024-06-14 15:59:00,092 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=71, PETRI_TRANSITIONS=74}
[2024-06-14 15:59:00,093 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places.
[2024-06-14 15:59:00,093 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 569 flow
[2024-06-14 15:59:00,093 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:00,093 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:00,093 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:00,093 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 15:59:00,094 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:00,094 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:00,094 INFO  L85        PathProgramCache]: Analyzing trace with hash 429557347, now seen corresponding path program 2 times
[2024-06-14 15:59:00,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:00,094 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252158694]
[2024-06-14 15:59:00,094 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:00,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:00,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:04,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:04,816 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:04,816 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252158694]
[2024-06-14 15:59:04,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252158694] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:04,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:04,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:59:04,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721007724]
[2024-06-14 15:59:04,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:04,818 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:59:04,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:04,819 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:59:04,819 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:59:04,921 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 15:59:04,922 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 569 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:04,922 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:04,922 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 15:59:04,922 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:05,877 INFO  L124   PetriNetUnfolderBase]: 1499/2274 cut-off events.
[2024-06-14 15:59:05,878 INFO  L125   PetriNetUnfolderBase]: For 10252/10252 co-relation queries the response was YES.
[2024-06-14 15:59:05,885 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9638 conditions, 2274 events. 1499/2274 cut-off events. For 10252/10252 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10355 event pairs, 509 based on Foata normal form. 4/2277 useless extension candidates. Maximal degree in co-relation 9603. Up to 2234 conditions per place. 
[2024-06-14 15:59:05,896 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 77 selfloop transitions, 11 changer transitions 0/91 dead transitions.
[2024-06-14 15:59:05,896 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 798 flow
[2024-06-14 15:59:05,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:59:05,899 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:59:05,899 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-14 15:59:05,899 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-14 15:59:05,900 INFO  L175             Difference]: Start difference. First operand has 71 places, 74 transitions, 569 flow. Second operand 6 states and 96 transitions.
[2024-06-14 15:59:05,900 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 798 flow
[2024-06-14 15:59:05,912 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 91 transitions, 775 flow, removed 1 selfloop flow, removed 3 redundant places.
[2024-06-14 15:59:05,914 INFO  L231             Difference]: Finished difference. Result has 74 places, 75 transitions, 589 flow
[2024-06-14 15:59:05,914 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=74, PETRI_TRANSITIONS=75}
[2024-06-14 15:59:05,914 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places.
[2024-06-14 15:59:05,915 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 589 flow
[2024-06-14 15:59:05,915 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:05,915 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:05,915 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:05,915 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 15:59:05,915 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:05,916 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:05,916 INFO  L85        PathProgramCache]: Analyzing trace with hash -487166785, now seen corresponding path program 1 times
[2024-06-14 15:59:05,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:05,916 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656224928]
[2024-06-14 15:59:05,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:05,917 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:05,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:12,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:12,890 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:12,891 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656224928]
[2024-06-14 15:59:12,891 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656224928] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:12,891 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:12,891 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:59:12,891 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950070341]
[2024-06-14 15:59:12,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:12,892 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:59:12,893 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:12,893 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:59:12,893 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:59:12,993 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 15:59:12,997 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 589 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:12,998 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:12,998 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 15:59:12,998 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:13,818 INFO  L124   PetriNetUnfolderBase]: 1491/2262 cut-off events.
[2024-06-14 15:59:13,818 INFO  L125   PetriNetUnfolderBase]: For 11636/11636 co-relation queries the response was YES.
[2024-06-14 15:59:13,822 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9729 conditions, 2262 events. 1491/2262 cut-off events. For 11636/11636 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10327 event pairs, 490 based on Foata normal form. 4/2265 useless extension candidates. Maximal degree in co-relation 9693. Up to 2213 conditions per place. 
[2024-06-14 15:59:13,829 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 78 selfloop transitions, 12 changer transitions 0/93 dead transitions.
[2024-06-14 15:59:13,829 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 93 transitions, 825 flow
[2024-06-14 15:59:13,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:59:13,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:59:13,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-14 15:59:13,830 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-14 15:59:13,830 INFO  L175             Difference]: Start difference. First operand has 74 places, 75 transitions, 589 flow. Second operand 6 states and 96 transitions.
[2024-06-14 15:59:13,830 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 93 transitions, 825 flow
[2024-06-14 15:59:13,841 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 93 transitions, 801 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-14 15:59:13,845 INFO  L231             Difference]: Finished difference. Result has 76 places, 77 transitions, 616 flow
[2024-06-14 15:59:13,846 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=616, PETRI_PLACES=76, PETRI_TRANSITIONS=77}
[2024-06-14 15:59:13,846 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places.
[2024-06-14 15:59:13,846 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 77 transitions, 616 flow
[2024-06-14 15:59:13,846 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:13,846 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:13,847 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:13,847 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 15:59:13,847 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:13,847 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:13,847 INFO  L85        PathProgramCache]: Analyzing trace with hash -599087197, now seen corresponding path program 1 times
[2024-06-14 15:59:13,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:13,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670343835]
[2024-06-14 15:59:13,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:13,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:13,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:19,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:19,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:19,299 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670343835]
[2024-06-14 15:59:19,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670343835] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:19,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:19,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:59:19,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695973416]
[2024-06-14 15:59:19,300 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:19,300 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:59:19,303 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:19,304 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:59:19,307 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:59:19,461 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 15:59:19,461 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 77 transitions, 616 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:19,462 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:19,462 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 15:59:19,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:20,296 INFO  L124   PetriNetUnfolderBase]: 1486/2255 cut-off events.
[2024-06-14 15:59:20,296 INFO  L125   PetriNetUnfolderBase]: For 13179/13179 co-relation queries the response was YES.
[2024-06-14 15:59:20,304 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9985 conditions, 2255 events. 1486/2255 cut-off events. For 13179/13179 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10327 event pairs, 503 based on Foata normal form. 2/2256 useless extension candidates. Maximal degree in co-relation 9949. Up to 2197 conditions per place. 
[2024-06-14 15:59:20,315 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 74 selfloop transitions, 16 changer transitions 0/93 dead transitions.
[2024-06-14 15:59:20,315 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 93 transitions, 838 flow
[2024-06-14 15:59:20,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:59:20,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:59:20,317 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-14 15:59:20,317 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4041666666666667
[2024-06-14 15:59:20,317 INFO  L175             Difference]: Start difference. First operand has 76 places, 77 transitions, 616 flow. Second operand 6 states and 97 transitions.
[2024-06-14 15:59:20,317 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 93 transitions, 838 flow
[2024-06-14 15:59:20,328 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 93 transitions, 801 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-14 15:59:20,329 INFO  L231             Difference]: Finished difference. Result has 78 places, 77 transitions, 623 flow
[2024-06-14 15:59:20,329 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=623, PETRI_PLACES=78, PETRI_TRANSITIONS=77}
[2024-06-14 15:59:20,330 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places.
[2024-06-14 15:59:20,330 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 623 flow
[2024-06-14 15:59:20,330 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:20,330 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:20,330 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:20,331 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 15:59:20,331 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:20,331 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:20,331 INFO  L85        PathProgramCache]: Analyzing trace with hash -1539740350, now seen corresponding path program 1 times
[2024-06-14 15:59:20,331 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:20,331 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123715971]
[2024-06-14 15:59:20,332 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:20,332 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:20,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:26,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:26,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:26,290 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123715971]
[2024-06-14 15:59:26,290 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123715971] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:26,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:26,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:59:26,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975566422]
[2024-06-14 15:59:26,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:26,291 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:59:26,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:26,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:59:26,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:59:26,411 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 15:59:26,411 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 623 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:26,411 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:26,411 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 15:59:26,411 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:27,160 INFO  L124   PetriNetUnfolderBase]: 1508/2288 cut-off events.
[2024-06-14 15:59:27,161 INFO  L125   PetriNetUnfolderBase]: For 15329/15331 co-relation queries the response was YES.
[2024-06-14 15:59:27,166 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10297 conditions, 2288 events. 1508/2288 cut-off events. For 15329/15331 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10506 event pairs, 430 based on Foata normal form. 4/2291 useless extension candidates. Maximal degree in co-relation 10260. Up to 2023 conditions per place. 
[2024-06-14 15:59:27,173 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 76 selfloop transitions, 36 changer transitions 0/115 dead transitions.
[2024-06-14 15:59:27,174 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 115 transitions, 1067 flow
[2024-06-14 15:59:27,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:59:27,175 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:59:27,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-14 15:59:27,176 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45357142857142857
[2024-06-14 15:59:27,176 INFO  L175             Difference]: Start difference. First operand has 78 places, 77 transitions, 623 flow. Second operand 7 states and 127 transitions.
[2024-06-14 15:59:27,176 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 115 transitions, 1067 flow
[2024-06-14 15:59:27,190 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 115 transitions, 1025 flow, removed 1 selfloop flow, removed 5 redundant places.
[2024-06-14 15:59:27,192 INFO  L231             Difference]: Finished difference. Result has 80 places, 83 transitions, 715 flow
[2024-06-14 15:59:27,192 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=715, PETRI_PLACES=80, PETRI_TRANSITIONS=83}
[2024-06-14 15:59:27,192 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places.
[2024-06-14 15:59:27,192 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 715 flow
[2024-06-14 15:59:27,193 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:27,193 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:27,193 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:27,193 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 15:59:27,193 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:27,193 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:27,194 INFO  L85        PathProgramCache]: Analyzing trace with hash -1539650140, now seen corresponding path program 2 times
[2024-06-14 15:59:27,194 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:27,194 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781391202]
[2024-06-14 15:59:27,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:27,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:27,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:32,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:32,791 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:32,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781391202]
[2024-06-14 15:59:32,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781391202] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:32,792 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:32,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:59:32,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505974513]
[2024-06-14 15:59:32,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:32,792 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:59:32,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:32,793 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:59:32,793 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:59:32,943 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 15:59:32,943 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 715 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:32,944 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:32,944 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 15:59:32,944 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:33,738 INFO  L124   PetriNetUnfolderBase]: 1498/2274 cut-off events.
[2024-06-14 15:59:33,738 INFO  L125   PetriNetUnfolderBase]: For 17845/17847 co-relation queries the response was YES.
[2024-06-14 15:59:33,743 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10775 conditions, 2274 events. 1498/2274 cut-off events. For 17845/17847 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10409 event pairs, 440 based on Foata normal form. 4/2277 useless extension candidates. Maximal degree in co-relation 10737. Up to 2082 conditions per place. 
[2024-06-14 15:59:33,751 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 78 selfloop transitions, 29 changer transitions 0/110 dead transitions.
[2024-06-14 15:59:33,751 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 110 transitions, 1049 flow
[2024-06-14 15:59:33,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:59:33,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:59:33,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-14 15:59:33,761 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4357142857142857
[2024-06-14 15:59:33,761 INFO  L175             Difference]: Start difference. First operand has 80 places, 83 transitions, 715 flow. Second operand 7 states and 122 transitions.
[2024-06-14 15:59:33,761 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 110 transitions, 1049 flow
[2024-06-14 15:59:33,778 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 110 transitions, 998 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-14 15:59:33,779 INFO  L231             Difference]: Finished difference. Result has 84 places, 83 transitions, 730 flow
[2024-06-14 15:59:33,780 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=730, PETRI_PLACES=84, PETRI_TRANSITIONS=83}
[2024-06-14 15:59:33,780 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places.
[2024-06-14 15:59:33,780 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 730 flow
[2024-06-14 15:59:33,780 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:33,780 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:33,781 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:33,781 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 15:59:33,781 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:33,781 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:33,781 INFO  L85        PathProgramCache]: Analyzing trace with hash -1219545762, now seen corresponding path program 1 times
[2024-06-14 15:59:33,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:33,781 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427216205]
[2024-06-14 15:59:33,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:33,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:33,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:39,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:39,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:39,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427216205]
[2024-06-14 15:59:39,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427216205] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:39,849 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:39,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:59:39,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880602467]
[2024-06-14 15:59:39,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:39,849 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:59:39,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:39,850 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:59:39,850 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:59:39,961 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 15:59:39,961 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 730 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:39,961 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:39,961 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 15:59:39,961 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:40,716 INFO  L124   PetriNetUnfolderBase]: 1532/2328 cut-off events.
[2024-06-14 15:59:40,717 INFO  L125   PetriNetUnfolderBase]: For 20657/20659 co-relation queries the response was YES.
[2024-06-14 15:59:40,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11258 conditions, 2328 events. 1532/2328 cut-off events. For 20657/20659 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10777 event pairs, 428 based on Foata normal form. 10/2337 useless extension candidates. Maximal degree in co-relation 11218. Up to 2152 conditions per place. 
[2024-06-14 15:59:40,731 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 86 selfloop transitions, 22 changer transitions 0/111 dead transitions.
[2024-06-14 15:59:40,731 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 111 transitions, 1038 flow
[2024-06-14 15:59:40,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:59:40,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:59:40,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-14 15:59:40,734 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-14 15:59:40,734 INFO  L175             Difference]: Start difference. First operand has 84 places, 83 transitions, 730 flow. Second operand 7 states and 119 transitions.
[2024-06-14 15:59:40,734 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 111 transitions, 1038 flow
[2024-06-14 15:59:40,749 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 111 transitions, 959 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-14 15:59:40,750 INFO  L231             Difference]: Finished difference. Result has 85 places, 86 transitions, 735 flow
[2024-06-14 15:59:40,750 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=735, PETRI_PLACES=85, PETRI_TRANSITIONS=86}
[2024-06-14 15:59:40,751 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places.
[2024-06-14 15:59:40,751 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 735 flow
[2024-06-14 15:59:40,751 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:40,751 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:40,751 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:40,752 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 15:59:40,752 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:40,752 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:40,752 INFO  L85        PathProgramCache]: Analyzing trace with hash -1871196791, now seen corresponding path program 1 times
[2024-06-14 15:59:40,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:40,752 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858386601]
[2024-06-14 15:59:40,753 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:40,753 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:40,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:46,856 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:46,856 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:46,856 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858386601]
[2024-06-14 15:59:46,856 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858386601] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:46,856 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:46,857 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:59:46,857 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423034959]
[2024-06-14 15:59:46,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:46,857 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:59:46,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:46,857 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:59:46,858 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:59:46,993 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 15:59:46,994 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 735 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:46,994 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:46,994 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 15:59:46,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:47,667 INFO  L124   PetriNetUnfolderBase]: 1512/2288 cut-off events.
[2024-06-14 15:59:47,667 INFO  L125   PetriNetUnfolderBase]: For 22651/22653 co-relation queries the response was YES.
[2024-06-14 15:59:47,673 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11404 conditions, 2288 events. 1512/2288 cut-off events. For 22651/22653 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10416 event pairs, 437 based on Foata normal form. 2/2289 useless extension candidates. Maximal degree in co-relation 11363. Up to 2121 conditions per place. 
[2024-06-14 15:59:47,680 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 78 selfloop transitions, 28 changer transitions 0/109 dead transitions.
[2024-06-14 15:59:47,680 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 109 transitions, 1009 flow
[2024-06-14 15:59:47,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:59:47,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:59:47,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-14 15:59:47,682 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-14 15:59:47,682 INFO  L175             Difference]: Start difference. First operand has 85 places, 86 transitions, 735 flow. Second operand 6 states and 108 transitions.
[2024-06-14 15:59:47,682 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 109 transitions, 1009 flow
[2024-06-14 15:59:47,698 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 109 transitions, 945 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-14 15:59:47,700 INFO  L231             Difference]: Finished difference. Result has 86 places, 86 transitions, 742 flow
[2024-06-14 15:59:47,700 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=86, PETRI_TRANSITIONS=86}
[2024-06-14 15:59:47,700 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places.
[2024-06-14 15:59:47,700 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 742 flow
[2024-06-14 15:59:47,701 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:47,701 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:47,701 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:47,701 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 15:59:47,701 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:47,701 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:47,702 INFO  L85        PathProgramCache]: Analyzing trace with hash -1870929664, now seen corresponding path program 2 times
[2024-06-14 15:59:47,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:47,702 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123355618]
[2024-06-14 15:59:47,702 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:47,702 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:47,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:53,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:53,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:53,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123355618]
[2024-06-14 15:59:53,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123355618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:53,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:53,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:59:53,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966500922]
[2024-06-14 15:59:53,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:53,713 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:59:53,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:53,713 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:59:53,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:59:53,861 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 15:59:53,862 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 742 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:53,862 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:53,862 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 15:59:53,862 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:54,678 INFO  L124   PetriNetUnfolderBase]: 1529/2314 cut-off events.
[2024-06-14 15:59:54,678 INFO  L125   PetriNetUnfolderBase]: For 25661/25661 co-relation queries the response was YES.
[2024-06-14 15:59:54,684 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11677 conditions, 2314 events. 1529/2314 cut-off events. For 25661/25661 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10494 event pairs, 464 based on Foata normal form. 4/2317 useless extension candidates. Maximal degree in co-relation 11635. Up to 2242 conditions per place. 
[2024-06-14 15:59:54,691 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 92 selfloop transitions, 14 changer transitions 0/109 dead transitions.
[2024-06-14 15:59:54,691 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 109 transitions, 1030 flow
[2024-06-14 15:59:54,693 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:59:54,693 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:59:54,694 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions.
[2024-06-14 15:59:54,694 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39285714285714285
[2024-06-14 15:59:54,694 INFO  L175             Difference]: Start difference. First operand has 86 places, 86 transitions, 742 flow. Second operand 7 states and 110 transitions.
[2024-06-14 15:59:54,694 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 109 transitions, 1030 flow
[2024-06-14 15:59:54,708 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 109 transitions, 974 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-06-14 15:59:54,710 INFO  L231             Difference]: Finished difference. Result has 88 places, 88 transitions, 749 flow
[2024-06-14 15:59:54,710 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=749, PETRI_PLACES=88, PETRI_TRANSITIONS=88}
[2024-06-14 15:59:54,711 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places.
[2024-06-14 15:59:54,711 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 749 flow
[2024-06-14 15:59:54,711 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:59:54,711 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:54,711 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:54,711 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 15:59:54,712 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:54,712 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:54,712 INFO  L85        PathProgramCache]: Analyzing trace with hash -16084288, now seen corresponding path program 3 times
[2024-06-14 15:59:54,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:54,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592108881]
[2024-06-14 15:59:54,712 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:54,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:54,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:00,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:00,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:00,967 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592108881]
[2024-06-14 16:00:00,967 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592108881] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:00,967 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:00,967 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:00,967 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586672537]
[2024-06-14 16:00:00,967 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:00,967 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:00,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:00,967 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:00,968 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:01,130 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:00:01,130 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 749 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:01,130 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:01,130 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:00:01,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:01,930 INFO  L124   PetriNetUnfolderBase]: 1521/2302 cut-off events.
[2024-06-14 16:00:01,930 INFO  L125   PetriNetUnfolderBase]: For 28063/28063 co-relation queries the response was YES.
[2024-06-14 16:00:01,935 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11782 conditions, 2302 events. 1521/2302 cut-off events. For 28063/28063 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10457 event pairs, 482 based on Foata normal form. 4/2305 useless extension candidates. Maximal degree in co-relation 11739. Up to 2221 conditions per place. 
[2024-06-14 16:00:01,941 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 90 selfloop transitions, 18 changer transitions 0/111 dead transitions.
[2024-06-14 16:00:01,941 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 111 transitions, 1047 flow
[2024-06-14 16:00:01,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:00:01,942 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:00:01,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions.
[2024-06-14 16:00:01,943 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3964285714285714
[2024-06-14 16:00:01,943 INFO  L175             Difference]: Start difference. First operand has 88 places, 88 transitions, 749 flow. Second operand 7 states and 111 transitions.
[2024-06-14 16:00:01,943 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 111 transitions, 1047 flow
[2024-06-14 16:00:01,958 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 111 transitions, 1002 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-14 16:00:01,960 INFO  L231             Difference]: Finished difference. Result has 90 places, 90 transitions, 780 flow
[2024-06-14 16:00:01,961 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=780, PETRI_PLACES=90, PETRI_TRANSITIONS=90}
[2024-06-14 16:00:01,961 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places.
[2024-06-14 16:00:01,961 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 780 flow
[2024-06-14 16:00:01,962 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:01,962 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:01,962 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:01,962 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 16:00:01,962 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-14 16:00:01,963 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:01,963 INFO  L85        PathProgramCache]: Analyzing trace with hash -1987259388, now seen corresponding path program 1 times
[2024-06-14 16:00:01,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:01,963 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872582659]
[2024-06-14 16:00:01,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:01,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:01,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:10,636 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:10,636 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:10,636 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872582659]
[2024-06-14 16:00:10,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872582659] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:10,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:10,636 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:00:10,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462768311]
[2024-06-14 16:00:10,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:10,638 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:00:10,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:10,639 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:00:10,639 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:00:10,728 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:00:10,729 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 780 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:10,730 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:10,730 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:00:10,730 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:11,598 INFO  L124   PetriNetUnfolderBase]: 1515/2294 cut-off events.
[2024-06-14 16:00:11,599 INFO  L125   PetriNetUnfolderBase]: For 30600/30600 co-relation queries the response was YES.
[2024-06-14 16:00:11,603 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11972 conditions, 2294 events. 1515/2294 cut-off events. For 30600/30600 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10351 event pairs, 481 based on Foata normal form. 2/2295 useless extension candidates. Maximal degree in co-relation 11928. Up to 2272 conditions per place. 
[2024-06-14 16:00:11,609 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 89 selfloop transitions, 10 changer transitions 0/102 dead transitions.
[2024-06-14 16:00:11,609 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 1024 flow
[2024-06-14 16:00:11,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 16:00:11,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 16:00:11,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions.
[2024-06-14 16:00:11,610 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.395
[2024-06-14 16:00:11,610 INFO  L175             Difference]: Start difference. First operand has 90 places, 90 transitions, 780 flow. Second operand 5 states and 79 transitions.
[2024-06-14 16:00:11,610 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 1024 flow
[2024-06-14 16:00:11,626 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 102 transitions, 968 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-14 16:00:11,627 INFO  L231             Difference]: Finished difference. Result has 90 places, 93 transitions, 780 flow
[2024-06-14 16:00:11,627 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=780, PETRI_PLACES=90, PETRI_TRANSITIONS=93}
[2024-06-14 16:00:11,628 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places.
[2024-06-14 16:00:11,628 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 780 flow
[2024-06-14 16:00:11,628 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:11,628 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:11,628 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:11,629 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 16:00:11,629 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:11,629 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:11,629 INFO  L85        PathProgramCache]: Analyzing trace with hash 730513050, now seen corresponding path program 1 times
[2024-06-14 16:00:11,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:11,629 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98608892]
[2024-06-14 16:00:11,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:11,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:11,674 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:18,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:18,760 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:18,760 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98608892]
[2024-06-14 16:00:18,760 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98608892] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:18,760 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:18,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:18,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751098801]
[2024-06-14 16:00:18,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:18,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:18,762 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:18,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:18,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:18,942 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:00:18,942 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 780 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:18,942 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:18,943 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:00:18,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:19,867 INFO  L124   PetriNetUnfolderBase]: 1692/2594 cut-off events.
[2024-06-14 16:00:19,867 INFO  L125   PetriNetUnfolderBase]: For 38054/38056 co-relation queries the response was YES.
[2024-06-14 16:00:19,874 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13569 conditions, 2594 events. 1692/2594 cut-off events. For 38054/38056 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12408 event pairs, 293 based on Foata normal form. 18/2611 useless extension candidates. Maximal degree in co-relation 13524. Up to 1952 conditions per place. 
[2024-06-14 16:00:19,881 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 107 selfloop transitions, 29 changer transitions 0/139 dead transitions.
[2024-06-14 16:00:19,881 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 139 transitions, 1301 flow
[2024-06-14 16:00:19,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:00:19,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:00:19,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-14 16:00:19,884 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.446875
[2024-06-14 16:00:19,884 INFO  L175             Difference]: Start difference. First operand has 90 places, 93 transitions, 780 flow. Second operand 8 states and 143 transitions.
[2024-06-14 16:00:19,884 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 139 transitions, 1301 flow
[2024-06-14 16:00:19,905 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 139 transitions, 1267 flow, removed 9 selfloop flow, removed 3 redundant places.
[2024-06-14 16:00:19,907 INFO  L231             Difference]: Finished difference. Result has 96 places, 96 transitions, 866 flow
[2024-06-14 16:00:19,907 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=866, PETRI_PLACES=96, PETRI_TRANSITIONS=96}
[2024-06-14 16:00:19,907 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places.
[2024-06-14 16:00:19,907 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 866 flow
[2024-06-14 16:00:19,908 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:19,908 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:19,908 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:19,908 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 16:00:19,908 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:19,908 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:19,908 INFO  L85        PathProgramCache]: Analyzing trace with hash 730515840, now seen corresponding path program 2 times
[2024-06-14 16:00:19,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:19,909 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449785854]
[2024-06-14 16:00:19,909 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:19,909 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:19,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:27,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:27,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:27,262 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449785854]
[2024-06-14 16:00:27,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449785854] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:27,262 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:27,262 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:27,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518438501]
[2024-06-14 16:00:27,263 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:27,263 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:27,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:27,263 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:27,264 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:27,399 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:00:27,400 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 866 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:27,400 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:27,400 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:00:27,400 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:28,312 INFO  L124   PetriNetUnfolderBase]: 1697/2609 cut-off events.
[2024-06-14 16:00:28,313 INFO  L125   PetriNetUnfolderBase]: For 41545/41547 co-relation queries the response was YES.
[2024-06-14 16:00:28,319 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13725 conditions, 2609 events. 1697/2609 cut-off events. For 41545/41547 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12525 event pairs, 444 based on Foata normal form. 34/2642 useless extension candidates. Maximal degree in co-relation 13678. Up to 2150 conditions per place. 
[2024-06-14 16:00:28,327 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 103 selfloop transitions, 33 changer transitions 0/139 dead transitions.
[2024-06-14 16:00:28,327 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 139 transitions, 1284 flow
[2024-06-14 16:00:28,329 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:00:28,329 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:00:28,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-14 16:00:28,330 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4361111111111111
[2024-06-14 16:00:28,330 INFO  L175             Difference]: Start difference. First operand has 96 places, 96 transitions, 866 flow. Second operand 9 states and 157 transitions.
[2024-06-14 16:00:28,330 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 139 transitions, 1284 flow
[2024-06-14 16:00:28,365 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 139 transitions, 1238 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-14 16:00:28,367 INFO  L231             Difference]: Finished difference. Result has 101 places, 97 transitions, 921 flow
[2024-06-14 16:00:28,367 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=921, PETRI_PLACES=101, PETRI_TRANSITIONS=97}
[2024-06-14 16:00:28,367 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places.
[2024-06-14 16:00:28,367 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 921 flow
[2024-06-14 16:00:28,368 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:28,368 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:28,368 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:28,368 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 16:00:28,368 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:28,369 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:28,369 INFO  L85        PathProgramCache]: Analyzing trace with hash 848781460, now seen corresponding path program 1 times
[2024-06-14 16:00:28,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:28,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042844376]
[2024-06-14 16:00:28,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:28,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:28,407 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:33,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:33,944 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:33,944 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042844376]
[2024-06-14 16:00:33,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042844376] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:33,944 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:33,944 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:33,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260069827]
[2024-06-14 16:00:33,945 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:33,945 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:33,945 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:33,945 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:33,945 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:34,042 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:00:34,043 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 921 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:34,043 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:34,043 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:00:34,043 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:34,877 INFO  L124   PetriNetUnfolderBase]: 1714/2636 cut-off events.
[2024-06-14 16:00:34,877 INFO  L125   PetriNetUnfolderBase]: For 40089/40091 co-relation queries the response was YES.
[2024-06-14 16:00:34,883 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14138 conditions, 2636 events. 1714/2636 cut-off events. For 40089/40091 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12686 event pairs, 471 based on Foata normal form. 6/2641 useless extension candidates. Maximal degree in co-relation 14089. Up to 2478 conditions per place. 
[2024-06-14 16:00:34,890 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 102 selfloop transitions, 22 changer transitions 0/127 dead transitions.
[2024-06-14 16:00:34,890 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 127 transitions, 1273 flow
[2024-06-14 16:00:34,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:00:34,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:00:34,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-14 16:00:34,893 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43214285714285716
[2024-06-14 16:00:34,893 INFO  L175             Difference]: Start difference. First operand has 101 places, 97 transitions, 921 flow. Second operand 7 states and 121 transitions.
[2024-06-14 16:00:34,893 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 127 transitions, 1273 flow
[2024-06-14 16:00:34,917 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 127 transitions, 1210 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-14 16:00:34,918 INFO  L231             Difference]: Finished difference. Result has 101 places, 99 transitions, 943 flow
[2024-06-14 16:00:34,918 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=943, PETRI_PLACES=101, PETRI_TRANSITIONS=99}
[2024-06-14 16:00:34,919 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places.
[2024-06-14 16:00:34,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 99 transitions, 943 flow
[2024-06-14 16:00:34,919 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:34,919 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:34,919 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:34,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 16:00:34,919 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:34,920 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:34,920 INFO  L85        PathProgramCache]: Analyzing trace with hash -369037474, now seen corresponding path program 2 times
[2024-06-14 16:00:34,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:34,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557157836]
[2024-06-14 16:00:34,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:34,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:34,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:39,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:39,952 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:39,952 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557157836]
[2024-06-14 16:00:39,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557157836] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:39,952 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:39,953 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:39,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53151391]
[2024-06-14 16:00:39,953 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:39,953 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:39,954 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:39,954 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:39,954 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:40,119 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:00:40,119 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 99 transitions, 943 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:40,119 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:40,119 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:00:40,119 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:40,945 INFO  L124   PetriNetUnfolderBase]: 1748/2690 cut-off events.
[2024-06-14 16:00:40,945 INFO  L125   PetriNetUnfolderBase]: For 44086/44088 co-relation queries the response was YES.
[2024-06-14 16:00:40,953 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14551 conditions, 2690 events. 1748/2690 cut-off events. For 44086/44088 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13044 event pairs, 467 based on Foata normal form. 6/2695 useless extension candidates. Maximal degree in co-relation 14501. Up to 2445 conditions per place. 
[2024-06-14 16:00:40,963 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 100 selfloop transitions, 25 changer transitions 0/128 dead transitions.
[2024-06-14 16:00:40,964 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 128 transitions, 1299 flow
[2024-06-14 16:00:40,965 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:00:40,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:00:40,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-14 16:00:40,966 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41785714285714287
[2024-06-14 16:00:40,966 INFO  L175             Difference]: Start difference. First operand has 101 places, 99 transitions, 943 flow. Second operand 7 states and 117 transitions.
[2024-06-14 16:00:40,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 128 transitions, 1299 flow
[2024-06-14 16:00:41,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 128 transitions, 1232 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-14 16:00:41,003 INFO  L231             Difference]: Finished difference. Result has 104 places, 103 transitions, 994 flow
[2024-06-14 16:00:41,003 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=994, PETRI_PLACES=104, PETRI_TRANSITIONS=103}
[2024-06-14 16:00:41,004 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places.
[2024-06-14 16:00:41,004 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 103 transitions, 994 flow
[2024-06-14 16:00:41,004 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:41,004 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:41,004 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:41,004 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 16:00:41,005 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-14 16:00:41,005 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:41,005 INFO  L85        PathProgramCache]: Analyzing trace with hash 2130723488, now seen corresponding path program 3 times
[2024-06-14 16:00:41,005 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:41,005 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889566202]
[2024-06-14 16:00:41,005 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:41,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:41,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:46,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:46,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:46,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889566202]
[2024-06-14 16:00:46,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889566202] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:46,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:46,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:46,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028025707]
[2024-06-14 16:00:46,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:46,551 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:46,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:46,551 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:46,551 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:46,664 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:00:46,665 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 103 transitions, 994 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:46,665 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:46,665 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:00:46,665 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:47,459 INFO  L124   PetriNetUnfolderBase]: 1765/2717 cut-off events.
[2024-06-14 16:00:47,459 INFO  L125   PetriNetUnfolderBase]: For 48545/48547 co-relation queries the response was YES.
[2024-06-14 16:00:47,467 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15026 conditions, 2717 events. 1765/2717 cut-off events. For 48545/48547 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13126 event pairs, 520 based on Foata normal form. 4/2720 useless extension candidates. Maximal degree in co-relation 14974. Up to 2621 conditions per place. 
[2024-06-14 16:00:47,475 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 109 selfloop transitions, 15 changer transitions 0/127 dead transitions.
[2024-06-14 16:00:47,475 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 127 transitions, 1334 flow
[2024-06-14 16:00:47,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:00:47,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:00:47,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions.
[2024-06-14 16:00:47,476 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3964285714285714
[2024-06-14 16:00:47,477 INFO  L175             Difference]: Start difference. First operand has 104 places, 103 transitions, 994 flow. Second operand 7 states and 111 transitions.
[2024-06-14 16:00:47,477 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 127 transitions, 1334 flow
[2024-06-14 16:00:47,514 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 127 transitions, 1268 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-14 16:00:47,515 INFO  L231             Difference]: Finished difference. Result has 107 places, 105 transitions, 1007 flow
[2024-06-14 16:00:47,516 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1007, PETRI_PLACES=107, PETRI_TRANSITIONS=105}
[2024-06-14 16:00:47,516 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places.
[2024-06-14 16:00:47,516 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 1007 flow
[2024-06-14 16:00:47,516 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:47,517 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:47,517 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:47,517 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 16:00:47,517 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:47,517 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:47,517 INFO  L85        PathProgramCache]: Analyzing trace with hash 2122449278, now seen corresponding path program 4 times
[2024-06-14 16:00:47,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:47,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772818063]
[2024-06-14 16:00:47,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:47,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:47,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:53,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:53,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:53,357 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772818063]
[2024-06-14 16:00:53,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772818063] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:53,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:53,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:53,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766185855]
[2024-06-14 16:00:53,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:53,360 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:53,360 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:53,360 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:53,361 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:53,441 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:00:53,442 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 1007 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:53,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:53,442 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:00:53,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:54,377 INFO  L124   PetriNetUnfolderBase]: 1782/2744 cut-off events.
[2024-06-14 16:00:54,377 INFO  L125   PetriNetUnfolderBase]: For 52968/52970 co-relation queries the response was YES.
[2024-06-14 16:00:54,384 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15353 conditions, 2744 events. 1782/2744 cut-off events. For 52968/52970 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13362 event pairs, 471 based on Foata normal form. 4/2747 useless extension candidates. Maximal degree in co-relation 15300. Up to 2407 conditions per place. 
[2024-06-14 16:00:54,392 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 95 selfloop transitions, 38 changer transitions 0/136 dead transitions.
[2024-06-14 16:00:54,392 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 136 transitions, 1515 flow
[2024-06-14 16:00:54,393 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:00:54,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:00:54,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-14 16:00:54,407 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 16:00:54,407 INFO  L175             Difference]: Start difference. First operand has 107 places, 105 transitions, 1007 flow. Second operand 7 states and 120 transitions.
[2024-06-14 16:00:54,407 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 136 transitions, 1515 flow
[2024-06-14 16:00:54,449 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 136 transitions, 1454 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-14 16:00:54,451 INFO  L231             Difference]: Finished difference. Result has 109 places, 109 transitions, 1121 flow
[2024-06-14 16:00:54,451 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1121, PETRI_PLACES=109, PETRI_TRANSITIONS=109}
[2024-06-14 16:00:54,451 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places.
[2024-06-14 16:00:54,451 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 1121 flow
[2024-06-14 16:00:54,452 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:54,452 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:54,452 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:54,452 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 16:00:54,452 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:54,452 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:54,453 INFO  L85        PathProgramCache]: Analyzing trace with hash 2122442768, now seen corresponding path program 5 times
[2024-06-14 16:00:54,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:54,453 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530593132]
[2024-06-14 16:00:54,453 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:54,453 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:54,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:00,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:00,401 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:00,401 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530593132]
[2024-06-14 16:01:00,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530593132] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:00,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:00,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:01:00,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174561037]
[2024-06-14 16:01:00,402 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:00,402 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:01:00,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:00,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:01:00,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:01:00,467 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:01:00,467 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 1121 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:00,467 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:00,468 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:01:00,468 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:01,404 INFO  L124   PetriNetUnfolderBase]: 1774/2732 cut-off events.
[2024-06-14 16:01:01,404 INFO  L125   PetriNetUnfolderBase]: For 56111/56113 co-relation queries the response was YES.
[2024-06-14 16:01:01,412 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15538 conditions, 2732 events. 1774/2732 cut-off events. For 56111/56113 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13256 event pairs, 483 based on Foata normal form. 4/2735 useless extension candidates. Maximal degree in co-relation 15484. Up to 2529 conditions per place. 
[2024-06-14 16:01:01,420 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 102 selfloop transitions, 32 changer transitions 0/137 dead transitions.
[2024-06-14 16:01:01,420 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 137 transitions, 1463 flow
[2024-06-14 16:01:01,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:01:01,421 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:01:01,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-14 16:01:01,422 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4357142857142857
[2024-06-14 16:01:01,422 INFO  L175             Difference]: Start difference. First operand has 109 places, 109 transitions, 1121 flow. Second operand 7 states and 122 transitions.
[2024-06-14 16:01:01,422 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 137 transitions, 1463 flow
[2024-06-14 16:01:01,475 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 137 transitions, 1363 flow, removed 31 selfloop flow, removed 4 redundant places.
[2024-06-14 16:01:01,477 INFO  L231             Difference]: Finished difference. Result has 112 places, 109 transitions, 1095 flow
[2024-06-14 16:01:01,477 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1095, PETRI_PLACES=112, PETRI_TRANSITIONS=109}
[2024-06-14 16:01:01,478 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places.
[2024-06-14 16:01:01,478 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 109 transitions, 1095 flow
[2024-06-14 16:01:01,479 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:01,479 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:01,479 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:01,479 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 16:01:01,480 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:01,480 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:01,480 INFO  L85        PathProgramCache]: Analyzing trace with hash 1454079852, now seen corresponding path program 1 times
[2024-06-14 16:01:01,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:01,480 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035706596]
[2024-06-14 16:01:01,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:01,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:01,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:10,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:10,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:10,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035706596]
[2024-06-14 16:01:10,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035706596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:10,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:10,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:01:10,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477344824]
[2024-06-14 16:01:10,699 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:10,699 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:01:10,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:10,700 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:01:10,700 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:01:10,798 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:01:10,799 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 109 transitions, 1095 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:10,799 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:10,799 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:01:10,799 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:11,830 INFO  L124   PetriNetUnfolderBase]: 1784/2767 cut-off events.
[2024-06-14 16:01:11,831 INFO  L125   PetriNetUnfolderBase]: For 59036/59036 co-relation queries the response was YES.
[2024-06-14 16:01:11,839 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15681 conditions, 2767 events. 1784/2767 cut-off events. For 59036/59036 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13707 event pairs, 924 based on Foata normal form. 2/2768 useless extension candidates. Maximal degree in co-relation 15626. Up to 2694 conditions per place. 
[2024-06-14 16:01:11,848 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 108 selfloop transitions, 20 changer transitions 0/131 dead transitions.
[2024-06-14 16:01:11,849 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 131 transitions, 1514 flow
[2024-06-14 16:01:11,849 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:01:11,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:01:11,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions.
[2024-06-14 16:01:11,850 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37142857142857144
[2024-06-14 16:01:11,850 INFO  L175             Difference]: Start difference. First operand has 112 places, 109 transitions, 1095 flow. Second operand 7 states and 104 transitions.
[2024-06-14 16:01:11,850 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 131 transitions, 1514 flow
[2024-06-14 16:01:11,912 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 131 transitions, 1430 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-14 16:01:11,915 INFO  L231             Difference]: Finished difference. Result has 114 places, 117 transitions, 1144 flow
[2024-06-14 16:01:11,915 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1144, PETRI_PLACES=114, PETRI_TRANSITIONS=117}
[2024-06-14 16:01:11,915 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 73 predicate places.
[2024-06-14 16:01:11,915 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 117 transitions, 1144 flow
[2024-06-14 16:01:11,916 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:11,916 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:11,916 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:11,916 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 16:01:11,916 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:11,917 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:11,917 INFO  L85        PathProgramCache]: Analyzing trace with hash 1957123926, now seen corresponding path program 2 times
[2024-06-14 16:01:11,917 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:11,917 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669456278]
[2024-06-14 16:01:11,917 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:11,917 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:11,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:20,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:20,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:20,833 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669456278]
[2024-06-14 16:01:20,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669456278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:20,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:20,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:01:20,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76074490]
[2024-06-14 16:01:20,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:20,834 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:01:20,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:20,834 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:01:20,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:01:20,929 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:01:20,930 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 117 transitions, 1144 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:20,930 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:20,930 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:01:20,930 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:21,800 INFO  L124   PetriNetUnfolderBase]: 1778/2759 cut-off events.
[2024-06-14 16:01:21,800 INFO  L125   PetriNetUnfolderBase]: For 62367/62367 co-relation queries the response was YES.
[2024-06-14 16:01:21,809 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15846 conditions, 2759 events. 1778/2759 cut-off events. For 62367/62367 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13661 event pairs, 923 based on Foata normal form. 2/2760 useless extension candidates. Maximal degree in co-relation 15789. Up to 2697 conditions per place. 
[2024-06-14 16:01:21,818 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 109 selfloop transitions, 16 changer transitions 0/128 dead transitions.
[2024-06-14 16:01:21,818 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 128 transitions, 1424 flow
[2024-06-14 16:01:21,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 16:01:21,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 16:01:21,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions.
[2024-06-14 16:01:21,820 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.415
[2024-06-14 16:01:21,820 INFO  L175             Difference]: Start difference. First operand has 114 places, 117 transitions, 1144 flow. Second operand 5 states and 83 transitions.
[2024-06-14 16:01:21,820 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 128 transitions, 1424 flow
[2024-06-14 16:01:21,870 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 128 transitions, 1381 flow, removed 17 selfloop flow, removed 2 redundant places.
[2024-06-14 16:01:21,872 INFO  L231             Difference]: Finished difference. Result has 117 places, 117 transitions, 1145 flow
[2024-06-14 16:01:21,872 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1145, PETRI_PLACES=117, PETRI_TRANSITIONS=117}
[2024-06-14 16:01:21,873 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places.
[2024-06-14 16:01:21,873 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 1145 flow
[2024-06-14 16:01:21,873 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:21,873 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:21,873 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:21,874 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 16:01:21,874 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-14 16:01:21,874 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:21,874 INFO  L85        PathProgramCache]: Analyzing trace with hash 936730022, now seen corresponding path program 1 times
[2024-06-14 16:01:21,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:21,874 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010634945]
[2024-06-14 16:01:21,874 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:21,875 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:21,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:30,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-14 16:01:30,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:30,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010634945]
[2024-06-14 16:01:30,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010634945] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:30,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:30,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:01:30,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259119213]
[2024-06-14 16:01:30,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:30,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:01:30,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:30,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:01:30,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:01:30,351 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:01:30,352 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 1145 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:30,352 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:30,352 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:01:30,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:31,465 INFO  L124   PetriNetUnfolderBase]: 1827/2815 cut-off events.
[2024-06-14 16:01:31,466 INFO  L125   PetriNetUnfolderBase]: For 66886/66894 co-relation queries the response was YES.
[2024-06-14 16:01:31,474 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16420 conditions, 2815 events. 1827/2815 cut-off events. For 66886/66894 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13827 event pairs, 502 based on Foata normal form. 11/2825 useless extension candidates. Maximal degree in co-relation 16361. Up to 2638 conditions per place. 
[2024-06-14 16:01:31,483 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 133 selfloop transitions, 39 changer transitions 0/175 dead transitions.
[2024-06-14 16:01:31,483 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 175 transitions, 1994 flow
[2024-06-14 16:01:31,484 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:01:31,484 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:01:31,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-14 16:01:31,485 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.434375
[2024-06-14 16:01:31,485 INFO  L175             Difference]: Start difference. First operand has 117 places, 117 transitions, 1145 flow. Second operand 8 states and 139 transitions.
[2024-06-14 16:01:31,485 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 175 transitions, 1994 flow
[2024-06-14 16:01:31,539 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 175 transitions, 1958 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-14 16:01:31,542 INFO  L231             Difference]: Finished difference. Result has 125 places, 144 transitions, 1563 flow
[2024-06-14 16:01:31,542 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1563, PETRI_PLACES=125, PETRI_TRANSITIONS=144}
[2024-06-14 16:01:31,543 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 84 predicate places.
[2024-06-14 16:01:31,543 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 144 transitions, 1563 flow
[2024-06-14 16:01:31,543 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:31,543 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:31,543 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:31,543 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 16:01:31,543 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:31,544 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:31,544 INFO  L85        PathProgramCache]: Analyzing trace with hash 301568966, now seen corresponding path program 2 times
[2024-06-14 16:01:31,544 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:31,544 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521430943]
[2024-06-14 16:01:31,544 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:31,545 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:31,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:41,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:41,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:41,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521430943]
[2024-06-14 16:01:41,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521430943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:41,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:41,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:01:41,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275284834]
[2024-06-14 16:01:41,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:41,184 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:01:41,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:41,185 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:01:41,185 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:01:41,291 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:01:41,291 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 144 transitions, 1563 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:41,292 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:41,292 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:01:41,292 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:42,425 INFO  L124   PetriNetUnfolderBase]: 2043/3138 cut-off events.
[2024-06-14 16:01:42,426 INFO  L125   PetriNetUnfolderBase]: For 80221/80225 co-relation queries the response was YES.
[2024-06-14 16:01:42,438 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20340 conditions, 3138 events. 2043/3138 cut-off events. For 80221/80225 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15657 event pairs, 695 based on Foata normal form. 7/3144 useless extension candidates. Maximal degree in co-relation 20276. Up to 2769 conditions per place. 
[2024-06-14 16:01:42,449 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 152 selfloop transitions, 74 changer transitions 0/229 dead transitions.
[2024-06-14 16:01:42,449 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 229 transitions, 3074 flow
[2024-06-14 16:01:42,450 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:01:42,450 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:01:42,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-14 16:01:42,451 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.440625
[2024-06-14 16:01:42,451 INFO  L175             Difference]: Start difference. First operand has 125 places, 144 transitions, 1563 flow. Second operand 8 states and 141 transitions.
[2024-06-14 16:01:42,451 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 229 transitions, 3074 flow
[2024-06-14 16:01:42,541 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 229 transitions, 2970 flow, removed 51 selfloop flow, removed 1 redundant places.
[2024-06-14 16:01:42,544 INFO  L231             Difference]: Finished difference. Result has 135 places, 192 transitions, 2434 flow
[2024-06-14 16:01:42,544 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2434, PETRI_PLACES=135, PETRI_TRANSITIONS=192}
[2024-06-14 16:01:42,545 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 94 predicate places.
[2024-06-14 16:01:42,545 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 192 transitions, 2434 flow
[2024-06-14 16:01:42,545 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:42,545 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:42,545 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:42,546 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 16:01:42,546 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:42,546 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:42,546 INFO  L85        PathProgramCache]: Analyzing trace with hash 450142255, now seen corresponding path program 1 times
[2024-06-14 16:01:42,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:42,546 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106331366]
[2024-06-14 16:01:42,546 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:42,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:42,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:50,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:50,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:50,777 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106331366]
[2024-06-14 16:01:50,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106331366] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:50,777 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:50,777 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:01:50,777 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129045937]
[2024-06-14 16:01:50,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:50,778 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:01:50,778 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:50,779 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:01:50,779 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:01:51,002 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:01:51,003 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 192 transitions, 2434 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:51,003 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:51,003 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:01:51,003 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:52,244 INFO  L124   PetriNetUnfolderBase]: 2101/3236 cut-off events.
[2024-06-14 16:01:52,244 INFO  L125   PetriNetUnfolderBase]: For 92031/92037 co-relation queries the response was YES.
[2024-06-14 16:01:52,257 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21905 conditions, 3236 events. 2101/3236 cut-off events. For 92031/92037 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16355 event pairs, 683 based on Foata normal form. 18/3253 useless extension candidates. Maximal degree in co-relation 21835. Up to 2913 conditions per place. 
[2024-06-14 16:01:52,269 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 191 selfloop transitions, 47 changer transitions 0/241 dead transitions.
[2024-06-14 16:01:52,269 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 241 transitions, 3215 flow
[2024-06-14 16:01:52,271 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:01:52,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:01:52,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-14 16:01:52,272 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41944444444444445
[2024-06-14 16:01:52,272 INFO  L175             Difference]: Start difference. First operand has 135 places, 192 transitions, 2434 flow. Second operand 9 states and 151 transitions.
[2024-06-14 16:01:52,272 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 241 transitions, 3215 flow
[2024-06-14 16:01:52,376 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 241 transitions, 3135 flow, removed 33 selfloop flow, removed 2 redundant places.
[2024-06-14 16:01:52,379 INFO  L231             Difference]: Finished difference. Result has 144 places, 203 transitions, 2640 flow
[2024-06-14 16:01:52,379 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2354, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2640, PETRI_PLACES=144, PETRI_TRANSITIONS=203}
[2024-06-14 16:01:52,380 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 103 predicate places.
[2024-06-14 16:01:52,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 203 transitions, 2640 flow
[2024-06-14 16:01:52,380 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:52,381 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:52,381 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:52,381 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 16:01:52,381 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:52,381 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:52,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 455706445, now seen corresponding path program 2 times
[2024-06-14 16:01:52,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:52,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726992057]
[2024-06-14 16:01:52,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:52,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:52,416 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:00,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:00,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:00,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726992057]
[2024-06-14 16:02:00,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726992057] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:00,429 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:00,429 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:02:00,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110365413]
[2024-06-14 16:02:00,429 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:00,429 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:02:00,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:00,430 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:02:00,430 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:02:00,539 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:02:00,539 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 203 transitions, 2640 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:00,539 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:00,540 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:02:00,540 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:01,681 INFO  L124   PetriNetUnfolderBase]: 2243/3469 cut-off events.
[2024-06-14 16:02:01,682 INFO  L125   PetriNetUnfolderBase]: For 101323/101333 co-relation queries the response was YES.
[2024-06-14 16:02:01,695 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23647 conditions, 3469 events. 2243/3469 cut-off events. For 101323/101333 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17934 event pairs, 694 based on Foata normal form. 22/3490 useless extension candidates. Maximal degree in co-relation 23573. Up to 2982 conditions per place. 
[2024-06-14 16:02:01,708 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 194 selfloop transitions, 64 changer transitions 0/261 dead transitions.
[2024-06-14 16:02:01,708 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 261 transitions, 3598 flow
[2024-06-14 16:02:01,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:02:01,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:02:01,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-14 16:02:01,710 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-14 16:02:01,711 INFO  L175             Difference]: Start difference. First operand has 144 places, 203 transitions, 2640 flow. Second operand 9 states and 150 transitions.
[2024-06-14 16:02:01,711 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 261 transitions, 3598 flow
[2024-06-14 16:02:01,836 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 261 transitions, 3563 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-06-14 16:02:01,840 INFO  L231             Difference]: Finished difference. Result has 154 places, 222 transitions, 3070 flow
[2024-06-14 16:02:01,840 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2605, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3070, PETRI_PLACES=154, PETRI_TRANSITIONS=222}
[2024-06-14 16:02:01,841 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 113 predicate places.
[2024-06-14 16:02:01,841 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 222 transitions, 3070 flow
[2024-06-14 16:02:01,841 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:01,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:01,841 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:01,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 16:02:01,842 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-14 16:02:01,842 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:01,842 INFO  L85        PathProgramCache]: Analyzing trace with hash 339374396, now seen corresponding path program 3 times
[2024-06-14 16:02:01,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:01,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716128643]
[2024-06-14 16:02:01,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:01,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:01,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:11,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:11,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:11,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716128643]
[2024-06-14 16:02:11,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716128643] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:11,367 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:11,367 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:02:11,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756497443]
[2024-06-14 16:02:11,367 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:11,367 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:02:11,367 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:11,368 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:02:11,368 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:02:11,518 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:02:11,518 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 222 transitions, 3070 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:11,518 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:11,518 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:02:11,518 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:12,605 INFO  L124   PetriNetUnfolderBase]: 2286/3522 cut-off events.
[2024-06-14 16:02:12,606 INFO  L125   PetriNetUnfolderBase]: For 105404/105408 co-relation queries the response was YES.
[2024-06-14 16:02:12,625 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24895 conditions, 3522 events. 2286/3522 cut-off events. For 105404/105408 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18210 event pairs, 796 based on Foata normal form. 7/3528 useless extension candidates. Maximal degree in co-relation 24816. Up to 3423 conditions per place. 
[2024-06-14 16:02:12,644 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 222 selfloop transitions, 34 changer transitions 0/259 dead transitions.
[2024-06-14 16:02:12,645 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 259 transitions, 3946 flow
[2024-06-14 16:02:12,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:02:12,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:02:12,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions.
[2024-06-14 16:02:12,646 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38333333333333336
[2024-06-14 16:02:12,646 INFO  L175             Difference]: Start difference. First operand has 154 places, 222 transitions, 3070 flow. Second operand 9 states and 138 transitions.
[2024-06-14 16:02:12,646 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 259 transitions, 3946 flow
[2024-06-14 16:02:12,839 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 259 transitions, 3857 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-06-14 16:02:12,843 INFO  L231             Difference]: Finished difference. Result has 162 places, 237 transitions, 3329 flow
[2024-06-14 16:02:12,843 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2981, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3329, PETRI_PLACES=162, PETRI_TRANSITIONS=237}
[2024-06-14 16:02:12,843 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 121 predicate places.
[2024-06-14 16:02:12,844 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 237 transitions, 3329 flow
[2024-06-14 16:02:12,844 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:12,844 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:12,844 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:12,844 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 16:02:12,844 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-14 16:02:12,844 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:12,845 INFO  L85        PathProgramCache]: Analyzing trace with hash 339374737, now seen corresponding path program 1 times
[2024-06-14 16:02:12,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:12,845 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789676418]
[2024-06-14 16:02:12,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:12,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:12,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:21,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:21,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:21,942 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789676418]
[2024-06-14 16:02:21,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789676418] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:21,942 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:21,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:02:21,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800767541]
[2024-06-14 16:02:21,943 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:21,943 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:02:21,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:21,943 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:02:21,944 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:02:22,094 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:02:22,094 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 237 transitions, 3329 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:22,094 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:22,094 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:02:22,094 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:23,332 INFO  L124   PetriNetUnfolderBase]: 2296/3536 cut-off events.
[2024-06-14 16:02:23,332 INFO  L125   PetriNetUnfolderBase]: For 109497/109501 co-relation queries the response was YES.
[2024-06-14 16:02:23,355 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24968 conditions, 3536 events. 2296/3536 cut-off events. For 109497/109501 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 18240 event pairs, 797 based on Foata normal form. 6/3541 useless extension candidates. Maximal degree in co-relation 24886. Up to 3444 conditions per place. 
[2024-06-14 16:02:23,374 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 234 selfloop transitions, 28 changer transitions 0/265 dead transitions.
[2024-06-14 16:02:23,374 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 265 transitions, 4061 flow
[2024-06-14 16:02:23,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:02:23,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:02:23,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-14 16:02:23,376 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-14 16:02:23,376 INFO  L175             Difference]: Start difference. First operand has 162 places, 237 transitions, 3329 flow. Second operand 8 states and 128 transitions.
[2024-06-14 16:02:23,376 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 265 transitions, 4061 flow
[2024-06-14 16:02:23,585 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 265 transitions, 3927 flow, removed 45 selfloop flow, removed 4 redundant places.
[2024-06-14 16:02:23,588 INFO  L231             Difference]: Finished difference. Result has 166 places, 243 transitions, 3339 flow
[2024-06-14 16:02:23,588 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3195, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3339, PETRI_PLACES=166, PETRI_TRANSITIONS=243}
[2024-06-14 16:02:23,589 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 125 predicate places.
[2024-06-14 16:02:23,589 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 243 transitions, 3339 flow
[2024-06-14 16:02:23,589 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:23,589 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:23,589 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:23,589 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 16:02:23,590 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-14 16:02:23,591 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:23,591 INFO  L85        PathProgramCache]: Analyzing trace with hash 395118670, now seen corresponding path program 4 times
[2024-06-14 16:02:23,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:23,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356004820]
[2024-06-14 16:02:23,591 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:23,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:23,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:30,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:30,392 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:30,392 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356004820]
[2024-06-14 16:02:30,392 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356004820] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:30,392 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:30,392 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:02:30,392 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596883113]
[2024-06-14 16:02:30,392 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:30,393 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:02:30,393 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:30,393 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:02:30,393 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:02:30,507 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:02:30,507 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 243 transitions, 3339 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:30,507 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:30,508 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:02:30,508 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:31,508 INFO  L124   PetriNetUnfolderBase]: 2335/3593 cut-off events.
[2024-06-14 16:02:31,508 INFO  L125   PetriNetUnfolderBase]: For 117737/117743 co-relation queries the response was YES.
[2024-06-14 16:02:31,526 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25726 conditions, 3593 events. 2335/3593 cut-off events. For 117737/117743 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18610 event pairs, 726 based on Foata normal form. 9/3601 useless extension candidates. Maximal degree in co-relation 25643. Up to 3097 conditions per place. 
[2024-06-14 16:02:31,540 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 161 selfloop transitions, 118 changer transitions 0/282 dead transitions.
[2024-06-14 16:02:31,541 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 282 transitions, 4357 flow
[2024-06-14 16:02:31,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:02:31,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:02:31,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-14 16:02:31,542 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44285714285714284
[2024-06-14 16:02:31,542 INFO  L175             Difference]: Start difference. First operand has 166 places, 243 transitions, 3339 flow. Second operand 7 states and 124 transitions.
[2024-06-14 16:02:31,542 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 282 transitions, 4357 flow
[2024-06-14 16:02:31,728 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 282 transitions, 4303 flow, removed 17 selfloop flow, removed 4 redundant places.
[2024-06-14 16:02:31,732 INFO  L231             Difference]: Finished difference. Result has 170 places, 256 transitions, 3829 flow
[2024-06-14 16:02:31,732 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3285, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3829, PETRI_PLACES=170, PETRI_TRANSITIONS=256}
[2024-06-14 16:02:31,732 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 129 predicate places.
[2024-06-14 16:02:31,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 256 transitions, 3829 flow
[2024-06-14 16:02:31,733 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:31,733 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:31,733 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:31,733 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 16:02:31,733 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:31,734 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:31,734 INFO  L85        PathProgramCache]: Analyzing trace with hash 537060063, now seen corresponding path program 3 times
[2024-06-14 16:02:31,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:31,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704170405]
[2024-06-14 16:02:31,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:31,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:31,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:38,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:38,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:38,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704170405]
[2024-06-14 16:02:38,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704170405] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:38,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:38,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:02:38,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829939466]
[2024-06-14 16:02:38,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:38,283 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:02:38,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:38,283 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:02:38,283 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:02:38,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:02:38,404 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 256 transitions, 3829 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:38,404 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:38,404 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:02:38,404 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:39,586 INFO  L124   PetriNetUnfolderBase]: 2352/3627 cut-off events.
[2024-06-14 16:02:39,586 INFO  L125   PetriNetUnfolderBase]: For 128341/128347 co-relation queries the response was YES.
[2024-06-14 16:02:39,603 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27065 conditions, 3627 events. 2352/3627 cut-off events. For 128341/128347 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18910 event pairs, 707 based on Foata normal form. 8/3634 useless extension candidates. Maximal degree in co-relation 26979. Up to 3165 conditions per place. 
[2024-06-14 16:02:39,617 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 208 selfloop transitions, 80 changer transitions 0/291 dead transitions.
[2024-06-14 16:02:39,617 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 291 transitions, 4591 flow
[2024-06-14 16:02:39,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:02:39,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:02:39,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-14 16:02:39,619 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-14 16:02:39,619 INFO  L175             Difference]: Start difference. First operand has 170 places, 256 transitions, 3829 flow. Second operand 8 states and 136 transitions.
[2024-06-14 16:02:39,619 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 291 transitions, 4591 flow
[2024-06-14 16:02:39,812 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 291 transitions, 4505 flow, removed 36 selfloop flow, removed 2 redundant places.
[2024-06-14 16:02:39,816 INFO  L231             Difference]: Finished difference. Result has 176 places, 259 transitions, 3971 flow
[2024-06-14 16:02:39,816 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3743, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3971, PETRI_PLACES=176, PETRI_TRANSITIONS=259}
[2024-06-14 16:02:39,817 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 135 predicate places.
[2024-06-14 16:02:39,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 259 transitions, 3971 flow
[2024-06-14 16:02:39,817 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:39,817 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:39,817 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:39,817 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 16:02:39,818 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:39,818 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:39,818 INFO  L85        PathProgramCache]: Analyzing trace with hash 542624253, now seen corresponding path program 4 times
[2024-06-14 16:02:39,818 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:39,818 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316804434]
[2024-06-14 16:02:39,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:39,818 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:39,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:47,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-14 16:02:47,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:47,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316804434]
[2024-06-14 16:02:47,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316804434] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:47,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:47,052 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:02:47,053 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817003328]
[2024-06-14 16:02:47,053 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:47,053 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:02:47,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:47,053 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:02:47,054 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:02:47,197 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:02:47,197 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 259 transitions, 3971 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:47,197 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:47,198 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:02:47,198 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:48,465 INFO  L124   PetriNetUnfolderBase]: 2393/3695 cut-off events.
[2024-06-14 16:02:48,465 INFO  L125   PetriNetUnfolderBase]: For 136555/136565 co-relation queries the response was YES.
[2024-06-14 16:02:48,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27748 conditions, 3695 events. 2393/3695 cut-off events. For 136555/136565 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19358 event pairs, 688 based on Foata normal form. 22/3716 useless extension candidates. Maximal degree in co-relation 27660. Up to 3034 conditions per place. 
[2024-06-14 16:02:48,497 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 220 selfloop transitions, 69 changer transitions 0/292 dead transitions.
[2024-06-14 16:02:48,497 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 292 transitions, 4719 flow
[2024-06-14 16:02:48,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:02:48,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:02:48,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-14 16:02:48,500 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4125
[2024-06-14 16:02:48,500 INFO  L175             Difference]: Start difference. First operand has 176 places, 259 transitions, 3971 flow. Second operand 8 states and 132 transitions.
[2024-06-14 16:02:48,500 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 292 transitions, 4719 flow
[2024-06-14 16:02:48,679 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 292 transitions, 4526 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-14 16:02:48,683 INFO  L231             Difference]: Finished difference. Result has 178 places, 260 transitions, 3962 flow
[2024-06-14 16:02:48,684 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3778, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3962, PETRI_PLACES=178, PETRI_TRANSITIONS=260}
[2024-06-14 16:02:48,684 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 137 predicate places.
[2024-06-14 16:02:48,684 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 260 transitions, 3962 flow
[2024-06-14 16:02:48,684 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:48,684 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:48,684 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:48,685 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 16:02:48,685 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-14 16:02:48,685 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:48,685 INFO  L85        PathProgramCache]: Analyzing trace with hash -533914788, now seen corresponding path program 5 times
[2024-06-14 16:02:48,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:48,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693063898]
[2024-06-14 16:02:48,685 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:48,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:48,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:56,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:56,015 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:56,015 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693063898]
[2024-06-14 16:02:56,015 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693063898] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:56,015 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:56,015 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:02:56,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904916438]
[2024-06-14 16:02:56,015 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:56,015 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:02:56,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:56,016 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:02:56,016 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:02:56,123 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:02:56,123 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 260 transitions, 3962 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:56,123 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:56,124 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:02:56,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:57,360 INFO  L124   PetriNetUnfolderBase]: 2449/3766 cut-off events.
[2024-06-14 16:02:57,360 INFO  L125   PetriNetUnfolderBase]: For 139722/139726 co-relation queries the response was YES.
[2024-06-14 16:02:57,379 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28665 conditions, 3766 events. 2449/3766 cut-off events. For 139722/139726 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19718 event pairs, 815 based on Foata normal form. 7/3772 useless extension candidates. Maximal degree in co-relation 28576. Up to 3634 conditions per place. 
[2024-06-14 16:02:57,395 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 244 selfloop transitions, 49 changer transitions 0/296 dead transitions.
[2024-06-14 16:02:57,395 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 296 transitions, 4985 flow
[2024-06-14 16:02:57,396 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:02:57,396 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:02:57,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions.
[2024-06-14 16:02:57,396 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.384375
[2024-06-14 16:02:57,397 INFO  L175             Difference]: Start difference. First operand has 178 places, 260 transitions, 3962 flow. Second operand 8 states and 123 transitions.
[2024-06-14 16:02:57,397 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 296 transitions, 4985 flow
[2024-06-14 16:02:57,636 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 296 transitions, 4813 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-14 16:02:57,641 INFO  L231             Difference]: Finished difference. Result has 181 places, 276 transitions, 4235 flow
[2024-06-14 16:02:57,641 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3792, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4235, PETRI_PLACES=181, PETRI_TRANSITIONS=276}
[2024-06-14 16:02:57,641 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 140 predicate places.
[2024-06-14 16:02:57,641 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 276 transitions, 4235 flow
[2024-06-14 16:02:57,642 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:57,642 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:57,642 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:57,642 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 16:02:57,642 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-14 16:02:57,642 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:57,642 INFO  L85        PathProgramCache]: Analyzing trace with hash -533914447, now seen corresponding path program 2 times
[2024-06-14 16:02:57,643 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:57,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158962910]
[2024-06-14 16:02:57,643 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:57,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:57,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:04,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:04,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:04,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158962910]
[2024-06-14 16:03:04,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158962910] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:04,983 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:04,983 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:03:04,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836576913]
[2024-06-14 16:03:04,983 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:04,984 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:03:04,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:04,984 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:03:04,984 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:03:05,112 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:03:05,113 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 276 transitions, 4235 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:05,113 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:05,113 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:03:05,113 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:06,364 INFO  L124   PetriNetUnfolderBase]: 2459/3780 cut-off events.
[2024-06-14 16:03:06,364 INFO  L125   PetriNetUnfolderBase]: For 136230/136234 co-relation queries the response was YES.
[2024-06-14 16:03:06,383 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28521 conditions, 3780 events. 2459/3780 cut-off events. For 136230/136234 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19767 event pairs, 816 based on Foata normal form. 6/3785 useless extension candidates. Maximal degree in co-relation 28430. Up to 3681 conditions per place. 
[2024-06-14 16:03:06,397 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 261 selfloop transitions, 33 changer transitions 0/297 dead transitions.
[2024-06-14 16:03:06,398 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 297 transitions, 4991 flow
[2024-06-14 16:03:06,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:03:06,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:03:06,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-14 16:03:06,399 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-14 16:03:06,399 INFO  L175             Difference]: Start difference. First operand has 181 places, 276 transitions, 4235 flow. Second operand 7 states and 113 transitions.
[2024-06-14 16:03:06,399 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 297 transitions, 4991 flow
[2024-06-14 16:03:06,622 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 297 transitions, 4865 flow, removed 42 selfloop flow, removed 3 redundant places.
[2024-06-14 16:03:06,626 INFO  L231             Difference]: Finished difference. Result has 185 places, 279 transitions, 4227 flow
[2024-06-14 16:03:06,627 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4109, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4227, PETRI_PLACES=185, PETRI_TRANSITIONS=279}
[2024-06-14 16:03:06,627 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places.
[2024-06-14 16:03:06,627 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 279 transitions, 4227 flow
[2024-06-14 16:03:06,627 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:06,627 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:06,627 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:06,628 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 16:03:06,628 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:06,628 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:06,628 INFO  L85        PathProgramCache]: Analyzing trace with hash 1722898143, now seen corresponding path program 5 times
[2024-06-14 16:03:06,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:06,628 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274725944]
[2024-06-14 16:03:06,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:06,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:06,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:12,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:12,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:12,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274725944]
[2024-06-14 16:03:12,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274725944] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:12,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:12,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:03:12,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13741605]
[2024-06-14 16:03:12,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:12,965 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:03:12,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:12,965 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:03:12,965 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:03:13,097 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:03:13,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 279 transitions, 4227 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:13,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:13,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:03:13,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:14,492 INFO  L124   PetriNetUnfolderBase]: 2500/3864 cut-off events.
[2024-06-14 16:03:14,492 INFO  L125   PetriNetUnfolderBase]: For 149438/149448 co-relation queries the response was YES.
[2024-06-14 16:03:14,511 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28974 conditions, 3864 events. 2500/3864 cut-off events. For 149438/149448 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20497 event pairs, 691 based on Foata normal form. 20/3883 useless extension candidates. Maximal degree in co-relation 28882. Up to 3042 conditions per place. 
[2024-06-14 16:03:14,526 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 226 selfloop transitions, 83 changer transitions 0/312 dead transitions.
[2024-06-14 16:03:14,527 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 312 transitions, 5015 flow
[2024-06-14 16:03:14,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:03:14,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:03:14,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-14 16:03:14,531 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.415625
[2024-06-14 16:03:14,531 INFO  L175             Difference]: Start difference. First operand has 185 places, 279 transitions, 4227 flow. Second operand 8 states and 133 transitions.
[2024-06-14 16:03:14,531 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 312 transitions, 5015 flow
[2024-06-14 16:03:14,750 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 312 transitions, 4920 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-14 16:03:14,754 INFO  L231             Difference]: Finished difference. Result has 187 places, 280 transitions, 4346 flow
[2024-06-14 16:03:14,755 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4132, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4346, PETRI_PLACES=187, PETRI_TRANSITIONS=280}
[2024-06-14 16:03:14,755 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 146 predicate places.
[2024-06-14 16:03:14,755 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 280 transitions, 4346 flow
[2024-06-14 16:03:14,755 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:14,755 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:14,756 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:14,756 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 16:03:14,756 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:14,756 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:14,756 INFO  L85        PathProgramCache]: Analyzing trace with hash 1627919647, now seen corresponding path program 6 times
[2024-06-14 16:03:14,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:14,756 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426242649]
[2024-06-14 16:03:14,757 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:14,757 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:14,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:20,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:20,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:20,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426242649]
[2024-06-14 16:03:20,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426242649] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:20,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:20,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:03:20,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050180187]
[2024-06-14 16:03:20,718 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:20,718 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:03:20,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:20,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:03:20,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:03:20,892 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:03:20,892 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 280 transitions, 4346 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:20,892 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:20,892 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:03:20,892 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:22,086 INFO  L124   PetriNetUnfolderBase]: 2516/3891 cut-off events.
[2024-06-14 16:03:22,087 INFO  L125   PetriNetUnfolderBase]: For 145149/145151 co-relation queries the response was YES.
[2024-06-14 16:03:22,108 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29179 conditions, 3891 events. 2516/3891 cut-off events. For 145149/145151 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 20652 event pairs, 983 based on Foata normal form. 12/3902 useless extension candidates. Maximal degree in co-relation 29088. Up to 3696 conditions per place. 
[2024-06-14 16:03:22,124 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 289 selfloop transitions, 17 changer transitions 0/309 dead transitions.
[2024-06-14 16:03:22,125 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 309 transitions, 5102 flow
[2024-06-14 16:03:22,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:03:22,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:03:22,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions.
[2024-06-14 16:03:22,127 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39375
[2024-06-14 16:03:22,127 INFO  L175             Difference]: Start difference. First operand has 187 places, 280 transitions, 4346 flow. Second operand 8 states and 126 transitions.
[2024-06-14 16:03:22,127 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 309 transitions, 5102 flow
[2024-06-14 16:03:22,365 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 309 transitions, 4908 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-14 16:03:22,369 INFO  L231             Difference]: Finished difference. Result has 189 places, 281 transitions, 4232 flow
[2024-06-14 16:03:22,369 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4154, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4232, PETRI_PLACES=189, PETRI_TRANSITIONS=281}
[2024-06-14 16:03:22,371 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 148 predicate places.
[2024-06-14 16:03:22,371 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 281 transitions, 4232 flow
[2024-06-14 16:03:22,371 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:22,371 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:22,371 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:22,371 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 16:03:22,372 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-14 16:03:22,372 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:22,372 INFO  L85        PathProgramCache]: Analyzing trace with hash 1504204515, now seen corresponding path program 3 times
[2024-06-14 16:03:22,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:22,372 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903238953]
[2024-06-14 16:03:22,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:22,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:22,404 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:29,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:29,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:29,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903238953]
[2024-06-14 16:03:29,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903238953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:29,380 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:29,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:03:29,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222420155]
[2024-06-14 16:03:29,380 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:29,380 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:03:29,380 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:29,381 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:03:29,381 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:03:29,494 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:03:29,494 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 281 transitions, 4232 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:29,494 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:29,494 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:03:29,494 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:30,578 INFO  L124   PetriNetUnfolderBase]: 2526/3904 cut-off events.
[2024-06-14 16:03:30,578 INFO  L125   PetriNetUnfolderBase]: For 137183/137183 co-relation queries the response was YES.
[2024-06-14 16:03:30,602 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28763 conditions, 3904 events. 2526/3904 cut-off events. For 137183/137183 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 20715 event pairs, 1014 based on Foata normal form. 2/3905 useless extension candidates. Maximal degree in co-relation 28671. Up to 3846 conditions per place. 
[2024-06-14 16:03:30,619 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 276 selfloop transitions, 17 changer transitions 0/296 dead transitions.
[2024-06-14 16:03:30,620 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 296 transitions, 4904 flow
[2024-06-14 16:03:30,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:03:30,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:03:30,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions.
[2024-06-14 16:03:30,623 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37916666666666665
[2024-06-14 16:03:30,624 INFO  L175             Difference]: Start difference. First operand has 189 places, 281 transitions, 4232 flow. Second operand 6 states and 91 transitions.
[2024-06-14 16:03:30,624 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 296 transitions, 4904 flow
[2024-06-14 16:03:30,878 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 296 transitions, 4844 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-14 16:03:30,882 INFO  L231             Difference]: Finished difference. Result has 190 places, 287 transitions, 4282 flow
[2024-06-14 16:03:30,883 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4172, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4282, PETRI_PLACES=190, PETRI_TRANSITIONS=287}
[2024-06-14 16:03:30,892 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 149 predicate places.
[2024-06-14 16:03:30,893 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 287 transitions, 4282 flow
[2024-06-14 16:03:30,893 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:30,893 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:30,893 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:30,893 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 16:03:30,893 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-14 16:03:30,893 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:30,894 INFO  L85        PathProgramCache]: Analyzing trace with hash -1599806982, now seen corresponding path program 6 times
[2024-06-14 16:03:30,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:30,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550950126]
[2024-06-14 16:03:30,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:30,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:30,923 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:37,308 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:37,308 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:37,308 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550950126]
[2024-06-14 16:03:37,308 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550950126] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:37,309 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:37,309 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:03:37,309 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740366486]
[2024-06-14 16:03:37,309 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:37,309 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:03:37,309 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:37,310 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:03:37,310 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:03:37,438 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:03:37,439 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 287 transitions, 4282 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:37,439 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:37,439 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:03:37,439 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:38,557 INFO  L124   PetriNetUnfolderBase]: 2569/3959 cut-off events.
[2024-06-14 16:03:38,558 INFO  L125   PetriNetUnfolderBase]: For 143417/143421 co-relation queries the response was YES.
[2024-06-14 16:03:38,579 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29518 conditions, 3959 events. 2569/3959 cut-off events. For 143417/143421 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 20982 event pairs, 756 based on Foata normal form. 7/3965 useless extension candidates. Maximal degree in co-relation 29424. Up to 3621 conditions per place. 
[2024-06-14 16:03:38,597 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 244 selfloop transitions, 82 changer transitions 0/329 dead transitions.
[2024-06-14 16:03:38,597 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 329 transitions, 5395 flow
[2024-06-14 16:03:38,598 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:03:38,598 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:03:38,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-14 16:03:38,598 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44285714285714284
[2024-06-14 16:03:38,598 INFO  L175             Difference]: Start difference. First operand has 190 places, 287 transitions, 4282 flow. Second operand 7 states and 124 transitions.
[2024-06-14 16:03:38,598 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 329 transitions, 5395 flow
[2024-06-14 16:03:38,823 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 329 transitions, 5350 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-14 16:03:38,827 INFO  L231             Difference]: Finished difference. Result has 197 places, 300 transitions, 4780 flow
[2024-06-14 16:03:38,828 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4237, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4780, PETRI_PLACES=197, PETRI_TRANSITIONS=300}
[2024-06-14 16:03:38,828 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 156 predicate places.
[2024-06-14 16:03:38,828 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 300 transitions, 4780 flow
[2024-06-14 16:03:38,829 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:38,829 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:38,829 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:38,829 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 16:03:38,829 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-14 16:03:38,829 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:38,829 INFO  L85        PathProgramCache]: Analyzing trace with hash -1599806641, now seen corresponding path program 4 times
[2024-06-14 16:03:38,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:38,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474041806]
[2024-06-14 16:03:38,830 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:38,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:38,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:45,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:45,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:45,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474041806]
[2024-06-14 16:03:45,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474041806] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:45,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:45,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:03:45,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798587830]
[2024-06-14 16:03:45,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:45,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:03:45,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:45,260 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:03:45,260 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:03:45,373 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:03:45,373 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 300 transitions, 4780 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:45,373 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:45,373 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:03:45,373 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:46,496 INFO  L124   PetriNetUnfolderBase]: 2571/3960 cut-off events.
[2024-06-14 16:03:46,496 INFO  L125   PetriNetUnfolderBase]: For 152414/152418 co-relation queries the response was YES.
[2024-06-14 16:03:46,517 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30342 conditions, 3960 events. 2571/3960 cut-off events. For 152414/152418 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 20981 event pairs, 844 based on Foata normal form. 6/3965 useless extension candidates. Maximal degree in co-relation 30244. Up to 3858 conditions per place. 
[2024-06-14 16:03:46,533 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 276 selfloop transitions, 40 changer transitions 0/319 dead transitions.
[2024-06-14 16:03:46,533 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 319 transitions, 5593 flow
[2024-06-14 16:03:46,533 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:03:46,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:03:46,534 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-14 16:03:46,534 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-14 16:03:46,534 INFO  L175             Difference]: Start difference. First operand has 197 places, 300 transitions, 4780 flow. Second operand 6 states and 102 transitions.
[2024-06-14 16:03:46,534 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 319 transitions, 5593 flow
[2024-06-14 16:03:46,787 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 319 transitions, 5464 flow, removed 32 selfloop flow, removed 3 redundant places.
[2024-06-14 16:03:46,791 INFO  L231             Difference]: Finished difference. Result has 200 places, 303 transitions, 4796 flow
[2024-06-14 16:03:46,791 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4651, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4796, PETRI_PLACES=200, PETRI_TRANSITIONS=303}
[2024-06-14 16:03:46,792 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 159 predicate places.
[2024-06-14 16:03:46,792 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 303 transitions, 4796 flow
[2024-06-14 16:03:46,792 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:46,792 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:46,792 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:46,792 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 16:03:46,793 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:46,793 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:46,793 INFO  L85        PathProgramCache]: Analyzing trace with hash -356598415, now seen corresponding path program 1 times
[2024-06-14 16:03:46,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:46,793 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232839242]
[2024-06-14 16:03:46,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:46,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:46,816 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:56,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:56,139 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:56,139 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232839242]
[2024-06-14 16:03:56,139 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232839242] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:56,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:56,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:03:56,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619762084]
[2024-06-14 16:03:56,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:56,140 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:03:56,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:56,140 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:03:56,140 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:03:56,219 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:03:56,219 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 303 transitions, 4796 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:56,219 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:56,219 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:03:56,219 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:57,593 INFO  L124   PetriNetUnfolderBase]: 2591/3995 cut-off events.
[2024-06-14 16:03:57,593 INFO  L125   PetriNetUnfolderBase]: For 161462/161462 co-relation queries the response was YES.
[2024-06-14 16:03:57,610 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30448 conditions, 3995 events. 2591/3995 cut-off events. For 161462/161462 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 21219 event pairs, 1021 based on Foata normal form. 4/3998 useless extension candidates. Maximal degree in co-relation 30349. Up to 3867 conditions per place. 
[2024-06-14 16:03:57,624 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 292 selfloop transitions, 31 changer transitions 0/326 dead transitions.
[2024-06-14 16:03:57,624 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 326 transitions, 5658 flow
[2024-06-14 16:03:57,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:03:57,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:03:57,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-14 16:03:57,626 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-14 16:03:57,627 INFO  L175             Difference]: Start difference. First operand has 200 places, 303 transitions, 4796 flow. Second operand 7 states and 113 transitions.
[2024-06-14 16:03:57,627 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 326 transitions, 5658 flow
[2024-06-14 16:03:57,901 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 326 transitions, 5566 flow, removed 20 selfloop flow, removed 4 redundant places.
[2024-06-14 16:03:57,906 INFO  L231             Difference]: Finished difference. Result has 203 places, 309 transitions, 4849 flow
[2024-06-14 16:03:57,906 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4706, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4849, PETRI_PLACES=203, PETRI_TRANSITIONS=309}
[2024-06-14 16:03:57,907 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 162 predicate places.
[2024-06-14 16:03:57,907 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 309 transitions, 4849 flow
[2024-06-14 16:03:57,907 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:57,907 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:57,907 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:57,907 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 16:03:57,907 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:57,908 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:57,908 INFO  L85        PathProgramCache]: Analyzing trace with hash 541300891, now seen corresponding path program 2 times
[2024-06-14 16:03:57,908 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:57,908 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125964790]
[2024-06-14 16:03:57,908 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:57,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:57,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:06,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:06,905 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:06,905 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125964790]
[2024-06-14 16:04:06,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125964790] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:06,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:06,906 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:04:06,906 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598893210]
[2024-06-14 16:04:06,906 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:06,906 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:04:06,906 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:06,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:04:06,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:04:06,966 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:04:06,966 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 309 transitions, 4849 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:06,966 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:06,966 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:04:06,966 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:08,247 INFO  L124   PetriNetUnfolderBase]: 2611/4023 cut-off events.
[2024-06-14 16:04:08,248 INFO  L125   PetriNetUnfolderBase]: For 162495/162495 co-relation queries the response was YES.
[2024-06-14 16:04:08,269 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30775 conditions, 4023 events. 2611/4023 cut-off events. For 162495/162495 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 21384 event pairs, 1019 based on Foata normal form. 4/4026 useless extension candidates. Maximal degree in co-relation 30676. Up to 3907 conditions per place. 
[2024-06-14 16:04:08,284 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 297 selfloop transitions, 28 changer transitions 0/328 dead transitions.
[2024-06-14 16:04:08,285 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 328 transitions, 5685 flow
[2024-06-14 16:04:08,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:04:08,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:04:08,286 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions.
[2024-06-14 16:04:08,287 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42083333333333334
[2024-06-14 16:04:08,287 INFO  L175             Difference]: Start difference. First operand has 203 places, 309 transitions, 4849 flow. Second operand 6 states and 101 transitions.
[2024-06-14 16:04:08,287 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 328 transitions, 5685 flow
[2024-06-14 16:04:08,571 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 328 transitions, 5635 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-14 16:04:08,575 INFO  L231             Difference]: Finished difference. Result has 206 places, 312 transitions, 4902 flow
[2024-06-14 16:04:08,576 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4801, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4902, PETRI_PLACES=206, PETRI_TRANSITIONS=312}
[2024-06-14 16:04:08,576 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 165 predicate places.
[2024-06-14 16:04:08,576 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 312 transitions, 4902 flow
[2024-06-14 16:04:08,576 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:08,576 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:08,576 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:08,577 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 16:04:08,577 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:08,577 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:08,577 INFO  L85        PathProgramCache]: Analyzing trace with hash 541306471, now seen corresponding path program 3 times
[2024-06-14 16:04:08,577 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:08,577 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241039290]
[2024-06-14 16:04:08,577 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:08,578 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:08,599 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:18,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:18,054 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:18,054 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241039290]
[2024-06-14 16:04:18,054 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241039290] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:18,054 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:18,054 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:04:18,054 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043479761]
[2024-06-14 16:04:18,054 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:18,054 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:04:18,055 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:18,055 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:04:18,055 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:04:18,170 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:04:18,171 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 312 transitions, 4902 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:18,171 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:18,171 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:04:18,171 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:19,570 INFO  L124   PetriNetUnfolderBase]: 2599/4007 cut-off events.
[2024-06-14 16:04:19,571 INFO  L125   PetriNetUnfolderBase]: For 165878/165878 co-relation queries the response was YES.
[2024-06-14 16:04:19,588 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30725 conditions, 4007 events. 2599/4007 cut-off events. For 165878/165878 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 21274 event pairs, 1015 based on Foata normal form. 4/4010 useless extension candidates. Maximal degree in co-relation 30624. Up to 3899 conditions per place. 
[2024-06-14 16:04:19,602 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 297 selfloop transitions, 29 changer transitions 0/329 dead transitions.
[2024-06-14 16:04:19,603 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 329 transitions, 5626 flow
[2024-06-14 16:04:19,604 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:04:19,604 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:04:19,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions.
[2024-06-14 16:04:19,604 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.378125
[2024-06-14 16:04:19,605 INFO  L175             Difference]: Start difference. First operand has 206 places, 312 transitions, 4902 flow. Second operand 8 states and 121 transitions.
[2024-06-14 16:04:19,605 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 329 transitions, 5626 flow
[2024-06-14 16:04:19,904 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 329 transitions, 5538 flow, removed 18 selfloop flow, removed 4 redundant places.
[2024-06-14 16:04:19,909 INFO  L231             Difference]: Finished difference. Result has 210 places, 312 transitions, 4879 flow
[2024-06-14 16:04:19,909 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4814, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4879, PETRI_PLACES=210, PETRI_TRANSITIONS=312}
[2024-06-14 16:04:19,909 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 169 predicate places.
[2024-06-14 16:04:19,910 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 312 transitions, 4879 flow
[2024-06-14 16:04:19,910 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:19,910 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:19,910 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:19,910 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 16:04:19,910 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:19,910 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:19,911 INFO  L85        PathProgramCache]: Analyzing trace with hash -1599406803, now seen corresponding path program 1 times
[2024-06-14 16:04:19,911 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:19,911 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141445957]
[2024-06-14 16:04:19,911 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:19,911 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:19,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:28,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:28,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:28,516 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141445957]
[2024-06-14 16:04:28,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141445957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:28,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:28,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:04:28,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243793840]
[2024-06-14 16:04:28,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:28,522 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:04:28,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:28,522 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:04:28,522 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:04:28,650 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:04:28,651 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 312 transitions, 4879 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:28,651 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:28,651 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:04:28,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:29,836 INFO  L124   PetriNetUnfolderBase]: 2594/4000 cut-off events.
[2024-06-14 16:04:29,836 INFO  L125   PetriNetUnfolderBase]: For 168988/168988 co-relation queries the response was YES.
[2024-06-14 16:04:29,858 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30690 conditions, 4000 events. 2594/4000 cut-off events. For 168988/168988 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21166 event pairs, 1014 based on Foata normal form. 2/4001 useless extension candidates. Maximal degree in co-relation 30588. Up to 3942 conditions per place. 
[2024-06-14 16:04:29,873 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 305 selfloop transitions, 15 changer transitions 0/323 dead transitions.
[2024-06-14 16:04:29,873 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 323 transitions, 5579 flow
[2024-06-14 16:04:29,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:04:29,874 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:04:29,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions.
[2024-06-14 16:04:29,875 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375
[2024-06-14 16:04:29,875 INFO  L175             Difference]: Start difference. First operand has 210 places, 312 transitions, 4879 flow. Second operand 6 states and 90 transitions.
[2024-06-14 16:04:29,875 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 323 transitions, 5579 flow
[2024-06-14 16:04:30,229 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 323 transitions, 5497 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-14 16:04:30,254 INFO  L231             Difference]: Finished difference. Result has 209 places, 314 transitions, 4868 flow
[2024-06-14 16:04:30,255 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4797, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4868, PETRI_PLACES=209, PETRI_TRANSITIONS=314}
[2024-06-14 16:04:30,255 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 168 predicate places.
[2024-06-14 16:04:30,255 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 314 transitions, 4868 flow
[2024-06-14 16:04:30,255 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:30,255 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:30,256 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:30,256 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 16:04:30,256 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:30,256 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:30,256 INFO  L85        PathProgramCache]: Analyzing trace with hash -626536971, now seen corresponding path program 1 times
[2024-06-14 16:04:30,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:30,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340047556]
[2024-06-14 16:04:30,257 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:30,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:30,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:39,424 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:39,425 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:39,425 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340047556]
[2024-06-14 16:04:39,425 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340047556] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:39,425 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:39,425 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:04:39,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098671817]
[2024-06-14 16:04:39,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:39,426 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:04:39,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:39,428 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:04:39,428 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:04:39,540 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-14 16:04:39,541 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 314 transitions, 4868 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:39,541 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:39,541 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-14 16:04:39,541 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:40,915 INFO  L124   PetriNetUnfolderBase]: 2748/4237 cut-off events.
[2024-06-14 16:04:40,916 INFO  L125   PetriNetUnfolderBase]: For 209892/209928 co-relation queries the response was YES.
[2024-06-14 16:04:40,937 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33254 conditions, 4237 events. 2748/4237 cut-off events. For 209892/209928 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 23037 event pairs, 661 based on Foata normal form. 20/4213 useless extension candidates. Maximal degree in co-relation 33151. Up to 2760 conditions per place. 
[2024-06-14 16:04:40,954 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 206 selfloop transitions, 142 changer transitions 0/386 dead transitions.
[2024-06-14 16:04:40,954 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 386 transitions, 6420 flow
[2024-06-14 16:04:40,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:04:40,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:04:40,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-14 16:04:40,955 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.490625
[2024-06-14 16:04:40,955 INFO  L175             Difference]: Start difference. First operand has 209 places, 314 transitions, 4868 flow. Second operand 8 states and 157 transitions.
[2024-06-14 16:04:40,955 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 386 transitions, 6420 flow
[2024-06-14 16:04:41,331 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 386 transitions, 6365 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-14 16:04:41,336 INFO  L231             Difference]: Finished difference. Result has 216 places, 344 transitions, 5724 flow
[2024-06-14 16:04:41,337 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4813, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5724, PETRI_PLACES=216, PETRI_TRANSITIONS=344}
[2024-06-14 16:04:41,337 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 175 predicate places.
[2024-06-14 16:04:41,337 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 344 transitions, 5724 flow
[2024-06-14 16:04:41,337 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:41,337 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:41,337 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:41,337 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 16:04:41,338 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:41,338 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:41,338 INFO  L85        PathProgramCache]: Analyzing trace with hash 565333685, now seen corresponding path program 1 times
[2024-06-14 16:04:41,338 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:41,338 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843859445]
[2024-06-14 16:04:41,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:41,338 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:41,361 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:51,818 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:51,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:51,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843859445]
[2024-06-14 16:04:51,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843859445] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:51,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:51,819 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:04:51,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454833729]
[2024-06-14 16:04:51,819 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:51,819 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:04:51,819 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:51,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:04:51,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:04:51,964 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:04:51,965 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 344 transitions, 5724 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:51,965 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:51,965 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:04:51,965 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:53,669 INFO  L124   PetriNetUnfolderBase]: 2882/4404 cut-off events.
[2024-06-14 16:04:53,669 INFO  L125   PetriNetUnfolderBase]: For 208781/208799 co-relation queries the response was YES.
[2024-06-14 16:04:53,690 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36350 conditions, 4404 events. 2882/4404 cut-off events. For 208781/208799 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23483 event pairs, 814 based on Foata normal form. 22/4425 useless extension candidates. Maximal degree in co-relation 36243. Up to 3927 conditions per place. 
[2024-06-14 16:04:53,706 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 272 selfloop transitions, 115 changer transitions 0/390 dead transitions.
[2024-06-14 16:04:53,706 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 390 transitions, 7309 flow
[2024-06-14 16:04:53,707 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:04:53,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:04:53,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-14 16:04:53,708 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-14 16:04:53,708 INFO  L175             Difference]: Start difference. First operand has 216 places, 344 transitions, 5724 flow. Second operand 8 states and 140 transitions.
[2024-06-14 16:04:53,708 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 390 transitions, 7309 flow
[2024-06-14 16:04:54,162 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 390 transitions, 7228 flow, removed 27 selfloop flow, removed 2 redundant places.
[2024-06-14 16:04:54,168 INFO  L231             Difference]: Finished difference. Result has 223 places, 362 transitions, 6357 flow
[2024-06-14 16:04:54,169 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5643, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6357, PETRI_PLACES=223, PETRI_TRANSITIONS=362}
[2024-06-14 16:04:54,169 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 182 predicate places.
[2024-06-14 16:04:54,169 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 362 transitions, 6357 flow
[2024-06-14 16:04:54,170 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:54,170 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:54,170 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:54,170 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 16:04:54,170 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:54,170 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:54,170 INFO  L85        PathProgramCache]: Analyzing trace with hash 1970173771, now seen corresponding path program 2 times
[2024-06-14 16:04:54,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:54,171 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616398903]
[2024-06-14 16:04:54,171 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:54,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:54,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:03,532 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:03,533 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:03,533 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616398903]
[2024-06-14 16:05:03,533 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616398903] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:03,533 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:03,533 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:05:03,533 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747396874]
[2024-06-14 16:05:03,533 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:03,533 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:05:03,534 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:03,534 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:05:03,534 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:05:03,722 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:05:03,722 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 362 transitions, 6357 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:03,722 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:03,722 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:05:03,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:05,303 INFO  L124   PetriNetUnfolderBase]: 2866/4383 cut-off events.
[2024-06-14 16:05:05,303 INFO  L125   PetriNetUnfolderBase]: For 210678/210682 co-relation queries the response was YES.
[2024-06-14 16:05:05,324 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36266 conditions, 4383 events. 2866/4383 cut-off events. For 210678/210682 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 23360 event pairs, 883 based on Foata normal form. 8/4390 useless extension candidates. Maximal degree in co-relation 36156. Up to 4284 conditions per place. 
[2024-06-14 16:05:05,343 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 343 selfloop transitions, 37 changer transitions 0/383 dead transitions.
[2024-06-14 16:05:05,343 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 383 transitions, 7197 flow
[2024-06-14 16:05:05,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:05:05,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:05:05,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions.
[2024-06-14 16:05:05,345 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38055555555555554
[2024-06-14 16:05:05,345 INFO  L175             Difference]: Start difference. First operand has 223 places, 362 transitions, 6357 flow. Second operand 9 states and 137 transitions.
[2024-06-14 16:05:05,345 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 383 transitions, 7197 flow
[2024-06-14 16:05:05,769 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 383 transitions, 6938 flow, removed 62 selfloop flow, removed 4 redundant places.
[2024-06-14 16:05:05,775 INFO  L231             Difference]: Finished difference. Result has 228 places, 362 transitions, 6183 flow
[2024-06-14 16:05:05,775 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6098, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6183, PETRI_PLACES=228, PETRI_TRANSITIONS=362}
[2024-06-14 16:05:05,775 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 187 predicate places.
[2024-06-14 16:05:05,775 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 362 transitions, 6183 flow
[2024-06-14 16:05:05,776 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:05,776 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:05,776 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:05,776 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 16:05:05,776 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:05,776 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:05,777 INFO  L85        PathProgramCache]: Analyzing trace with hash 758465363, now seen corresponding path program 2 times
[2024-06-14 16:05:05,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:05,777 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771670856]
[2024-06-14 16:05:05,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:05,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:05,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:16,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:16,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:16,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771670856]
[2024-06-14 16:05:16,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771670856] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:16,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:16,606 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:05:16,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721618789]
[2024-06-14 16:05:16,606 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:16,606 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:05:16,606 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:16,606 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:05:16,607 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:05:16,743 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:05:16,743 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 362 transitions, 6183 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:16,743 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:16,743 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:05:16,743 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:18,230 INFO  L124   PetriNetUnfolderBase]: 2975/4545 cut-off events.
[2024-06-14 16:05:18,230 INFO  L125   PetriNetUnfolderBase]: For 220889/220895 co-relation queries the response was YES.
[2024-06-14 16:05:18,269 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37212 conditions, 4545 events. 2975/4545 cut-off events. For 220889/220895 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 24366 event pairs, 806 based on Foata normal form. 9/4553 useless extension candidates. Maximal degree in co-relation 37101. Up to 3957 conditions per place. 
[2024-06-14 16:05:18,294 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 276 selfloop transitions, 140 changer transitions 0/419 dead transitions.
[2024-06-14 16:05:18,294 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 419 transitions, 7812 flow
[2024-06-14 16:05:18,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:05:18,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:05:18,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-14 16:05:18,297 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4325
[2024-06-14 16:05:18,297 INFO  L175             Difference]: Start difference. First operand has 228 places, 362 transitions, 6183 flow. Second operand 10 states and 173 transitions.
[2024-06-14 16:05:18,297 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 419 transitions, 7812 flow
[2024-06-14 16:05:18,883 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 419 transitions, 7743 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-14 16:05:18,889 INFO  L231             Difference]: Finished difference. Result has 232 places, 381 transitions, 6725 flow
[2024-06-14 16:05:18,890 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6114, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6725, PETRI_PLACES=232, PETRI_TRANSITIONS=381}
[2024-06-14 16:05:18,890 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 191 predicate places.
[2024-06-14 16:05:18,890 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 381 transitions, 6725 flow
[2024-06-14 16:05:18,890 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:18,890 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:18,890 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:18,890 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 16:05:18,891 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:18,891 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:18,891 INFO  L85        PathProgramCache]: Analyzing trace with hash 758704683, now seen corresponding path program 1 times
[2024-06-14 16:05:18,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:18,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702742106]
[2024-06-14 16:05:18,891 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:18,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:18,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:28,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:28,929 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:28,929 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702742106]
[2024-06-14 16:05:28,929 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702742106] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:28,929 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:28,929 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:05:28,930 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752369342]
[2024-06-14 16:05:28,930 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:28,930 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:05:28,930 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:28,931 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:05:28,932 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:05:29,038 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:05:29,039 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 381 transitions, 6725 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:29,039 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:29,039 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:05:29,039 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:30,996 INFO  L124   PetriNetUnfolderBase]: 3530/5312 cut-off events.
[2024-06-14 16:05:30,997 INFO  L125   PetriNetUnfolderBase]: For 286425/286443 co-relation queries the response was YES.
[2024-06-14 16:05:31,031 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45369 conditions, 5312 events. 3530/5312 cut-off events. For 286425/286443 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28514 event pairs, 716 based on Foata normal form. 26/5337 useless extension candidates. Maximal degree in co-relation 45256. Up to 3241 conditions per place. 
[2024-06-14 16:05:31,055 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 297 selfloop transitions, 189 changer transitions 0/489 dead transitions.
[2024-06-14 16:05:31,055 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 489 transitions, 9254 flow
[2024-06-14 16:05:31,056 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:05:31,056 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:05:31,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-14 16:05:31,057 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48055555555555557
[2024-06-14 16:05:31,057 INFO  L175             Difference]: Start difference. First operand has 232 places, 381 transitions, 6725 flow. Second operand 9 states and 173 transitions.
[2024-06-14 16:05:31,057 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 489 transitions, 9254 flow
[2024-06-14 16:05:31,749 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 489 transitions, 9080 flow, removed 38 selfloop flow, removed 5 redundant places.
[2024-06-14 16:05:31,756 INFO  L231             Difference]: Finished difference. Result has 240 places, 430 transitions, 7935 flow
[2024-06-14 16:05:31,756 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6551, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7935, PETRI_PLACES=240, PETRI_TRANSITIONS=430}
[2024-06-14 16:05:31,756 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 199 predicate places.
[2024-06-14 16:05:31,756 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 430 transitions, 7935 flow
[2024-06-14 16:05:31,756 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:31,757 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:31,757 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:31,757 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 16:05:31,757 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:31,757 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:31,757 INFO  L85        PathProgramCache]: Analyzing trace with hash 1969113633, now seen corresponding path program 2 times
[2024-06-14 16:05:31,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:31,758 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251365754]
[2024-06-14 16:05:31,758 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:31,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:31,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:42,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:42,615 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:42,615 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251365754]
[2024-06-14 16:05:42,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251365754] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:42,616 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:42,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:05:42,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865565393]
[2024-06-14 16:05:42,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:42,616 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:05:42,616 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:42,617 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:05:42,617 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:05:42,764 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:05:42,765 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 430 transitions, 7935 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:42,765 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:42,765 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:05:42,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:44,786 INFO  L124   PetriNetUnfolderBase]: 3840/5742 cut-off events.
[2024-06-14 16:05:44,786 INFO  L125   PetriNetUnfolderBase]: For 340442/340446 co-relation queries the response was YES.
[2024-06-14 16:05:44,818 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52821 conditions, 5742 events. 3840/5742 cut-off events. For 340442/340446 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 30929 event pairs, 1023 based on Foata normal form. 10/5751 useless extension candidates. Maximal degree in co-relation 52702. Up to 5279 conditions per place. 
[2024-06-14 16:05:44,842 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 415 selfloop transitions, 69 changer transitions 0/487 dead transitions.
[2024-06-14 16:05:44,842 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 487 transitions, 9750 flow
[2024-06-14 16:05:44,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:05:44,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:05:44,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions.
[2024-06-14 16:05:44,843 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4022727272727273
[2024-06-14 16:05:44,843 INFO  L175             Difference]: Start difference. First operand has 240 places, 430 transitions, 7935 flow. Second operand 11 states and 177 transitions.
[2024-06-14 16:05:44,843 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 487 transitions, 9750 flow
[2024-06-14 16:05:45,663 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 487 transitions, 9492 flow, removed 51 selfloop flow, removed 3 redundant places.
[2024-06-14 16:05:45,673 INFO  L231             Difference]: Finished difference. Result has 250 places, 452 transitions, 8288 flow
[2024-06-14 16:05:45,673 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7697, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8288, PETRI_PLACES=250, PETRI_TRANSITIONS=452}
[2024-06-14 16:05:45,674 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 209 predicate places.
[2024-06-14 16:05:45,674 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 452 transitions, 8288 flow
[2024-06-14 16:05:45,674 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:45,674 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:45,674 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:45,675 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 16:05:45,675 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:45,675 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:45,675 INFO  L85        PathProgramCache]: Analyzing trace with hash 1930673013, now seen corresponding path program 3 times
[2024-06-14 16:05:45,675 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:45,675 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796330968]
[2024-06-14 16:05:45,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:45,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:45,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:55,650 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:55,650 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:55,650 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796330968]
[2024-06-14 16:05:55,650 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796330968] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:55,650 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:55,650 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:05:55,651 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927053782]
[2024-06-14 16:05:55,651 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:55,651 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:05:55,651 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:55,651 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:05:55,652 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:05:55,762 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:05:55,762 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 452 transitions, 8288 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:55,762 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:55,763 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:05:55,763 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:57,779 INFO  L124   PetriNetUnfolderBase]: 3816/5712 cut-off events.
[2024-06-14 16:05:57,779 INFO  L125   PetriNetUnfolderBase]: For 347741/347745 co-relation queries the response was YES.
[2024-06-14 16:05:57,813 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51640 conditions, 5712 events. 3816/5712 cut-off events. For 347741/347745 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 30789 event pairs, 1025 based on Foata normal form. 16/5727 useless extension candidates. Maximal degree in co-relation 51518. Up to 5274 conditions per place. 
[2024-06-14 16:05:57,839 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 414 selfloop transitions, 70 changer transitions 0/487 dead transitions.
[2024-06-14 16:05:57,840 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 487 transitions, 9730 flow
[2024-06-14 16:05:57,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:05:57,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:05:57,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions.
[2024-06-14 16:05:57,841 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4175
[2024-06-14 16:05:57,841 INFO  L175             Difference]: Start difference. First operand has 250 places, 452 transitions, 8288 flow. Second operand 10 states and 167 transitions.
[2024-06-14 16:05:57,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 487 transitions, 9730 flow
[2024-06-14 16:05:58,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 487 transitions, 9545 flow, removed 67 selfloop flow, removed 6 redundant places.
[2024-06-14 16:05:58,688 INFO  L231             Difference]: Finished difference. Result has 254 places, 454 transitions, 8309 flow
[2024-06-14 16:05:58,689 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8109, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8309, PETRI_PLACES=254, PETRI_TRANSITIONS=454}
[2024-06-14 16:05:58,689 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 213 predicate places.
[2024-06-14 16:05:58,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 454 transitions, 8309 flow
[2024-06-14 16:05:58,689 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:58,689 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:58,689 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:58,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 16:05:58,690 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:58,690 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:58,690 INFO  L85        PathProgramCache]: Analyzing trace with hash 767036243, now seen corresponding path program 3 times
[2024-06-14 16:05:58,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:58,690 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995625034]
[2024-06-14 16:05:58,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:58,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:58,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:09,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:06:09,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:09,295 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995625034]
[2024-06-14 16:06:09,295 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995625034] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:09,295 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:09,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:06:09,296 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334027904]
[2024-06-14 16:06:09,296 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:09,296 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:06:09,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:09,296 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:06:09,296 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:06:09,446 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:06:09,446 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 454 transitions, 8309 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:09,446 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:09,446 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:06:09,446 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:11,336 INFO  L124   PetriNetUnfolderBase]: 3795/5682 cut-off events.
[2024-06-14 16:06:11,336 INFO  L125   PetriNetUnfolderBase]: For 344242/344246 co-relation queries the response was YES.
[2024-06-14 16:06:11,371 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51183 conditions, 5682 events. 3795/5682 cut-off events. For 344242/344246 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 30557 event pairs, 1080 based on Foata normal form. 7/5688 useless extension candidates. Maximal degree in co-relation 51059. Up to 5569 conditions per place. 
[2024-06-14 16:06:11,397 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 433 selfloop transitions, 41 changer transitions 0/477 dead transitions.
[2024-06-14 16:06:11,398 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 477 transitions, 9349 flow
[2024-06-14 16:06:11,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:06:11,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:06:11,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions.
[2024-06-14 16:06:11,415 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375
[2024-06-14 16:06:11,415 INFO  L175             Difference]: Start difference. First operand has 254 places, 454 transitions, 8309 flow. Second operand 10 states and 150 transitions.
[2024-06-14 16:06:11,415 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 477 transitions, 9349 flow
[2024-06-14 16:06:12,152 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 477 transitions, 9207 flow, removed 24 selfloop flow, removed 6 redundant places.
[2024-06-14 16:06:12,158 INFO  L231             Difference]: Finished difference. Result has 258 places, 454 transitions, 8257 flow
[2024-06-14 16:06:12,159 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8167, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8257, PETRI_PLACES=258, PETRI_TRANSITIONS=454}
[2024-06-14 16:06:12,159 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 217 predicate places.
[2024-06-14 16:06:12,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 454 transitions, 8257 flow
[2024-06-14 16:06:12,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:12,160 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:12,160 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:06:12,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 16:06:12,160 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:06:12,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:12,160 INFO  L85        PathProgramCache]: Analyzing trace with hash 619940895, now seen corresponding path program 4 times
[2024-06-14 16:06:12,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:12,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502244555]
[2024-06-14 16:06:12,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:12,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:12,196 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:20,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:06:20,326 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:20,326 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502244555]
[2024-06-14 16:06:20,326 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502244555] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:20,326 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:20,326 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:06:20,326 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422091040]
[2024-06-14 16:06:20,326 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:20,327 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:06:20,327 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:20,327 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:06:20,327 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:06:20,543 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:06:20,544 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 454 transitions, 8257 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:20,544 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:20,544 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:06:20,544 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:22,638 INFO  L124   PetriNetUnfolderBase]: 3836/5743 cut-off events.
[2024-06-14 16:06:22,638 INFO  L125   PetriNetUnfolderBase]: For 357551/357557 co-relation queries the response was YES.
[2024-06-14 16:06:22,679 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51653 conditions, 5743 events. 3836/5743 cut-off events. For 357551/357557 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 31037 event pairs, 895 based on Foata normal form. 10/5752 useless extension candidates. Maximal degree in co-relation 51528. Up to 4859 conditions per place. 
[2024-06-14 16:06:22,706 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 279 selfloop transitions, 225 changer transitions 0/507 dead transitions.
[2024-06-14 16:06:22,706 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 507 transitions, 10053 flow
[2024-06-14 16:06:22,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:06:22,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:06:22,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-14 16:06:22,708 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4388888888888889
[2024-06-14 16:06:22,708 INFO  L175             Difference]: Start difference. First operand has 258 places, 454 transitions, 8257 flow. Second operand 9 states and 158 transitions.
[2024-06-14 16:06:22,708 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 507 transitions, 10053 flow
[2024-06-14 16:06:23,625 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 507 transitions, 9964 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-14 16:06:23,632 INFO  L231             Difference]: Finished difference. Result has 262 places, 470 transitions, 9023 flow
[2024-06-14 16:06:23,632 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8168, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9023, PETRI_PLACES=262, PETRI_TRANSITIONS=470}
[2024-06-14 16:06:23,633 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 221 predicate places.
[2024-06-14 16:06:23,633 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 470 transitions, 9023 flow
[2024-06-14 16:06:23,633 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:23,633 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:23,633 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:06:23,633 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 16:06:23,634 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:06:23,634 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:23,634 INFO  L85        PathProgramCache]: Analyzing trace with hash 620180215, now seen corresponding path program 4 times
[2024-06-14 16:06:23,634 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:23,634 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555947943]
[2024-06-14 16:06:23,634 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:23,635 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:23,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:30,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:06:30,764 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:30,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555947943]
[2024-06-14 16:06:30,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555947943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:30,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:30,764 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:06:30,764 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053909788]
[2024-06-14 16:06:30,764 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:30,765 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:06:30,765 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:30,766 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:06:30,766 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:06:30,826 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:06:30,827 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 470 transitions, 9023 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:30,827 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:30,827 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:06:30,827 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:32,770 INFO  L124   PetriNetUnfolderBase]: 3998/5968 cut-off events.
[2024-06-14 16:06:32,771 INFO  L125   PetriNetUnfolderBase]: For 398678/398684 co-relation queries the response was YES.
[2024-06-14 16:06:32,810 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55373 conditions, 5968 events. 3998/5968 cut-off events. For 398678/398684 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 32271 event pairs, 780 based on Foata normal form. 16/5983 useless extension candidates. Maximal degree in co-relation 55246. Up to 3526 conditions per place. 
[2024-06-14 16:06:32,839 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 252 selfloop transitions, 269 changer transitions 0/524 dead transitions.
[2024-06-14 16:06:32,839 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 524 transitions, 10900 flow
[2024-06-14 16:06:32,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:06:32,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:06:32,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-14 16:06:32,840 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-14 16:06:32,840 INFO  L175             Difference]: Start difference. First operand has 262 places, 470 transitions, 9023 flow. Second operand 8 states and 152 transitions.
[2024-06-14 16:06:32,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 524 transitions, 10900 flow
[2024-06-14 16:06:33,728 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 524 transitions, 10560 flow, removed 54 selfloop flow, removed 5 redundant places.
[2024-06-14 16:06:33,736 INFO  L231             Difference]: Finished difference. Result has 266 places, 484 transitions, 9590 flow
[2024-06-14 16:06:33,736 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8683, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=255, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9590, PETRI_PLACES=266, PETRI_TRANSITIONS=484}
[2024-06-14 16:06:33,736 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 225 predicate places.
[2024-06-14 16:06:33,737 INFO  L495      AbstractCegarLoop]: Abstraction has has 266 places, 484 transitions, 9590 flow
[2024-06-14 16:06:33,737 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:33,737 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:33,737 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:06:33,737 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 16:06:33,737 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:06:33,752 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:33,752 INFO  L85        PathProgramCache]: Analyzing trace with hash 623754143, now seen corresponding path program 3 times
[2024-06-14 16:06:33,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:33,753 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715523938]
[2024-06-14 16:06:33,753 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:33,753 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:33,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:40,576 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:06:40,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:40,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715523938]
[2024-06-14 16:06:40,576 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715523938] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:40,576 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:40,576 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:06:40,576 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543039069]
[2024-06-14 16:06:40,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:40,577 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:06:40,577 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:40,577 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:06:40,577 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:06:40,716 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:06:40,716 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 484 transitions, 9590 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:40,716 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:40,716 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:06:40,716 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:42,676 INFO  L124   PetriNetUnfolderBase]: 4040/6025 cut-off events.
[2024-06-14 16:06:42,676 INFO  L125   PetriNetUnfolderBase]: For 416816/416838 co-relation queries the response was YES.
[2024-06-14 16:06:42,712 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58285 conditions, 6025 events. 4040/6025 cut-off events. For 416816/416838 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 32689 event pairs, 969 based on Foata normal form. 32/6056 useless extension candidates. Maximal degree in co-relation 58155. Up to 5374 conditions per place. 
[2024-06-14 16:06:42,739 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 348 selfloop transitions, 183 changer transitions 0/534 dead transitions.
[2024-06-14 16:06:42,739 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 534 transitions, 11638 flow
[2024-06-14 16:06:42,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:06:42,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:06:42,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-14 16:06:42,741 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43214285714285716
[2024-06-14 16:06:42,741 INFO  L175             Difference]: Start difference. First operand has 266 places, 484 transitions, 9590 flow. Second operand 7 states and 121 transitions.
[2024-06-14 16:06:42,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 534 transitions, 11638 flow
[2024-06-14 16:06:43,696 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 534 transitions, 11205 flow, removed 56 selfloop flow, removed 4 redundant places.
[2024-06-14 16:06:43,705 INFO  L231             Difference]: Finished difference. Result has 270 places, 506 transitions, 10240 flow
[2024-06-14 16:06:43,706 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9174, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10240, PETRI_PLACES=270, PETRI_TRANSITIONS=506}
[2024-06-14 16:06:43,706 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 229 predicate places.
[2024-06-14 16:06:43,706 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 506 transitions, 10240 flow
[2024-06-14 16:06:43,707 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:43,707 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:43,707 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:06:43,707 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 16:06:43,707 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-14 16:06:43,707 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:43,708 INFO  L85        PathProgramCache]: Analyzing trace with hash -822250399, now seen corresponding path program 4 times
[2024-06-14 16:06:43,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:43,708 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998645966]
[2024-06-14 16:06:43,708 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:43,708 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:43,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:50,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:06:50,749 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:50,749 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998645966]
[2024-06-14 16:06:50,749 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998645966] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:50,749 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:50,750 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:06:50,750 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145629210]
[2024-06-14 16:06:50,750 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:50,750 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:06:50,750 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:50,750 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:06:50,750 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:06:50,817 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:06:50,817 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 506 transitions, 10240 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:50,817 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:50,817 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:06:50,817 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:52,680 INFO  L124   PetriNetUnfolderBase]: 4024/6002 cut-off events.
[2024-06-14 16:06:52,680 INFO  L125   PetriNetUnfolderBase]: For 407170/407174 co-relation queries the response was YES.
[2024-06-14 16:06:52,725 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56992 conditions, 6002 events. 4024/6002 cut-off events. For 407170/407174 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 32494 event pairs, 1119 based on Foata normal form. 8/6009 useless extension candidates. Maximal degree in co-relation 56860. Up to 5877 conditions per place. 
[2024-06-14 16:06:52,883 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 473 selfloop transitions, 49 changer transitions 0/525 dead transitions.
[2024-06-14 16:06:52,883 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 525 transitions, 11374 flow
[2024-06-14 16:06:52,885 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:06:52,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:06:52,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions.
[2024-06-14 16:06:52,885 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38125
[2024-06-14 16:06:52,885 INFO  L175             Difference]: Start difference. First operand has 270 places, 506 transitions, 10240 flow. Second operand 8 states and 122 transitions.
[2024-06-14 16:06:52,885 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 525 transitions, 11374 flow
[2024-06-14 16:06:53,967 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 525 transitions, 10964 flow, removed 130 selfloop flow, removed 3 redundant places.
[2024-06-14 16:06:53,978 INFO  L231             Difference]: Finished difference. Result has 275 places, 506 transitions, 9948 flow
[2024-06-14 16:06:53,979 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9830, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9948, PETRI_PLACES=275, PETRI_TRANSITIONS=506}
[2024-06-14 16:06:53,979 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 234 predicate places.
[2024-06-14 16:06:53,979 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 506 transitions, 9948 flow
[2024-06-14 16:06:53,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:53,980 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:53,980 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:06:53,980 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 16:06:53,980 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:06:53,981 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:53,981 INFO  L85        PathProgramCache]: Analyzing trace with hash -556344581, now seen corresponding path program 1 times
[2024-06-14 16:06:53,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:53,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309945920]
[2024-06-14 16:06:53,981 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:53,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:54,026 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:01,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:01,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:01,089 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309945920]
[2024-06-14 16:07:01,089 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309945920] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:01,089 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:01,089 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:07:01,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047421043]
[2024-06-14 16:07:01,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:01,089 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:07:01,090 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:01,090 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:07:01,090 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:07:01,308 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:07:01,308 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 506 transitions, 9948 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:01,309 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:01,309 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:07:01,309 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:03,461 INFO  L124   PetriNetUnfolderBase]: 4012/5994 cut-off events.
[2024-06-14 16:07:03,461 INFO  L125   PetriNetUnfolderBase]: For 402056/402062 co-relation queries the response was YES.
[2024-06-14 16:07:03,502 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55862 conditions, 5994 events. 4012/5994 cut-off events. For 402056/402062 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 32492 event pairs, 955 based on Foata normal form. 12/6005 useless extension candidates. Maximal degree in co-relation 55729. Up to 5382 conditions per place. 
[2024-06-14 16:07:03,529 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 442 selfloop transitions, 100 changer transitions 0/545 dead transitions.
[2024-06-14 16:07:03,530 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 545 transitions, 11176 flow
[2024-06-14 16:07:03,532 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:07:03,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:07:03,532 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-14 16:07:03,535 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-14 16:07:03,535 INFO  L175             Difference]: Start difference. First operand has 275 places, 506 transitions, 9948 flow. Second operand 9 states and 149 transitions.
[2024-06-14 16:07:03,535 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 545 transitions, 11176 flow
[2024-06-14 16:07:04,330 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 545 transitions, 11085 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-14 16:07:04,338 INFO  L231             Difference]: Finished difference. Result has 275 places, 505 transitions, 10006 flow
[2024-06-14 16:07:04,352 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9801, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10006, PETRI_PLACES=275, PETRI_TRANSITIONS=505}
[2024-06-14 16:07:04,353 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 234 predicate places.
[2024-06-14 16:07:04,353 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 505 transitions, 10006 flow
[2024-06-14 16:07:04,353 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:04,353 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:04,353 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:07:04,353 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 16:07:04,354 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:07:04,354 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:04,354 INFO  L85        PathProgramCache]: Analyzing trace with hash 628512085, now seen corresponding path program 5 times
[2024-06-14 16:07:04,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:04,354 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317045650]
[2024-06-14 16:07:04,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:04,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:04,384 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:11,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:11,872 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:11,872 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317045650]
[2024-06-14 16:07:11,872 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317045650] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:11,873 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:11,873 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:07:11,873 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125211506]
[2024-06-14 16:07:11,873 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:11,873 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:07:11,873 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:11,873 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:07:11,874 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:07:12,027 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:07:12,028 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 505 transitions, 10006 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:12,028 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:12,028 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:07:12,028 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:13,998 INFO  L124   PetriNetUnfolderBase]: 4316/6403 cut-off events.
[2024-06-14 16:07:13,998 INFO  L125   PetriNetUnfolderBase]: For 449853/449857 co-relation queries the response was YES.
[2024-06-14 16:07:14,040 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60847 conditions, 6403 events. 4316/6403 cut-off events. For 449853/449857 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 34813 event pairs, 1098 based on Foata normal form. 16/6418 useless extension candidates. Maximal degree in co-relation 60715. Up to 5664 conditions per place. 
[2024-06-14 16:07:14,070 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 460 selfloop transitions, 93 changer transitions 0/556 dead transitions.
[2024-06-14 16:07:14,070 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 556 transitions, 11987 flow
[2024-06-14 16:07:14,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:07:14,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:07:14,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-14 16:07:14,071 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41944444444444445
[2024-06-14 16:07:14,071 INFO  L175             Difference]: Start difference. First operand has 275 places, 505 transitions, 10006 flow. Second operand 9 states and 151 transitions.
[2024-06-14 16:07:14,071 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 556 transitions, 11987 flow
[2024-06-14 16:07:14,900 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 556 transitions, 11754 flow, removed 18 selfloop flow, removed 7 redundant places.
[2024-06-14 16:07:14,908 INFO  L231             Difference]: Finished difference. Result has 279 places, 522 transitions, 10425 flow
[2024-06-14 16:07:14,909 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9773, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10425, PETRI_PLACES=279, PETRI_TRANSITIONS=522}
[2024-06-14 16:07:14,909 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 238 predicate places.
[2024-06-14 16:07:14,909 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 522 transitions, 10425 flow
[2024-06-14 16:07:14,909 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:14,909 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:14,909 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:07:14,910 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 16:07:14,910 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-14 16:07:14,910 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:14,910 INFO  L85        PathProgramCache]: Analyzing trace with hash 628511775, now seen corresponding path program 5 times
[2024-06-14 16:07:14,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:14,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849268923]
[2024-06-14 16:07:14,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:14,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:14,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:22,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:22,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:22,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849268923]
[2024-06-14 16:07:22,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849268923] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:22,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:22,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:07:22,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754680349]
[2024-06-14 16:07:22,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:22,260 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:07:22,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:22,261 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:07:22,261 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:07:22,420 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:07:22,421 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 522 transitions, 10425 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:22,421 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:22,421 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:07:22,421 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:24,463 INFO  L124   PetriNetUnfolderBase]: 4279/6355 cut-off events.
[2024-06-14 16:07:24,464 INFO  L125   PetriNetUnfolderBase]: For 448021/448025 co-relation queries the response was YES.
[2024-06-14 16:07:24,507 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60694 conditions, 6355 events. 4279/6355 cut-off events. For 448021/448025 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 34586 event pairs, 1062 based on Foata normal form. 19/6373 useless extension candidates. Maximal degree in co-relation 60559. Up to 5830 conditions per place. 
[2024-06-14 16:07:24,536 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 468 selfloop transitions, 97 changer transitions 0/568 dead transitions.
[2024-06-14 16:07:24,536 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 568 transitions, 12339 flow
[2024-06-14 16:07:24,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:07:24,537 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:07:24,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-14 16:07:24,537 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-14 16:07:24,538 INFO  L175             Difference]: Start difference. First operand has 279 places, 522 transitions, 10425 flow. Second operand 9 states and 149 transitions.
[2024-06-14 16:07:24,538 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 568 transitions, 12339 flow
[2024-06-14 16:07:25,586 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 568 transitions, 12114 flow, removed 89 selfloop flow, removed 4 redundant places.
[2024-06-14 16:07:25,594 INFO  L231             Difference]: Finished difference. Result has 286 places, 537 transitions, 10828 flow
[2024-06-14 16:07:25,594 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10252, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10828, PETRI_PLACES=286, PETRI_TRANSITIONS=537}
[2024-06-14 16:07:25,595 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 245 predicate places.
[2024-06-14 16:07:25,595 INFO  L495      AbstractCegarLoop]: Abstraction has has 286 places, 537 transitions, 10828 flow
[2024-06-14 16:07:25,595 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:25,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:25,595 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:07:25,595 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 16:07:25,596 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-14 16:07:25,596 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:25,596 INFO  L85        PathProgramCache]: Analyzing trace with hash 628522315, now seen corresponding path program 6 times
[2024-06-14 16:07:25,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:25,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307866904]
[2024-06-14 16:07:25,596 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:25,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:25,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:32,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:32,747 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:32,747 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307866904]
[2024-06-14 16:07:32,748 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307866904] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:32,748 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:32,748 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:07:32,748 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039663959]
[2024-06-14 16:07:32,748 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:32,748 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:07:32,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:32,749 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:07:32,749 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:07:32,905 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:07:32,905 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 537 transitions, 10828 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:32,905 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:32,905 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:07:32,905 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:35,349 INFO  L124   PetriNetUnfolderBase]: 4297/6381 cut-off events.
[2024-06-14 16:07:35,350 INFO  L125   PetriNetUnfolderBase]: For 443730/443734 co-relation queries the response was YES.
[2024-06-14 16:07:35,412 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61366 conditions, 6381 events. 4297/6381 cut-off events. For 443730/443734 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 34675 event pairs, 1056 based on Foata normal form. 10/6390 useless extension candidates. Maximal degree in co-relation 61227. Up to 5666 conditions per place. 
[2024-06-14 16:07:35,453 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 463 selfloop transitions, 107 changer transitions 0/573 dead transitions.
[2024-06-14 16:07:35,453 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 573 transitions, 12508 flow
[2024-06-14 16:07:35,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:07:35,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:07:35,454 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions.
[2024-06-14 16:07:35,454 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4025
[2024-06-14 16:07:35,454 INFO  L175             Difference]: Start difference. First operand has 286 places, 537 transitions, 10828 flow. Second operand 10 states and 161 transitions.
[2024-06-14 16:07:35,455 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 573 transitions, 12508 flow
[2024-06-14 16:07:37,146 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 573 transitions, 12335 flow, removed 60 selfloop flow, removed 5 redundant places.
[2024-06-14 16:07:37,158 INFO  L231             Difference]: Finished difference. Result has 292 places, 541 transitions, 11005 flow
[2024-06-14 16:07:37,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10661, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11005, PETRI_PLACES=292, PETRI_TRANSITIONS=541}
[2024-06-14 16:07:37,159 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 251 predicate places.
[2024-06-14 16:07:37,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 292 places, 541 transitions, 11005 flow
[2024-06-14 16:07:37,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:37,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:37,160 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:07:37,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 16:07:37,160 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-14 16:07:37,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:37,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -496800901, now seen corresponding path program 5 times
[2024-06-14 16:07:37,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:37,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432156358]
[2024-06-14 16:07:37,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:37,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:37,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:44,303 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:44,303 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:44,303 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432156358]
[2024-06-14 16:07:44,303 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432156358] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:44,304 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:44,304 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:07:44,304 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829709666]
[2024-06-14 16:07:44,304 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:44,304 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:07:44,304 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:44,305 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:07:44,305 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:07:44,380 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:07:44,380 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 541 transitions, 11005 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:44,380 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:44,380 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:07:44,381 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:46,649 INFO  L124   PetriNetUnfolderBase]: 4298/6391 cut-off events.
[2024-06-14 16:07:46,649 INFO  L125   PetriNetUnfolderBase]: For 442361/442361 co-relation queries the response was YES.
[2024-06-14 16:07:46,689 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61801 conditions, 6391 events. 4298/6391 cut-off events. For 442361/442361 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 34834 event pairs, 1367 based on Foata normal form. 5/6395 useless extension candidates. Maximal degree in co-relation 61660. Up to 6254 conditions per place. 
[2024-06-14 16:07:46,717 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 515 selfloop transitions, 50 changer transitions 0/568 dead transitions.
[2024-06-14 16:07:46,717 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 568 transitions, 12519 flow
[2024-06-14 16:07:46,718 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:07:46,719 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:07:46,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions.
[2024-06-14 16:07:46,719 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39285714285714285
[2024-06-14 16:07:46,719 INFO  L175             Difference]: Start difference. First operand has 292 places, 541 transitions, 11005 flow. Second operand 7 states and 110 transitions.
[2024-06-14 16:07:46,719 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 568 transitions, 12519 flow
[2024-06-14 16:07:47,492 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 568 transitions, 12307 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-14 16:07:47,500 INFO  L231             Difference]: Finished difference. Result has 291 places, 546 transitions, 11052 flow
[2024-06-14 16:07:47,500 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10795, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11052, PETRI_PLACES=291, PETRI_TRANSITIONS=546}
[2024-06-14 16:07:47,501 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 250 predicate places.
[2024-06-14 16:07:47,501 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 546 transitions, 11052 flow
[2024-06-14 16:07:47,502 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:47,502 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:47,502 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:07:47,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-14 16:07:47,502 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-14 16:07:47,502 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:47,502 INFO  L85        PathProgramCache]: Analyzing trace with hash 875789045, now seen corresponding path program 6 times
[2024-06-14 16:07:47,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:47,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246279899]
[2024-06-14 16:07:47,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:47,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:47,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:55,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:55,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:55,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246279899]
[2024-06-14 16:07:55,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246279899] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:55,469 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:55,470 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:07:55,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418480184]
[2024-06-14 16:07:55,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:55,470 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:07:55,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:55,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:07:55,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:07:55,563 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:07:55,564 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 546 transitions, 11052 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:55,564 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:55,564 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:07:55,564 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:57,613 INFO  L124   PetriNetUnfolderBase]: 4292/6384 cut-off events.
[2024-06-14 16:07:57,613 INFO  L125   PetriNetUnfolderBase]: For 433914/433914 co-relation queries the response was YES.
[2024-06-14 16:07:57,659 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61036 conditions, 6384 events. 4292/6384 cut-off events. For 433914/433914 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 34767 event pairs, 1380 based on Foata normal form. 2/6385 useless extension candidates. Maximal degree in co-relation 60895. Up to 6304 conditions per place. 
[2024-06-14 16:07:57,689 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 534 selfloop transitions, 22 changer transitions 0/559 dead transitions.
[2024-06-14 16:07:57,690 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 559 transitions, 12221 flow
[2024-06-14 16:07:57,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:07:57,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:07:57,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions.
[2024-06-14 16:07:57,692 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37142857142857144
[2024-06-14 16:07:57,692 INFO  L175             Difference]: Start difference. First operand has 291 places, 546 transitions, 11052 flow. Second operand 7 states and 104 transitions.
[2024-06-14 16:07:57,692 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 559 transitions, 12221 flow
[2024-06-14 16:07:58,692 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 559 transitions, 11665 flow, removed 88 selfloop flow, removed 7 redundant places.
[2024-06-14 16:07:58,700 INFO  L231             Difference]: Finished difference. Result has 291 places, 546 transitions, 10548 flow
[2024-06-14 16:07:58,700 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10496, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10548, PETRI_PLACES=291, PETRI_TRANSITIONS=546}
[2024-06-14 16:07:58,700 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 250 predicate places.
[2024-06-14 16:07:58,701 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 546 transitions, 10548 flow
[2024-06-14 16:07:58,701 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:58,701 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:58,701 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:07:58,701 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-14 16:07:58,701 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-14 16:07:58,701 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:58,702 INFO  L85        PathProgramCache]: Analyzing trace with hash 1951310017, now seen corresponding path program 7 times
[2024-06-14 16:07:58,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:58,702 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042917555]
[2024-06-14 16:07:58,702 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:58,702 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:58,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:05,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:05,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:05,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042917555]
[2024-06-14 16:08:05,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042917555] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:05,690 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:05,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:08:05,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176913008]
[2024-06-14 16:08:05,690 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:05,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:08:05,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:05,691 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:08:05,691 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:08:05,815 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:08:05,816 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 546 transitions, 10548 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:05,816 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:05,816 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:08:05,816 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:08,287 INFO  L124   PetriNetUnfolderBase]: 4286/6376 cut-off events.
[2024-06-14 16:08:08,288 INFO  L125   PetriNetUnfolderBase]: For 435489/435489 co-relation queries the response was YES.
[2024-06-14 16:08:08,333 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60507 conditions, 6376 events. 4286/6376 cut-off events. For 435489/435489 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 34713 event pairs, 1380 based on Foata normal form. 2/6377 useless extension candidates. Maximal degree in co-relation 60367. Up to 6272 conditions per place. 
[2024-06-14 16:08:08,363 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 530 selfloop transitions, 31 changer transitions 0/564 dead transitions.
[2024-06-14 16:08:08,363 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 564 transitions, 11787 flow
[2024-06-14 16:08:08,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:08:08,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:08:08,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-14 16:08:08,365 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4041666666666667
[2024-06-14 16:08:08,365 INFO  L175             Difference]: Start difference. First operand has 291 places, 546 transitions, 10548 flow. Second operand 6 states and 97 transitions.
[2024-06-14 16:08:08,366 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 564 transitions, 11787 flow
[2024-06-14 16:08:09,185 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 564 transitions, 11647 flow, removed 48 selfloop flow, removed 5 redundant places.
[2024-06-14 16:08:09,198 INFO  L231             Difference]: Finished difference. Result has 292 places, 546 transitions, 10491 flow
[2024-06-14 16:08:09,198 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10408, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10491, PETRI_PLACES=292, PETRI_TRANSITIONS=546}
[2024-06-14 16:08:09,199 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 251 predicate places.
[2024-06-14 16:08:09,199 INFO  L495      AbstractCegarLoop]: Abstraction has has 292 places, 546 transitions, 10491 flow
[2024-06-14 16:08:09,199 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:09,199 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:09,199 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:09,199 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-14 16:08:09,199 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-14 16:08:09,200 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:09,200 INFO  L85        PathProgramCache]: Analyzing trace with hash 1945596097, now seen corresponding path program 8 times
[2024-06-14 16:08:09,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:09,200 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585713174]
[2024-06-14 16:08:09,200 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:09,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:09,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:17,546 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:17,546 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:17,546 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585713174]
[2024-06-14 16:08:17,546 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585713174] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:17,546 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:17,546 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:08:17,546 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283667636]
[2024-06-14 16:08:17,546 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:17,547 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:08:17,547 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:17,547 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:08:17,547 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:08:17,628 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:08:17,628 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 546 transitions, 10491 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:17,628 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:17,628 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:08:17,628 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:19,809 INFO  L124   PetriNetUnfolderBase]: 4270/6347 cut-off events.
[2024-06-14 16:08:19,809 INFO  L125   PetriNetUnfolderBase]: For 444837/444857 co-relation queries the response was YES.
[2024-06-14 16:08:19,875 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60268 conditions, 6347 events. 4270/6347 cut-off events. For 444837/444857 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 34508 event pairs, 1039 based on Foata normal form. 24/6370 useless extension candidates. Maximal degree in co-relation 60128. Up to 5975 conditions per place. 
[2024-06-14 16:08:19,908 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 482 selfloop transitions, 92 changer transitions 0/577 dead transitions.
[2024-06-14 16:08:19,908 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 577 transitions, 11848 flow
[2024-06-14 16:08:19,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:08:19,910 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:08:19,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-14 16:08:19,910 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-14 16:08:19,910 INFO  L175             Difference]: Start difference. First operand has 292 places, 546 transitions, 10491 flow. Second operand 7 states and 119 transitions.
[2024-06-14 16:08:19,910 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 577 transitions, 11848 flow
[2024-06-14 16:08:20,961 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 577 transitions, 11742 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-14 16:08:20,970 INFO  L231             Difference]: Finished difference. Result has 294 places, 546 transitions, 10609 flow
[2024-06-14 16:08:20,971 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10385, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10609, PETRI_PLACES=294, PETRI_TRANSITIONS=546}
[2024-06-14 16:08:20,971 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 253 predicate places.
[2024-06-14 16:08:20,971 INFO  L495      AbstractCegarLoop]: Abstraction has has 294 places, 546 transitions, 10609 flow
[2024-06-14 16:08:20,971 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:20,971 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:20,972 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:20,972 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-14 16:08:20,972 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-14 16:08:20,973 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:20,973 INFO  L85        PathProgramCache]: Analyzing trace with hash 1957567119, now seen corresponding path program 7 times
[2024-06-14 16:08:20,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:20,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720239252]
[2024-06-14 16:08:20,973 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:20,973 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:21,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:28,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:28,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:28,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720239252]
[2024-06-14 16:08:28,455 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720239252] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:28,455 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:28,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:08:28,456 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074223758]
[2024-06-14 16:08:28,456 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:28,456 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:08:28,456 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:28,460 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:08:28,461 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:08:28,606 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:08:28,607 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 546 transitions, 10609 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:28,607 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:28,607 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:08:28,607 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:30,693 INFO  L124   PetriNetUnfolderBase]: 4377/6503 cut-off events.
[2024-06-14 16:08:30,693 INFO  L125   PetriNetUnfolderBase]: For 478952/478952 co-relation queries the response was YES.
[2024-06-14 16:08:30,742 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62664 conditions, 6503 events. 4377/6503 cut-off events. For 478952/478952 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 35518 event pairs, 1397 based on Foata normal form. 6/6508 useless extension candidates. Maximal degree in co-relation 62523. Up to 6283 conditions per place. 
[2024-06-14 16:08:30,776 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 532 selfloop transitions, 45 changer transitions 0/580 dead transitions.
[2024-06-14 16:08:30,776 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 580 transitions, 12205 flow
[2024-06-14 16:08:30,777 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:08:30,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:08:30,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions.
[2024-06-14 16:08:30,777 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38333333333333336
[2024-06-14 16:08:30,777 INFO  L175             Difference]: Start difference. First operand has 294 places, 546 transitions, 10609 flow. Second operand 9 states and 138 transitions.
[2024-06-14 16:08:30,778 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 580 transitions, 12205 flow
[2024-06-14 16:08:31,748 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 580 transitions, 11955 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-14 16:08:31,757 INFO  L231             Difference]: Finished difference. Result has 298 places, 559 transitions, 10731 flow
[2024-06-14 16:08:31,757 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10361, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10731, PETRI_PLACES=298, PETRI_TRANSITIONS=559}
[2024-06-14 16:08:31,757 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 257 predicate places.
[2024-06-14 16:08:31,758 INFO  L495      AbstractCegarLoop]: Abstraction has has 298 places, 559 transitions, 10731 flow
[2024-06-14 16:08:31,758 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:31,758 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:31,758 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:31,758 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-14 16:08:31,758 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-14 16:08:31,758 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:31,758 INFO  L85        PathProgramCache]: Analyzing trace with hash 1945602669, now seen corresponding path program 8 times
[2024-06-14 16:08:31,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:31,759 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403021483]
[2024-06-14 16:08:31,759 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:31,759 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:31,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:39,075 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:39,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:39,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403021483]
[2024-06-14 16:08:39,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403021483] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:39,075 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:39,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:08:39,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461164098]
[2024-06-14 16:08:39,075 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:39,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:08:39,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:39,076 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:08:39,076 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:08:39,236 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:08:39,237 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 559 transitions, 10731 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:39,237 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:39,237 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:08:39,237 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:41,679 INFO  L124   PetriNetUnfolderBase]: 4783/7054 cut-off events.
[2024-06-14 16:08:41,680 INFO  L125   PetriNetUnfolderBase]: For 564217/564241 co-relation queries the response was YES.
[2024-06-14 16:08:41,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 71273 conditions, 7054 events. 4783/7054 cut-off events. For 564217/564241 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 38531 event pairs, 887 based on Foata normal form. 28/7081 useless extension candidates. Maximal degree in co-relation 71130. Up to 5792 conditions per place. 
[2024-06-14 16:08:41,786 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 468 selfloop transitions, 145 changer transitions 0/616 dead transitions.
[2024-06-14 16:08:41,786 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 616 transitions, 12958 flow
[2024-06-14 16:08:41,787 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:08:41,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:08:41,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-14 16:08:41,787 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44375
[2024-06-14 16:08:41,787 INFO  L175             Difference]: Start difference. First operand has 298 places, 559 transitions, 10731 flow. Second operand 8 states and 142 transitions.
[2024-06-14 16:08:41,788 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 616 transitions, 12958 flow
[2024-06-14 16:08:43,160 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 616 transitions, 12819 flow, removed 61 selfloop flow, removed 3 redundant places.
[2024-06-14 16:08:43,170 INFO  L231             Difference]: Finished difference. Result has 305 places, 581 transitions, 11554 flow
[2024-06-14 16:08:43,170 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10592, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11554, PETRI_PLACES=305, PETRI_TRANSITIONS=581}
[2024-06-14 16:08:43,171 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 264 predicate places.
[2024-06-14 16:08:43,171 INFO  L495      AbstractCegarLoop]: Abstraction has has 305 places, 581 transitions, 11554 flow
[2024-06-14 16:08:43,171 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:43,171 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:43,171 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:43,172 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-14 16:08:43,172 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-14 16:08:43,172 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:43,172 INFO  L85        PathProgramCache]: Analyzing trace with hash -1490500327, now seen corresponding path program 9 times
[2024-06-14 16:08:43,172 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:43,172 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343590651]
[2024-06-14 16:08:43,172 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:43,172 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:43,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:50,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:50,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:50,508 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343590651]
[2024-06-14 16:08:50,508 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343590651] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:50,508 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:50,509 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:08:50,509 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711767794]
[2024-06-14 16:08:50,509 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:50,509 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:08:50,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:50,509 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:08:50,509 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:08:50,669 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:08:50,670 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 581 transitions, 11554 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:50,670 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:50,670 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:08:50,670 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:53,107 INFO  L124   PetriNetUnfolderBase]: 4763/7032 cut-off events.
[2024-06-14 16:08:53,108 INFO  L125   PetriNetUnfolderBase]: For 579349/579353 co-relation queries the response was YES.
[2024-06-14 16:08:53,158 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72296 conditions, 7032 events. 4763/7032 cut-off events. For 579349/579353 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 38528 event pairs, 918 based on Foata normal form. 16/7047 useless extension candidates. Maximal degree in co-relation 72149. Up to 5790 conditions per place. 
[2024-06-14 16:08:53,192 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 444 selfloop transitions, 177 changer transitions 0/624 dead transitions.
[2024-06-14 16:08:53,192 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 624 transitions, 13426 flow
[2024-06-14 16:08:53,193 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:08:53,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:08:53,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 16:08:53,194 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46875
[2024-06-14 16:08:53,194 INFO  L175             Difference]: Start difference. First operand has 305 places, 581 transitions, 11554 flow. Second operand 8 states and 150 transitions.
[2024-06-14 16:08:53,194 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 624 transitions, 13426 flow
[2024-06-14 16:08:54,683 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 624 transitions, 13224 flow, removed 84 selfloop flow, removed 3 redundant places.
[2024-06-14 16:08:54,702 INFO  L231             Difference]: Finished difference. Result has 312 places, 585 transitions, 12051 flow
[2024-06-14 16:08:54,702 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11368, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12051, PETRI_PLACES=312, PETRI_TRANSITIONS=585}
[2024-06-14 16:08:54,702 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 271 predicate places.
[2024-06-14 16:08:54,703 INFO  L495      AbstractCegarLoop]: Abstraction has has 312 places, 585 transitions, 12051 flow
[2024-06-14 16:08:54,703 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:54,703 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:54,703 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:54,703 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-14 16:08:54,703 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-14 16:08:54,703 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:54,704 INFO  L85        PathProgramCache]: Analyzing trace with hash 1945961091, now seen corresponding path program 1 times
[2024-06-14 16:08:54,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:54,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98323987]
[2024-06-14 16:08:54,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:54,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:54,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:02,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:02,053 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:02,053 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98323987]
[2024-06-14 16:09:02,053 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98323987] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:02,054 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:02,054 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:09:02,054 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279329873]
[2024-06-14 16:09:02,054 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:02,054 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:09:02,054 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:02,054 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:09:02,054 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:09:02,219 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:09:02,220 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 585 transitions, 12051 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:02,220 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:02,220 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:09:02,220 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:04,571 INFO  L124   PetriNetUnfolderBase]: 4760/7034 cut-off events.
[2024-06-14 16:09:04,571 INFO  L125   PetriNetUnfolderBase]: For 580669/580669 co-relation queries the response was YES.
[2024-06-14 16:09:04,622 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 73447 conditions, 7034 events. 4760/7034 cut-off events. For 580669/580669 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 38578 event pairs, 1496 based on Foata normal form. 1/7034 useless extension candidates. Maximal degree in co-relation 73296. Up to 6961 conditions per place. 
[2024-06-14 16:09:04,657 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 572 selfloop transitions, 19 changer transitions 0/594 dead transitions.
[2024-06-14 16:09:04,657 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 594 transitions, 13267 flow
[2024-06-14 16:09:04,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:09:04,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:09:04,658 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions.
[2024-06-14 16:09:04,658 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375
[2024-06-14 16:09:04,658 INFO  L175             Difference]: Start difference. First operand has 312 places, 585 transitions, 12051 flow. Second operand 6 states and 90 transitions.
[2024-06-14 16:09:04,658 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 594 transitions, 13267 flow
[2024-06-14 16:09:06,163 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 594 transitions, 13000 flow, removed 60 selfloop flow, removed 4 redundant places.
[2024-06-14 16:09:06,172 INFO  L231             Difference]: Finished difference. Result has 314 places, 585 transitions, 11832 flow
[2024-06-14 16:09:06,172 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11784, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11832, PETRI_PLACES=314, PETRI_TRANSITIONS=585}
[2024-06-14 16:09:06,173 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 273 predicate places.
[2024-06-14 16:09:06,173 INFO  L495      AbstractCegarLoop]: Abstraction has has 314 places, 585 transitions, 11832 flow
[2024-06-14 16:09:06,173 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:06,173 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:06,173 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:06,173 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-14 16:09:06,173 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-14 16:09:06,174 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:06,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 1945592129, now seen corresponding path program 6 times
[2024-06-14 16:09:06,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:06,174 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440882054]
[2024-06-14 16:09:06,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:06,175 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:06,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:14,750 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:14,750 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:14,751 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440882054]
[2024-06-14 16:09:14,751 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440882054] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:14,751 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:14,751 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:09:14,751 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829438343]
[2024-06-14 16:09:14,751 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:14,751 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:09:14,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:14,752 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:09:14,752 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:09:14,851 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:09:14,852 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 585 transitions, 11832 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:14,852 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:14,852 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:09:14,852 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:17,360 INFO  L124   PetriNetUnfolderBase]: 4743/7005 cut-off events.
[2024-06-14 16:09:17,361 INFO  L125   PetriNetUnfolderBase]: For 587588/587592 co-relation queries the response was YES.
[2024-06-14 16:09:17,410 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72008 conditions, 7005 events. 4743/7005 cut-off events. For 587588/587592 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 38410 event pairs, 1119 based on Foata normal form. 7/7011 useless extension candidates. Maximal degree in co-relation 71856. Up to 6496 conditions per place. 
[2024-06-14 16:09:17,443 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 496 selfloop transitions, 122 changer transitions 0/621 dead transitions.
[2024-06-14 16:09:17,443 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 621 transitions, 13270 flow
[2024-06-14 16:09:17,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:09:17,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:09:17,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-14 16:09:17,445 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44375
[2024-06-14 16:09:17,445 INFO  L175             Difference]: Start difference. First operand has 314 places, 585 transitions, 11832 flow. Second operand 8 states and 142 transitions.
[2024-06-14 16:09:17,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 621 transitions, 13270 flow
[2024-06-14 16:09:18,728 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 621 transitions, 13200 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-14 16:09:18,738 INFO  L231             Difference]: Finished difference. Result has 317 places, 585 transitions, 12040 flow
[2024-06-14 16:09:18,738 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11762, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12040, PETRI_PLACES=317, PETRI_TRANSITIONS=585}
[2024-06-14 16:09:18,739 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 276 predicate places.
[2024-06-14 16:09:18,739 INFO  L495      AbstractCegarLoop]: Abstraction has has 317 places, 585 transitions, 12040 flow
[2024-06-14 16:09:18,739 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:18,739 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:18,739 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:18,739 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-14 16:09:18,739 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-14 16:09:18,740 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:18,740 INFO  L85        PathProgramCache]: Analyzing trace with hash 1827490463, now seen corresponding path program 1 times
[2024-06-14 16:09:18,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:18,740 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024657881]
[2024-06-14 16:09:18,740 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:18,740 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:18,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:27,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:27,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:27,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024657881]
[2024-06-14 16:09:27,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024657881] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:27,523 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:27,523 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:09:27,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626031455]
[2024-06-14 16:09:27,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:27,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:09:27,524 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:27,524 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:09:27,524 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:09:27,627 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:09:27,627 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 585 transitions, 12040 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:27,627 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:27,627 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:09:27,627 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:30,119 INFO  L124   PetriNetUnfolderBase]: 4751/7023 cut-off events.
[2024-06-14 16:09:30,120 INFO  L125   PetriNetUnfolderBase]: For 593962/593962 co-relation queries the response was YES.
[2024-06-14 16:09:30,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72706 conditions, 7023 events. 4751/7023 cut-off events. For 593962/593962 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 38453 event pairs, 1444 based on Foata normal form. 2/7024 useless extension candidates. Maximal degree in co-relation 72553. Up to 6895 conditions per place. 
[2024-06-14 16:09:30,205 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 577 selfloop transitions, 27 changer transitions 0/607 dead transitions.
[2024-06-14 16:09:30,205 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 607 transitions, 13514 flow
[2024-06-14 16:09:30,206 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:09:30,207 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:09:30,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-14 16:09:30,207 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3892857142857143
[2024-06-14 16:09:30,207 INFO  L175             Difference]: Start difference. First operand has 317 places, 585 transitions, 12040 flow. Second operand 7 states and 109 transitions.
[2024-06-14 16:09:30,207 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 607 transitions, 13514 flow
[2024-06-14 16:09:31,348 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 607 transitions, 13282 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-06-14 16:09:31,357 INFO  L231             Difference]: Finished difference. Result has 318 places, 589 transitions, 11951 flow
[2024-06-14 16:09:31,357 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11808, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11951, PETRI_PLACES=318, PETRI_TRANSITIONS=589}
[2024-06-14 16:09:31,358 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 277 predicate places.
[2024-06-14 16:09:31,358 INFO  L495      AbstractCegarLoop]: Abstraction has has 318 places, 589 transitions, 11951 flow
[2024-06-14 16:09:31,358 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:31,358 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:31,358 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:31,358 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-14 16:09:31,358 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-14 16:09:31,359 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:31,359 INFO  L85        PathProgramCache]: Analyzing trace with hash 1940459977, now seen corresponding path program 2 times
[2024-06-14 16:09:31,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:31,359 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648720408]
[2024-06-14 16:09:31,359 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:31,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:31,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:40,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:40,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:40,210 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648720408]
[2024-06-14 16:09:40,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648720408] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:40,210 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:40,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:09:40,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501991694]
[2024-06-14 16:09:40,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:40,210 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:09:40,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:40,211 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:09:40,211 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:09:40,318 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:09:40,318 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 589 transitions, 11951 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:40,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:40,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:09:40,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:43,345 INFO  L124   PetriNetUnfolderBase]: 4759/7034 cut-off events.
[2024-06-14 16:09:43,345 INFO  L125   PetriNetUnfolderBase]: For 607392/607392 co-relation queries the response was YES.
[2024-06-14 16:09:43,397 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72793 conditions, 7034 events. 4759/7034 cut-off events. For 607392/607392 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 38652 event pairs, 1489 based on Foata normal form. 2/7035 useless extension candidates. Maximal degree in co-relation 72639. Up to 6938 conditions per place. 
[2024-06-14 16:09:43,430 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 576 selfloop transitions, 25 changer transitions 0/604 dead transitions.
[2024-06-14 16:09:43,430 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 604 transitions, 13245 flow
[2024-06-14 16:09:43,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:09:43,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:09:43,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions.
[2024-06-14 16:09:43,432 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375
[2024-06-14 16:09:43,432 INFO  L175             Difference]: Start difference. First operand has 318 places, 589 transitions, 11951 flow. Second operand 7 states and 105 transitions.
[2024-06-14 16:09:43,432 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 604 transitions, 13245 flow
[2024-06-14 16:09:44,894 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 604 transitions, 13137 flow, removed 42 selfloop flow, removed 3 redundant places.
[2024-06-14 16:09:44,903 INFO  L231             Difference]: Finished difference. Result has 322 places, 591 transitions, 11946 flow
[2024-06-14 16:09:44,904 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11867, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11946, PETRI_PLACES=322, PETRI_TRANSITIONS=591}
[2024-06-14 16:09:44,904 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 281 predicate places.
[2024-06-14 16:09:44,904 INFO  L495      AbstractCegarLoop]: Abstraction has has 322 places, 591 transitions, 11946 flow
[2024-06-14 16:09:44,904 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:44,904 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:44,904 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:44,905 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-14 16:09:44,905 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-14 16:09:44,905 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:44,905 INFO  L85        PathProgramCache]: Analyzing trace with hash 1951317953, now seen corresponding path program 3 times
[2024-06-14 16:09:44,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:44,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441274864]
[2024-06-14 16:09:44,905 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:44,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:44,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:53,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-14 16:09:53,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:53,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441274864]
[2024-06-14 16:09:53,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441274864] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:53,494 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:53,495 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:09:53,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587524861]
[2024-06-14 16:09:53,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:53,495 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:09:53,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:53,496 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:09:53,496 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:09:53,609 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:09:53,609 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 591 transitions, 11946 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:53,610 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:53,610 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:09:53,610 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:56,714 INFO  L124   PetriNetUnfolderBase]: 4754/7027 cut-off events.
[2024-06-14 16:09:56,715 INFO  L125   PetriNetUnfolderBase]: For 619327/619327 co-relation queries the response was YES.
[2024-06-14 16:09:56,782 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72798 conditions, 7027 events. 4754/7027 cut-off events. For 619327/619327 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 38541 event pairs, 1449 based on Foata normal form. 2/7028 useless extension candidates. Maximal degree in co-relation 72642. Up to 6921 conditions per place. 
[2024-06-14 16:09:56,828 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 581 selfloop transitions, 22 changer transitions 0/606 dead transitions.
[2024-06-14 16:09:56,828 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 606 transitions, 13214 flow
[2024-06-14 16:09:56,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:09:56,829 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:09:56,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-14 16:09:56,830 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4041666666666667
[2024-06-14 16:09:56,830 INFO  L175             Difference]: Start difference. First operand has 322 places, 591 transitions, 11946 flow. Second operand 6 states and 97 transitions.
[2024-06-14 16:09:56,830 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 606 transitions, 13214 flow
[2024-06-14 16:09:58,683 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 606 transitions, 13145 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-14 16:09:58,692 INFO  L231             Difference]: Finished difference. Result has 323 places, 591 transitions, 11929 flow
[2024-06-14 16:09:58,692 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11877, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11929, PETRI_PLACES=323, PETRI_TRANSITIONS=591}
[2024-06-14 16:09:58,693 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 282 predicate places.
[2024-06-14 16:09:58,693 INFO  L495      AbstractCegarLoop]: Abstraction has has 323 places, 591 transitions, 11929 flow
[2024-06-14 16:09:58,693 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:58,693 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:58,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-14 16:09:58,693 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-14 16:09:58,694 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-14 16:09:58,694 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:58,694 INFO  L85        PathProgramCache]: Analyzing trace with hash -2039687003, now seen corresponding path program 1 times
[2024-06-14 16:09:58,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:58,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399142665]
[2024-06-14 16:09:58,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:58,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:58,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:07,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:07,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:07,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399142665]
[2024-06-14 16:10:07,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399142665] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:07,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:07,676 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:10:07,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780440671]
[2024-06-14 16:10:07,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:07,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:10:07,678 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:07,678 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:10:07,678 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:10:07,842 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:10:07,843 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 591 transitions, 11929 flow. Second operand  has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-14 16:10:07,843 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:07,843 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:10:07,843 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:11,095 INFO  L124   PetriNetUnfolderBase]: 5473/8111 cut-off events.
[2024-06-14 16:10:11,095 INFO  L125   PetriNetUnfolderBase]: For 834096/834113 co-relation queries the response was YES.
[2024-06-14 16:10:11,346 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85329 conditions, 8111 events. 5473/8111 cut-off events. For 834096/834113 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 45477 event pairs, 834 based on Foata normal form. 26/8136 useless extension candidates. Maximal degree in co-relation 85172. Up to 5987 conditions per place. 
[2024-06-14 16:10:11,385 INFO  L140   encePairwiseOnDemand]: 24/40 looper letters, 553 selfloop transitions, 242 changer transitions 0/798 dead transitions.
[2024-06-14 16:10:11,385 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 798 transitions, 17404 flow
[2024-06-14 16:10:11,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:10:11,386 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:10:11,387 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions.
[2024-06-14 16:10:11,387 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4925
[2024-06-14 16:10:11,388 INFO  L175             Difference]: Start difference. First operand has 323 places, 591 transitions, 11929 flow. Second operand 10 states and 197 transitions.
[2024-06-14 16:10:11,388 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 798 transitions, 17404 flow
[2024-06-14 16:10:12,988 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 798 transitions, 17353 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-14 16:10:12,999 INFO  L231             Difference]: Finished difference. Result has 333 places, 719 transitions, 15479 flow
[2024-06-14 16:10:13,000 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11878, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15479, PETRI_PLACES=333, PETRI_TRANSITIONS=719}
[2024-06-14 16:10:13,000 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 292 predicate places.
[2024-06-14 16:10:13,008 INFO  L495      AbstractCegarLoop]: Abstraction has has 333 places, 719 transitions, 15479 flow
[2024-06-14 16:10:13,008 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-14 16:10:13,008 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:13,008 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-14 16:10:13,008 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-14 16:10:13,008 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-14 16:10:13,009 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:13,009 INFO  L85        PathProgramCache]: Analyzing trace with hash 2013205829, now seen corresponding path program 2 times
[2024-06-14 16:10:13,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:13,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359413620]
[2024-06-14 16:10:13,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:13,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:13,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:25,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:25,076 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:25,076 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359413620]
[2024-06-14 16:10:25,076 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359413620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:25,076 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:25,076 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:10:25,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002720024]
[2024-06-14 16:10:25,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:25,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:10:25,077 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:25,077 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:10:25,077 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:10:25,355 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-14 16:10:25,356 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 719 transitions, 15479 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:25,356 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:25,356 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-14 16:10:25,356 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:29,153 INFO  L124   PetriNetUnfolderBase]: 6319/9534 cut-off events.
[2024-06-14 16:10:29,153 INFO  L125   PetriNetUnfolderBase]: For 1286120/1286221 co-relation queries the response was YES.
[2024-06-14 16:10:29,233 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107213 conditions, 9534 events. 6319/9534 cut-off events. For 1286120/1286221 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 56763 event pairs, 1236 based on Foata normal form. 103/9536 useless extension candidates. Maximal degree in co-relation 107050. Up to 4588 conditions per place. 
[2024-06-14 16:10:29,285 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 306 selfloop transitions, 397 changer transitions 30/816 dead transitions.
[2024-06-14 16:10:29,285 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 816 transitions, 18420 flow
[2024-06-14 16:10:29,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:10:29,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:10:29,286 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions.
[2024-06-14 16:10:29,286 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5166666666666667
[2024-06-14 16:10:29,286 INFO  L175             Difference]: Start difference. First operand has 333 places, 719 transitions, 15479 flow. Second operand 9 states and 186 transitions.
[2024-06-14 16:10:29,286 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 816 transitions, 18420 flow
[2024-06-14 16:10:31,996 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 816 transitions, 18149 flow, removed 133 selfloop flow, removed 2 redundant places.
[2024-06-14 16:10:32,009 INFO  L231             Difference]: Finished difference. Result has 341 places, 717 transitions, 15939 flow
[2024-06-14 16:10:32,009 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=15294, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=390, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15939, PETRI_PLACES=341, PETRI_TRANSITIONS=717}
[2024-06-14 16:10:32,009 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 300 predicate places.
[2024-06-14 16:10:32,010 INFO  L495      AbstractCegarLoop]: Abstraction has has 341 places, 717 transitions, 15939 flow
[2024-06-14 16:10:32,010 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:32,010 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:32,010 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-14 16:10:32,010 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-14 16:10:32,010 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-14 16:10:32,010 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:32,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 2052191429, now seen corresponding path program 3 times
[2024-06-14 16:10:32,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:32,011 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021625721]
[2024-06-14 16:10:32,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:32,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:32,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:43,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:43,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:43,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021625721]
[2024-06-14 16:10:43,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021625721] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:43,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:43,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:10:43,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524613602]
[2024-06-14 16:10:43,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:43,590 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:10:43,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:43,591 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:10:43,591 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:10:43,737 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:10:43,738 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 717 transitions, 15939 flow. Second operand  has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-14 16:10:43,738 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:43,738 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:10:43,738 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:47,915 INFO  L124   PetriNetUnfolderBase]: 6397/9568 cut-off events.
[2024-06-14 16:10:47,915 INFO  L125   PetriNetUnfolderBase]: For 1158985/1159020 co-relation queries the response was YES.
[2024-06-14 16:10:47,984 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107259 conditions, 9568 events. 6397/9568 cut-off events. For 1158985/1159020 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 55813 event pairs, 1348 based on Foata normal form. 52/9619 useless extension candidates. Maximal degree in co-relation 107093. Up to 8288 conditions per place. 
[2024-06-14 16:10:48,034 INFO  L140   encePairwiseOnDemand]: 24/40 looper letters, 548 selfloop transitions, 256 changer transitions 0/807 dead transitions.
[2024-06-14 16:10:48,034 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 807 transitions, 19300 flow
[2024-06-14 16:10:48,034 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:10:48,035 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:10:48,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions.
[2024-06-14 16:10:48,035 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46
[2024-06-14 16:10:48,035 INFO  L175             Difference]: Start difference. First operand has 341 places, 717 transitions, 15939 flow. Second operand 10 states and 184 transitions.
[2024-06-14 16:10:48,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 807 transitions, 19300 flow
[2024-06-14 16:10:50,979 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 807 transitions, 18713 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-14 16:10:50,997 INFO  L231             Difference]: Finished difference. Result has 349 places, 746 transitions, 16666 flow
[2024-06-14 16:10:50,998 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=15376, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16666, PETRI_PLACES=349, PETRI_TRANSITIONS=746}
[2024-06-14 16:10:50,998 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 308 predicate places.
[2024-06-14 16:10:50,999 INFO  L495      AbstractCegarLoop]: Abstraction has has 349 places, 746 transitions, 16666 flow
[2024-06-14 16:10:50,999 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-14 16:10:50,999 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:50,999 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-14 16:10:50,999 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-14 16:10:50,999 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-14 16:10:51,000 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:51,000 INFO  L85        PathProgramCache]: Analyzing trace with hash -1744443353, now seen corresponding path program 1 times
[2024-06-14 16:10:51,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:51,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393152961]
[2024-06-14 16:10:51,000 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:51,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:51,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:01,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:01,556 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:01,556 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393152961]
[2024-06-14 16:11:01,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393152961] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:01,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:01,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:11:01,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886662573]
[2024-06-14 16:11:01,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:01,557 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:11:01,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:01,557 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:11:01,557 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:11:01,675 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:11:01,675 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 746 transitions, 16666 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:01,675 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:01,675 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:11:01,676 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:05,416 INFO  L124   PetriNetUnfolderBase]: 6407/9583 cut-off events.
[2024-06-14 16:11:05,417 INFO  L125   PetriNetUnfolderBase]: For 1139810/1139832 co-relation queries the response was YES.
[2024-06-14 16:11:05,518 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109834 conditions, 9583 events. 6407/9583 cut-off events. For 1139810/1139832 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 55761 event pairs, 1744 based on Foata normal form. 24/9606 useless extension candidates. Maximal degree in co-relation 109663. Up to 9207 conditions per place. 
[2024-06-14 16:11:05,573 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 666 selfloop transitions, 115 changer transitions 0/784 dead transitions.
[2024-06-14 16:11:05,574 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 784 transitions, 18885 flow
[2024-06-14 16:11:05,574 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:11:05,574 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:11:05,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-14 16:11:05,588 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-14 16:11:05,588 INFO  L175             Difference]: Start difference. First operand has 349 places, 746 transitions, 16666 flow. Second operand 9 states and 149 transitions.
[2024-06-14 16:11:05,588 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 784 transitions, 18885 flow
[2024-06-14 16:11:08,484 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 784 transitions, 18428 flow, removed 35 selfloop flow, removed 5 redundant places.
[2024-06-14 16:11:08,498 INFO  L231             Difference]: Finished difference. Result has 354 places, 752 transitions, 16674 flow
[2024-06-14 16:11:08,498 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=16217, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16674, PETRI_PLACES=354, PETRI_TRANSITIONS=752}
[2024-06-14 16:11:08,502 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 313 predicate places.
[2024-06-14 16:11:08,502 INFO  L495      AbstractCegarLoop]: Abstraction has has 354 places, 752 transitions, 16674 flow
[2024-06-14 16:11:08,502 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:08,502 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:08,502 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-14 16:11:08,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-14 16:11:08,502 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-14 16:11:08,503 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:08,503 INFO  L85        PathProgramCache]: Analyzing trace with hash 1339942757, now seen corresponding path program 4 times
[2024-06-14 16:11:08,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:08,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428455594]
[2024-06-14 16:11:08,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:08,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:08,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:21,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:21,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:21,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428455594]
[2024-06-14 16:11:21,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428455594] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:21,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:21,676 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:11:21,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679846480]
[2024-06-14 16:11:21,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:21,676 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:11:21,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:21,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:11:21,677 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:11:21,826 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:11:21,827 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 752 transitions, 16674 flow. Second operand  has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-14 16:11:21,827 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:21,827 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:11:21,827 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:25,535 INFO  L124   PetriNetUnfolderBase]: 6465/9677 cut-off events.
[2024-06-14 16:11:25,535 INFO  L125   PetriNetUnfolderBase]: For 1186878/1186900 co-relation queries the response was YES.
[2024-06-14 16:11:25,630 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110016 conditions, 9677 events. 6465/9677 cut-off events. For 1186878/1186900 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 56513 event pairs, 1746 based on Foata normal form. 36/9712 useless extension candidates. Maximal degree in co-relation 109843. Up to 9148 conditions per place. 
[2024-06-14 16:11:25,685 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 673 selfloop transitions, 142 changer transitions 0/818 dead transitions.
[2024-06-14 16:11:25,685 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 818 transitions, 19402 flow
[2024-06-14 16:11:25,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:11:25,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:11:25,689 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions.
[2024-06-14 16:11:25,690 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41363636363636364
[2024-06-14 16:11:25,690 INFO  L175             Difference]: Start difference. First operand has 354 places, 752 transitions, 16674 flow. Second operand 11 states and 182 transitions.
[2024-06-14 16:11:25,690 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 818 transitions, 19402 flow
[2024-06-14 16:11:28,920 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 818 transitions, 19191 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-14 16:11:28,933 INFO  L231             Difference]: Finished difference. Result has 361 places, 773 transitions, 17326 flow
[2024-06-14 16:11:28,934 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=16463, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17326, PETRI_PLACES=361, PETRI_TRANSITIONS=773}
[2024-06-14 16:11:28,934 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 320 predicate places.
[2024-06-14 16:11:28,934 INFO  L495      AbstractCegarLoop]: Abstraction has has 361 places, 773 transitions, 17326 flow
[2024-06-14 16:11:28,934 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-14 16:11:28,934 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:28,934 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-14 16:11:28,934 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-14 16:11:28,935 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-14 16:11:28,935 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:28,935 INFO  L85        PathProgramCache]: Analyzing trace with hash 1526260427, now seen corresponding path program 2 times
[2024-06-14 16:11:28,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:28,935 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516101424]
[2024-06-14 16:11:28,935 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:28,935 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:28,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:38,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:38,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:38,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516101424]
[2024-06-14 16:11:38,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516101424] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:38,992 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:38,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:11:38,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202083597]
[2024-06-14 16:11:38,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:38,993 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:11:38,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:38,993 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:11:38,994 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:11:39,119 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:11:39,120 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 773 transitions, 17326 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:39,120 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:39,120 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:11:39,120 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:43,520 INFO  L124   PetriNetUnfolderBase]: 6469/9686 cut-off events.
[2024-06-14 16:11:43,521 INFO  L125   PetriNetUnfolderBase]: For 1190566/1190592 co-relation queries the response was YES.
[2024-06-14 16:11:43,602 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110896 conditions, 9686 events. 6469/9686 cut-off events. For 1190566/1190592 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 56483 event pairs, 1778 based on Foata normal form. 28/9713 useless extension candidates. Maximal degree in co-relation 110720. Up to 9190 conditions per place. 
[2024-06-14 16:11:43,653 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 664 selfloop transitions, 142 changer transitions 0/809 dead transitions.
[2024-06-14 16:11:43,653 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 809 transitions, 19467 flow
[2024-06-14 16:11:43,655 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:11:43,655 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:11:43,655 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-14 16:11:43,655 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41944444444444445
[2024-06-14 16:11:43,655 INFO  L175             Difference]: Start difference. First operand has 361 places, 773 transitions, 17326 flow. Second operand 9 states and 151 transitions.
[2024-06-14 16:11:43,655 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 809 transitions, 19467 flow
[2024-06-14 16:11:46,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 809 transitions, 19165 flow, removed 34 selfloop flow, removed 6 redundant places.
[2024-06-14 16:11:46,525 INFO  L231             Difference]: Finished difference. Result has 364 places, 778 transitions, 17426 flow
[2024-06-14 16:11:46,526 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=17034, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17426, PETRI_PLACES=364, PETRI_TRANSITIONS=778}
[2024-06-14 16:11:46,526 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 323 predicate places.
[2024-06-14 16:11:46,526 INFO  L495      AbstractCegarLoop]: Abstraction has has 364 places, 778 transitions, 17426 flow
[2024-06-14 16:11:46,526 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:46,526 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:46,527 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-14 16:11:46,527 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-14 16:11:46,527 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-14 16:11:46,527 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:46,527 INFO  L85        PathProgramCache]: Analyzing trace with hash 345476380, now seen corresponding path program 1 times
[2024-06-14 16:11:46,527 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:46,527 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605861365]
[2024-06-14 16:11:46,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:46,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:46,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:56,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:56,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:56,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605861365]
[2024-06-14 16:11:56,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605861365] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:56,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:56,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:11:56,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742597525]
[2024-06-14 16:11:56,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:56,904 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:11:56,904 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:56,904 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:11:56,905 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:11:57,018 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:11:57,018 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 778 transitions, 17426 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:57,018 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:57,018 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:11:57,018 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:01,698 INFO  L124   PetriNetUnfolderBase]: 6693/9997 cut-off events.
[2024-06-14 16:12:01,699 INFO  L125   PetriNetUnfolderBase]: For 1294117/1294162 co-relation queries the response was YES.
[2024-06-14 16:12:01,785 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 115299 conditions, 9997 events. 6693/9997 cut-off events. For 1294117/1294162 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 58214 event pairs, 1534 based on Foata normal form. 52/10048 useless extension candidates. Maximal degree in co-relation 115122. Up to 6422 conditions per place. 
[2024-06-14 16:12:01,836 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 513 selfloop transitions, 358 changer transitions 0/874 dead transitions.
[2024-06-14 16:12:01,836 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 874 transitions, 21126 flow
[2024-06-14 16:12:01,837 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:12:01,837 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:12:01,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 16:12:01,837 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-14 16:12:01,837 INFO  L175             Difference]: Start difference. First operand has 364 places, 778 transitions, 17426 flow. Second operand 9 states and 171 transitions.
[2024-06-14 16:12:01,837 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 874 transitions, 21126 flow
[2024-06-14 16:12:04,718 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 874 transitions, 20751 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-06-14 16:12:04,734 INFO  L231             Difference]: Finished difference. Result has 367 places, 798 transitions, 18335 flow
[2024-06-14 16:12:04,735 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=17051, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18335, PETRI_PLACES=367, PETRI_TRANSITIONS=798}
[2024-06-14 16:12:04,735 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 326 predicate places.
[2024-06-14 16:12:04,735 INFO  L495      AbstractCegarLoop]: Abstraction has has 367 places, 798 transitions, 18335 flow
[2024-06-14 16:12:04,735 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:04,735 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:04,735 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-14 16:12:04,736 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-14 16:12:04,736 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-14 16:12:04,736 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:04,736 INFO  L85        PathProgramCache]: Analyzing trace with hash 1576650403, now seen corresponding path program 3 times
[2024-06-14 16:12:04,736 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:04,736 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038047798]
[2024-06-14 16:12:04,736 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:04,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:04,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:15,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:15,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:15,111 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038047798]
[2024-06-14 16:12:15,111 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038047798] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:15,111 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:15,111 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:12:15,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251221452]
[2024-06-14 16:12:15,111 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:15,112 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:12:15,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:15,112 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:12:15,112 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:12:15,219 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-14 16:12:15,219 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 798 transitions, 18335 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:15,219 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:15,219 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-14 16:12:15,219 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:19,374 INFO  L124   PetriNetUnfolderBase]: 6703/10011 cut-off events.
[2024-06-14 16:12:19,374 INFO  L125   PetriNetUnfolderBase]: For 1314876/1314918 co-relation queries the response was YES.
[2024-06-14 16:12:19,463 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 118115 conditions, 10011 events. 6703/10011 cut-off events. For 1314876/1314918 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 58502 event pairs, 1802 based on Foata normal form. 44/10054 useless extension candidates. Maximal degree in co-relation 117936. Up to 9512 conditions per place. 
[2024-06-14 16:12:19,518 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 690 selfloop transitions, 139 changer transitions 0/832 dead transitions.
[2024-06-14 16:12:19,518 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 832 transitions, 20553 flow
[2024-06-14 16:12:19,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:12:19,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:12:19,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-14 16:12:19,521 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-14 16:12:19,521 INFO  L175             Difference]: Start difference. First operand has 367 places, 798 transitions, 18335 flow. Second operand 9 states and 150 transitions.
[2024-06-14 16:12:19,521 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 832 transitions, 20553 flow
Killed by 15