./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.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/safe030_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe030_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-04 18:09:56,790 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 18:09:56,896 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 18:09:56,901 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 18:09:56,901 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 18:09:56,931 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 18:09:56,935 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 18:09:56,935 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 18:09:56,936 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 18:09:56,940 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 18:09:56,940 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 18:09:56,940 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 18:09:56,942 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 18:09:56,943 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 18:09:56,943 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 18:09:56,943 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 18:09:56,944 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 18:09:56,944 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 18:09:56,944 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 18:09:56,945 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 18:09:56,945 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 18:09:56,946 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 18:09:56,946 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 18:09:56,946 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 18:09:56,946 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 18:09:56,947 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 18:09:56,947 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 18:09:56,947 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 18:09:56,952 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 18:09:56,952 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 18:09:56,952 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 18:09:56,953 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 18:09:56,953 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:09:56,953 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 18:09:56,954 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 18:09:56,954 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 18:09:56,954 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 18:09:56,954 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 18:09:56,955 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 18:09:56,955 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 18:09:56,955 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 18:09:56,955 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 18:09:56,956 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 18:09:56,956 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-04 18:09:57,200 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 18:09:57,224 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 18:09:57,226 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 18:09:57,227 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 18:09:57,228 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 18:09:57,229 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/safe030_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml
[2024-06-04 18:09:57,447 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 18:09:57,448 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 18:09:57,448 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-04 18:09:58,568 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 18:09:58,799 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 18:09:58,799 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-04 18:09:58,814 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88eac2316/a85bf71a05624c31b2fe0ca9ed7d77a7/FLAG68351dcff
[2024-06-04 18:09:58,826 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88eac2316/a85bf71a05624c31b2fe0ca9ed7d77a7
[2024-06-04 18:09:58,826 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 18:09:58,827 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 18:09:58,831 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 18:09:58,831 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 18:09:58,836 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 18:09:58,836 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:09:57" (1/2) ...
[2024-06-04 18:09:58,838 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fdc1f4c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:09:58, skipping insertion in model container
[2024-06-04 18:09:58,838 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:09:57" (1/2) ...
[2024-06-04 18:09:58,839 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@74931d29 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:09:58, skipping insertion in model container
[2024-06-04 18:09:58,840 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:09:58" (2/2) ...
[2024-06-04 18:09:58,840 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fdc1f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:58, skipping insertion in model container
[2024-06-04 18:09:58,840 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:09:58" (2/2) ...
[2024-06-04 18:09:58,840 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 18:09:58,939 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 18:09:58,941 INFO  L97    edCorrectnessWitness]: Location invariant before [L822-L822] ((((((((((((((((! multithreaded || z$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$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 )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$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 )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$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 )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))
[2024-06-04 18:09:58,942 INFO  L97    edCorrectnessWitness]: Location invariant before [L819-L819] ((((((((((((((((! multithreaded || z$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$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 )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$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 )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$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 )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))
[2024-06-04 18:09:58,942 INFO  L97    edCorrectnessWitness]: Location invariant before [L821-L821] ((((((((((((((((! multithreaded || z$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$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 )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$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 )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$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 )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))
[2024-06-04 18:09:58,943 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 18:09:58,943 INFO  L106   edCorrectnessWitness]: ghost_update [L817-L817] multithreaded = 1;
[2024-06-04 18:09:59,008 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 18:09:59,435 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:09:59,451 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-04 18:09:59,793 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:09:59,835 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 18:09:59,837 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59 WrapperNode
[2024-06-04 18:09:59,837 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 18:09:59,838 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 18:09:59,838 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 18:09:59,838 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 18:09:59,845 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (1/1) ...
[2024-06-04 18:09:59,894 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (1/1) ...
[2024-06-04 18:10:00,005 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142
[2024-06-04 18:10:00,005 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 18:10:00,007 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 18:10:00,007 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 18:10:00,007 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 18:10:00,018 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (1/1) ...
[2024-06-04 18:10:00,019 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (1/1) ...
[2024-06-04 18:10:00,050 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (1/1) ...
[2024-06-04 18:10:00,091 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-04 18:10:00,092 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (1/1) ...
[2024-06-04 18:10:00,092 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (1/1) ...
[2024-06-04 18:10:00,125 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (1/1) ...
[2024-06-04 18:10:00,128 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (1/1) ...
[2024-06-04 18:10:00,140 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (1/1) ...
[2024-06-04 18:10:00,146 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (1/1) ...
[2024-06-04 18:10:00,166 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 18:10:00,167 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 18:10:00,168 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 18:10:00,168 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 18:10:00,169 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (1/1) ...
[2024-06-04 18:10:00,174 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:10:00,182 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 18:10:00,201 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-04 18:10:00,220 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-04 18:10:00,241 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 18:10:00,241 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 18:10:00,241 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 18:10:00,241 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 18:10:00,242 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 18:10:00,242 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 18:10:00,242 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 18:10:00,242 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 18:10:00,243 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 18:10:00,243 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 18:10:00,243 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 18:10:00,243 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 18:10:00,245 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-04 18:10:00,396 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 18:10:00,397 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 18:10:01,576 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 18:10:01,578 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 18:10:01,923 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 18:10:01,924 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 18:10:01,925 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:10:01 BoogieIcfgContainer
[2024-06-04 18:10:01,925 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 18:10:01,928 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 18:10:01,928 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 18:10:01,931 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 18:10:01,931 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:09:57" (1/4) ...
[2024-06-04 18:10:01,932 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e39f2d7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:10:01, skipping insertion in model container
[2024-06-04 18:10:01,932 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 06:09:58" (2/4) ...
[2024-06-04 18:10:01,933 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e39f2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:10:01, skipping insertion in model container
[2024-06-04 18:10:01,933 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:59" (3/4) ...
[2024-06-04 18:10:01,934 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e39f2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:10:01, skipping insertion in model container
[2024-06-04 18:10:01,934 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:10:01" (4/4) ...
[2024-06-04 18:10:01,935 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-04 18:10:01,950 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 18:10:01,951 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 18:10:01,951 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 18:10:02,063 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 18:10:02,100 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow
[2024-06-04 18:10:02,150 INFO  L124   PetriNetUnfolderBase]: 0/38 cut-off events.
[2024-06-04 18:10:02,150 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:10:02,154 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-04 18:10:02,154 INFO  L82        GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow
[2024-06-04 18:10:02,157 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow
[2024-06-04 18:10:02,173 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 18:10:02,182 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;@6aadbb3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 18:10:02,182 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 18:10:02,191 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 18:10:02,192 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-04 18:10:02,192 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:10:02,192 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:02,193 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:02,194 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:02,199 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:02,199 INFO  L85        PathProgramCache]: Analyzing trace with hash -1474871270, now seen corresponding path program 1 times
[2024-06-04 18:10:02,211 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:02,211 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560947078]
[2024-06-04 18:10:02,212 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:02,213 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:02,560 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:07,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:07,432 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:07,432 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560947078]
[2024-06-04 18:10:07,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560947078] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:07,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:07,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 18:10:07,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052194244]
[2024-06-04 18:10:07,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:07,443 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 18:10:07,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:07,467 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 18:10:07,468 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 18:10:07,531 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-04 18:10:07,533 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:07,534 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:07,534 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-04 18:10:07,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:08,528 INFO  L124   PetriNetUnfolderBase]: 1659/2478 cut-off events.
[2024-06-04 18:10:08,528 INFO  L125   PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-06-04 18:10:08,537 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5044 conditions, 2478 events. 1659/2478 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11224 event pairs, 1184 based on Foata normal form. 1/2438 useless extension candidates. Maximal degree in co-relation 5029. Up to 2465 conditions per place. 
[2024-06-04 18:10:08,551 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 35 selfloop transitions, 4 changer transitions 0/42 dead transitions.
[2024-06-04 18:10:08,551 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 177 flow
[2024-06-04 18:10:08,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 18:10:08,555 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 18:10:08,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions.
[2024-06-04 18:10:08,563 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5365853658536586
[2024-06-04 18:10:08,565 INFO  L175             Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 66 transitions.
[2024-06-04 18:10:08,566 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 177 flow
[2024-06-04 18:10:08,568 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 18:10:08,571 INFO  L231             Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow
[2024-06-04 18:10:08,573 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35}
[2024-06-04 18:10:08,579 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2024-06-04 18:10:08,579 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow
[2024-06-04 18:10:08,579 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:08,580 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:08,580 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:08,580 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 18:10:08,580 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:08,581 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:08,581 INFO  L85        PathProgramCache]: Analyzing trace with hash -12049223, now seen corresponding path program 1 times
[2024-06-04 18:10:08,582 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:08,582 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774005557]
[2024-06-04 18:10:08,582 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:08,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:08,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:12,283 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:12,283 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:12,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774005557]
[2024-06-04 18:10:12,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774005557] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:12,284 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:12,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 18:10:12,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194439093]
[2024-06-04 18:10:12,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:12,286 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 18:10:12,286 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:12,286 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 18:10:12,287 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-04 18:10:12,363 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-04 18:10:12,364 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand  has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:12,364 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:12,364 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-04 18:10:12,364 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:13,219 INFO  L124   PetriNetUnfolderBase]: 1653/2469 cut-off events.
[2024-06-04 18:10:13,219 INFO  L125   PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES.
[2024-06-04 18:10:13,223 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5660 conditions, 2469 events. 1653/2469 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11216 event pairs, 1038 based on Foata normal form. 3/2471 useless extension candidates. Maximal degree in co-relation 5645. Up to 2441 conditions per place. 
[2024-06-04 18:10:13,233 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 42 selfloop transitions, 7 changer transitions 0/52 dead transitions.
[2024-06-04 18:10:13,234 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 244 flow
[2024-06-04 18:10:13,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 18:10:13,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 18:10:13,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions.
[2024-06-04 18:10:13,237 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5121951219512195
[2024-06-04 18:10:13,238 INFO  L175             Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 84 transitions.
[2024-06-04 18:10:13,238 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 244 flow
[2024-06-04 18:10:13,239 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 18:10:13,241 INFO  L231             Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow
[2024-06-04 18:10:13,242 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38}
[2024-06-04 18:10:13,242 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places.
[2024-06-04 18:10:13,242 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow
[2024-06-04 18:10:13,243 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:13,243 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:13,244 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:13,246 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 18:10:13,246 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-04 18:10:13,246 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:13,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -373524803, now seen corresponding path program 1 times
[2024-06-04 18:10:13,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:13,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487914433]
[2024-06-04 18:10:13,253 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:13,254 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:13,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:16,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:16,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:16,711 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487914433]
[2024-06-04 18:10:16,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487914433] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:16,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:16,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-04 18:10:16,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814271467]
[2024-06-04 18:10:16,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:16,712 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-04 18:10:16,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:16,713 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-04 18:10:16,713 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-04 18:10:16,813 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-04 18:10:16,814 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 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-04 18:10:16,814 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:16,814 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-04 18:10:16,814 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:17,746 INFO  L124   PetriNetUnfolderBase]: 1661/2482 cut-off events.
[2024-06-04 18:10:17,747 INFO  L125   PetriNetUnfolderBase]: For 1306/1306 co-relation queries the response was YES.
[2024-06-04 18:10:17,750 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6310 conditions, 2482 events. 1661/2482 cut-off events. For 1306/1306 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11254 event pairs, 812 based on Foata normal form. 5/2485 useless extension candidates. Maximal degree in co-relation 6293. Up to 2387 conditions per place. 
[2024-06-04 18:10:17,761 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 55 selfloop transitions, 16 changer transitions 0/74 dead transitions.
[2024-06-04 18:10:17,761 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 398 flow
[2024-06-04 18:10:17,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:10:17,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:10:17,764 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions.
[2024-06-04 18:10:17,766 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5365853658536586
[2024-06-04 18:10:17,766 INFO  L175             Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 110 transitions.
[2024-06-04 18:10:17,767 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 398 flow
[2024-06-04 18:10:17,769 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 384 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-04 18:10:17,771 INFO  L231             Difference]: Finished difference. Result has 50 places, 49 transitions, 235 flow
[2024-06-04 18:10:17,771 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=49}
[2024-06-04 18:10:17,772 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places.
[2024-06-04 18:10:17,772 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 235 flow
[2024-06-04 18:10:17,773 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-04 18:10:17,773 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:17,773 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:17,773 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 18:10:17,773 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:17,774 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:17,774 INFO  L85        PathProgramCache]: Analyzing trace with hash 1416456656, now seen corresponding path program 1 times
[2024-06-04 18:10:17,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:17,774 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788206240]
[2024-06-04 18:10:17,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:17,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:17,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:22,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:22,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:22,178 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788206240]
[2024-06-04 18:10:22,178 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788206240] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:22,178 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:22,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:10:22,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496879783]
[2024-06-04 18:10:22,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:22,179 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:10:22,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:22,180 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:10:22,180 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:10:22,256 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-04 18:10:22,257 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 235 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-04 18:10:22,257 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:22,257 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-04 18:10:22,257 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:23,307 INFO  L124   PetriNetUnfolderBase]: 1669/2494 cut-off events.
[2024-06-04 18:10:23,308 INFO  L125   PetriNetUnfolderBase]: For 3041/3044 co-relation queries the response was YES.
[2024-06-04 18:10:23,312 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 2494 events. 1669/2494 cut-off events. For 3041/3044 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11284 event pairs, 666 based on Foata normal form. 7/2499 useless extension candidates. Maximal degree in co-relation 7409. Up to 2373 conditions per place. 
[2024-06-04 18:10:23,324 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 62 selfloop transitions, 20 changer transitions 0/85 dead transitions.
[2024-06-04 18:10:23,325 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 525 flow
[2024-06-04 18:10:23,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:10:23,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:10:23,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions.
[2024-06-04 18:10:23,326 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.524390243902439
[2024-06-04 18:10:23,326 INFO  L175             Difference]: Start difference. First operand has 50 places, 49 transitions, 235 flow. Second operand 6 states and 129 transitions.
[2024-06-04 18:10:23,327 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 525 flow
[2024-06-04 18:10:23,331 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 517 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-06-04 18:10:23,332 INFO  L231             Difference]: Finished difference. Result has 56 places, 53 transitions, 308 flow
[2024-06-04 18:10:23,332 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=56, PETRI_TRANSITIONS=53}
[2024-06-04 18:10:23,333 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places.
[2024-06-04 18:10:23,333 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 308 flow
[2024-06-04 18:10:23,334 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-04 18:10:23,334 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:23,334 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:23,334 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 18:10:23,334 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-04 18:10:23,335 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:23,335 INFO  L85        PathProgramCache]: Analyzing trace with hash 960484548, now seen corresponding path program 1 times
[2024-06-04 18:10:23,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:23,335 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063605453]
[2024-06-04 18:10:23,335 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:23,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:23,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:27,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:27,583 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:27,583 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063605453]
[2024-06-04 18:10:27,583 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063605453] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:27,583 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:27,583 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:10:27,583 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457637644]
[2024-06-04 18:10:27,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:27,585 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:10:27,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:27,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:10:27,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:10:27,706 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-04 18:10:27,707 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 308 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-04 18:10:27,707 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:27,707 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-04 18:10:27,707 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:28,772 INFO  L124   PetriNetUnfolderBase]: 1681/2514 cut-off events.
[2024-06-04 18:10:28,773 INFO  L125   PetriNetUnfolderBase]: For 4793/4796 co-relation queries the response was YES.
[2024-06-04 18:10:28,777 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8300 conditions, 2514 events. 1681/2514 cut-off events. For 4793/4796 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11430 event pairs, 502 based on Foata normal form. 12/2524 useless extension candidates. Maximal degree in co-relation 8277. Up to 2341 conditions per place. 
[2024-06-04 18:10:28,786 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 66 selfloop transitions, 23 changer transitions 0/92 dead transitions.
[2024-06-04 18:10:28,787 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 626 flow
[2024-06-04 18:10:28,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:10:28,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:10:28,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions.
[2024-06-04 18:10:28,789 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5017421602787456
[2024-06-04 18:10:28,789 INFO  L175             Difference]: Start difference. First operand has 56 places, 53 transitions, 308 flow. Second operand 7 states and 144 transitions.
[2024-06-04 18:10:28,789 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 626 flow
[2024-06-04 18:10:28,794 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 577 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-04 18:10:28,795 INFO  L231             Difference]: Finished difference. Result has 58 places, 55 transitions, 335 flow
[2024-06-04 18:10:28,795 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=58, PETRI_TRANSITIONS=55}
[2024-06-04 18:10:28,796 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places.
[2024-06-04 18:10:28,796 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 335 flow
[2024-06-04 18:10:28,796 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-04 18:10:28,797 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:28,797 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:28,797 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 18:10:28,797 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:28,798 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:28,798 INFO  L85        PathProgramCache]: Analyzing trace with hash 1206858301, now seen corresponding path program 1 times
[2024-06-04 18:10:28,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:28,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595476221]
[2024-06-04 18:10:28,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:28,798 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:28,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:35,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:35,870 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:35,870 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595476221]
[2024-06-04 18:10:35,870 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595476221] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:35,870 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:35,870 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:10:35,871 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978568032]
[2024-06-04 18:10:35,871 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:35,871 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:10:35,871 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:35,872 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:10:35,872 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:10:35,982 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:10:35,982 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 335 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-04 18:10:35,982 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:35,982 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:10:35,982 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:36,713 INFO  L124   PetriNetUnfolderBase]: 1676/2506 cut-off events.
[2024-06-04 18:10:36,714 INFO  L125   PetriNetUnfolderBase]: For 6458/6458 co-relation queries the response was YES.
[2024-06-04 18:10:36,717 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8825 conditions, 2506 events. 1676/2506 cut-off events. For 6458/6458 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11387 event pairs, 659 based on Foata normal form. 2/2507 useless extension candidates. Maximal degree in co-relation 8801. Up to 2484 conditions per place. 
[2024-06-04 18:10:36,728 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 55 selfloop transitions, 8 changer transitions 0/66 dead transitions.
[2024-06-04 18:10:36,728 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 489 flow
[2024-06-04 18:10:36,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:10:36,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:10:36,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions.
[2024-06-04 18:10:36,729 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-04 18:10:36,729 INFO  L175             Difference]: Start difference. First operand has 58 places, 55 transitions, 335 flow. Second operand 5 states and 82 transitions.
[2024-06-04 18:10:36,729 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 489 flow
[2024-06-04 18:10:36,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 425 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-04 18:10:36,734 INFO  L231             Difference]: Finished difference. Result has 58 places, 55 transitions, 295 flow
[2024-06-04 18:10:36,734 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=58, PETRI_TRANSITIONS=55}
[2024-06-04 18:10:36,735 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places.
[2024-06-04 18:10:36,735 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 295 flow
[2024-06-04 18:10:36,736 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-04 18:10:36,736 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:36,736 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:36,736 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 18:10:36,736 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-04 18:10:36,737 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:36,737 INFO  L85        PathProgramCache]: Analyzing trace with hash -1258732217, now seen corresponding path program 1 times
[2024-06-04 18:10:36,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:36,737 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396240454]
[2024-06-04 18:10:36,737 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:36,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:36,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:43,883 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:43,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:43,883 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396240454]
[2024-06-04 18:10:43,883 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396240454] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:43,883 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:43,883 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:10:43,884 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528875106]
[2024-06-04 18:10:43,884 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:43,884 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:10:43,884 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:43,885 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:10:43,885 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:10:44,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:10:44,009 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 295 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-04 18:10:44,009 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:44,009 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:10:44,009 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:44,767 INFO  L124   PetriNetUnfolderBase]: 1680/2512 cut-off events.
[2024-06-04 18:10:44,767 INFO  L125   PetriNetUnfolderBase]: For 7529/7529 co-relation queries the response was YES.
[2024-06-04 18:10:44,771 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8827 conditions, 2512 events. 1680/2512 cut-off events. For 7529/7529 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11376 event pairs, 616 based on Foata normal form. 6/2517 useless extension candidates. Maximal degree in co-relation 8801. Up to 2442 conditions per place. 
[2024-06-04 18:10:44,779 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 65 selfloop transitions, 19 changer transitions 0/87 dead transitions.
[2024-06-04 18:10:44,779 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 87 transitions, 597 flow
[2024-06-04 18:10:44,780 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:10:44,780 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:10:44,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-04 18:10:44,780 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-04 18:10:44,781 INFO  L175             Difference]: Start difference. First operand has 58 places, 55 transitions, 295 flow. Second operand 8 states and 124 transitions.
[2024-06-04 18:10:44,781 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 87 transitions, 597 flow
[2024-06-04 18:10:44,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 575 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-04 18:10:44,785 INFO  L231             Difference]: Finished difference. Result has 64 places, 66 transitions, 404 flow
[2024-06-04 18:10:44,786 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=404, PETRI_PLACES=64, PETRI_TRANSITIONS=66}
[2024-06-04 18:10:44,786 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places.
[2024-06-04 18:10:44,786 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 404 flow
[2024-06-04 18:10:44,787 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-04 18:10:44,787 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:44,787 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:44,787 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 18:10:44,787 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:44,787 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:44,788 INFO  L85        PathProgramCache]: Analyzing trace with hash -371713862, now seen corresponding path program 1 times
[2024-06-04 18:10:44,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:44,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779722975]
[2024-06-04 18:10:44,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:44,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:44,834 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:49,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:49,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:49,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779722975]
[2024-06-04 18:10:49,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779722975] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:49,917 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:49,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:10:49,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870629924]
[2024-06-04 18:10:49,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:49,918 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:10:49,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:49,918 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:10:49,918 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:10:50,046 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:10:50,047 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 404 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-04 18:10:50,047 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:50,047 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:10:50,047 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:50,738 INFO  L124   PetriNetUnfolderBase]: 1686/2522 cut-off events.
[2024-06-04 18:10:50,738 INFO  L125   PetriNetUnfolderBase]: For 10575/10581 co-relation queries the response was YES.
[2024-06-04 18:10:50,744 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9803 conditions, 2522 events. 1686/2522 cut-off events. For 10575/10581 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11342 event pairs, 636 based on Foata normal form. 8/2528 useless extension candidates. Maximal degree in co-relation 9775. Up to 2424 conditions per place. 
[2024-06-04 18:10:50,754 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 67 selfloop transitions, 19 changer transitions 0/89 dead transitions.
[2024-06-04 18:10:50,755 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 676 flow
[2024-06-04 18:10:50,756 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:10:50,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:10:50,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-04 18:10:50,757 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4268292682926829
[2024-06-04 18:10:50,757 INFO  L175             Difference]: Start difference. First operand has 64 places, 66 transitions, 404 flow. Second operand 6 states and 105 transitions.
[2024-06-04 18:10:50,757 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 676 flow
[2024-06-04 18:10:50,769 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 89 transitions, 638 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-04 18:10:50,777 INFO  L231             Difference]: Finished difference. Result has 66 places, 69 transitions, 438 flow
[2024-06-04 18:10:50,777 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=66, PETRI_TRANSITIONS=69}
[2024-06-04 18:10:50,780 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places.
[2024-06-04 18:10:50,780 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 438 flow
[2024-06-04 18:10:50,780 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-04 18:10:50,781 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:50,781 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:50,781 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 18:10:50,781 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:50,781 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:50,782 INFO  L85        PathProgramCache]: Analyzing trace with hash 149682268, now seen corresponding path program 2 times
[2024-06-04 18:10:50,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:50,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793945421]
[2024-06-04 18:10:50,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:50,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:50,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:55,785 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:55,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:55,786 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793945421]
[2024-06-04 18:10:55,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793945421] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:55,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:55,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:10:55,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058316466]
[2024-06-04 18:10:55,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:55,787 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:10:55,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:55,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:10:55,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:10:55,948 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:10:55,948 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 438 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-04 18:10:55,948 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:55,948 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:10:55,948 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:56,629 INFO  L124   PetriNetUnfolderBase]: 1671/2496 cut-off events.
[2024-06-04 18:10:56,629 INFO  L125   PetriNetUnfolderBase]: For 11723/11723 co-relation queries the response was YES.
[2024-06-04 18:10:56,633 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9860 conditions, 2496 events. 1671/2496 cut-off events. For 11723/11723 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11152 event pairs, 632 based on Foata normal form. 2/2497 useless extension candidates. Maximal degree in co-relation 9831. Up to 2465 conditions per place. 
[2024-06-04 18:10:56,643 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 70 selfloop transitions, 11 changer transitions 0/84 dead transitions.
[2024-06-04 18:10:56,643 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 638 flow
[2024-06-04 18:10:56,643 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:10:56,644 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:10:56,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-04 18:10:56,644 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-04 18:10:56,645 INFO  L175             Difference]: Start difference. First operand has 66 places, 69 transitions, 438 flow. Second operand 6 states and 96 transitions.
[2024-06-04 18:10:56,645 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 638 flow
[2024-06-04 18:10:56,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 609 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 18:10:56,657 INFO  L231             Difference]: Finished difference. Result has 69 places, 69 transitions, 439 flow
[2024-06-04 18:10:56,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=69, PETRI_TRANSITIONS=69}
[2024-06-04 18:10:56,658 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places.
[2024-06-04 18:10:56,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 439 flow
[2024-06-04 18:10:56,658 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-04 18:10:56,659 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:56,659 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:56,659 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 18:10:56,659 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:56,659 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:56,660 INFO  L85        PathProgramCache]: Analyzing trace with hash 1361773192, now seen corresponding path program 1 times
[2024-06-04 18:10:56,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:56,660 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743533612]
[2024-06-04 18:10:56,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:56,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:56,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:01,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:01,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:01,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743533612]
[2024-06-04 18:11:01,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743533612] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:01,685 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:01,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:01,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141267095]
[2024-06-04 18:11:01,686 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:01,686 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:01,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:01,687 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:01,687 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:01,850 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:11:01,850 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 439 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-04 18:11:01,850 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:01,850 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:11:01,851 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:02,617 INFO  L124   PetriNetUnfolderBase]: 1839/2736 cut-off events.
[2024-06-04 18:11:02,618 INFO  L125   PetriNetUnfolderBase]: For 14630/14630 co-relation queries the response was YES.
[2024-06-04 18:11:02,622 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10957 conditions, 2736 events. 1839/2736 cut-off events. For 14630/14630 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12386 event pairs, 549 based on Foata normal form. 12/2745 useless extension candidates. Maximal degree in co-relation 10927. Up to 2361 conditions per place. 
[2024-06-04 18:11:02,634 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 87 selfloop transitions, 31 changer transitions 0/121 dead transitions.
[2024-06-04 18:11:02,634 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 121 transitions, 963 flow
[2024-06-04 18:11:02,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:11:02,635 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:11:02,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-04 18:11:02,636 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45993031358885017
[2024-06-04 18:11:02,636 INFO  L175             Difference]: Start difference. First operand has 69 places, 69 transitions, 439 flow. Second operand 7 states and 132 transitions.
[2024-06-04 18:11:02,636 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 121 transitions, 963 flow
[2024-06-04 18:11:02,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 121 transitions, 916 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-04 18:11:02,651 INFO  L231             Difference]: Finished difference. Result has 73 places, 88 transitions, 638 flow
[2024-06-04 18:11:02,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=638, PETRI_PLACES=73, PETRI_TRANSITIONS=88}
[2024-06-04 18:11:02,652 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places.
[2024-06-04 18:11:02,652 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 88 transitions, 638 flow
[2024-06-04 18:11:02,652 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-04 18:11:02,653 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:02,653 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:02,653 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 18:11:02,653 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:02,653 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:02,654 INFO  L85        PathProgramCache]: Analyzing trace with hash 345184038, now seen corresponding path program 2 times
[2024-06-04 18:11:02,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:02,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890467517]
[2024-06-04 18:11:02,654 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:02,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:02,689 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:07,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:07,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:07,556 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890467517]
[2024-06-04 18:11:07,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890467517] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:07,556 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:07,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:07,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126164133]
[2024-06-04 18:11:07,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:07,556 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:07,556 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:07,557 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:07,557 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:07,642 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:11:07,642 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 88 transitions, 638 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-04 18:11:07,642 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:07,642 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:11:07,642 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:08,510 INFO  L124   PetriNetUnfolderBase]: 1875/2786 cut-off events.
[2024-06-04 18:11:08,511 INFO  L125   PetriNetUnfolderBase]: For 19592/19592 co-relation queries the response was YES.
[2024-06-04 18:11:08,515 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12934 conditions, 2786 events. 1875/2786 cut-off events. For 19592/19592 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12597 event pairs, 596 based on Foata normal form. 6/2791 useless extension candidates. Maximal degree in co-relation 12900. Up to 2647 conditions per place. 
[2024-06-04 18:11:08,527 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 97 selfloop transitions, 23 changer transitions 0/123 dead transitions.
[2024-06-04 18:11:08,527 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 123 transitions, 1120 flow
[2024-06-04 18:11:08,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:11:08,528 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:11:08,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-04 18:11:08,529 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4250871080139373
[2024-06-04 18:11:08,529 INFO  L175             Difference]: Start difference. First operand has 73 places, 88 transitions, 638 flow. Second operand 7 states and 122 transitions.
[2024-06-04 18:11:08,529 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 123 transitions, 1120 flow
[2024-06-04 18:11:08,547 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 123 transitions, 1076 flow, removed 21 selfloop flow, removed 1 redundant places.
[2024-06-04 18:11:08,550 INFO  L231             Difference]: Finished difference. Result has 80 places, 96 transitions, 746 flow
[2024-06-04 18:11:08,550 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=746, PETRI_PLACES=80, PETRI_TRANSITIONS=96}
[2024-06-04 18:11:08,551 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places.
[2024-06-04 18:11:08,551 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 96 transitions, 746 flow
[2024-06-04 18:11:08,551 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-04 18:11:08,552 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:08,552 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:08,552 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 18:11:08,552 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-04 18:11:08,552 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:08,553 INFO  L85        PathProgramCache]: Analyzing trace with hash 1069438870, now seen corresponding path program 3 times
[2024-06-04 18:11:08,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:08,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551362813]
[2024-06-04 18:11:08,553 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:08,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:08,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:13,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:13,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:13,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551362813]
[2024-06-04 18:11:13,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551362813] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:13,407 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:13,407 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:13,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538628909]
[2024-06-04 18:11:13,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:13,407 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:13,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:13,408 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:13,408 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:13,497 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:11:13,497 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 96 transitions, 746 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-04 18:11:13,497 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:13,497 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:11:13,497 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:14,529 INFO  L124   PetriNetUnfolderBase]: 1879/2792 cut-off events.
[2024-06-04 18:11:14,530 INFO  L125   PetriNetUnfolderBase]: For 23443/23443 co-relation queries the response was YES.
[2024-06-04 18:11:14,536 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13510 conditions, 2792 events. 1879/2792 cut-off events. For 23443/23443 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12654 event pairs, 589 based on Foata normal form. 6/2797 useless extension candidates. Maximal degree in co-relation 13472. Up to 2716 conditions per place. 
[2024-06-04 18:11:14,575 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 100 selfloop transitions, 23 changer transitions 0/126 dead transitions.
[2024-06-04 18:11:14,575 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 126 transitions, 1156 flow
[2024-06-04 18:11:14,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:11:14,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:11:14,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions.
[2024-06-04 18:11:14,601 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37398373983739835
[2024-06-04 18:11:14,601 INFO  L175             Difference]: Start difference. First operand has 80 places, 96 transitions, 746 flow. Second operand 9 states and 138 transitions.
[2024-06-04 18:11:14,601 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 126 transitions, 1156 flow
[2024-06-04 18:11:14,638 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 126 transitions, 1107 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-04 18:11:14,640 INFO  L231             Difference]: Finished difference. Result has 87 places, 102 transitions, 828 flow
[2024-06-04 18:11:14,640 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=828, PETRI_PLACES=87, PETRI_TRANSITIONS=102}
[2024-06-04 18:11:14,642 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places.
[2024-06-04 18:11:14,642 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 102 transitions, 828 flow
[2024-06-04 18:11:14,642 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-04 18:11:14,642 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:14,642 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:14,642 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 18:11:14,642 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-04 18:11:14,642 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:14,643 INFO  L85        PathProgramCache]: Analyzing trace with hash 1539150790, now seen corresponding path program 1 times
[2024-06-04 18:11:14,643 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:14,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542681204]
[2024-06-04 18:11:14,644 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:14,644 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:14,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:20,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:20,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:20,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542681204]
[2024-06-04 18:11:20,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542681204] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:20,679 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:20,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:11:20,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571024161]
[2024-06-04 18:11:20,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:20,680 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:11:20,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:20,680 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:11:20,680 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:11:20,798 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:11:20,799 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 102 transitions, 828 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-04 18:11:20,799 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:20,799 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:11:20,799 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:21,780 INFO  L124   PetriNetUnfolderBase]: 1882/2797 cut-off events.
[2024-06-04 18:11:21,780 INFO  L125   PetriNetUnfolderBase]: For 25778/25778 co-relation queries the response was YES.
[2024-06-04 18:11:21,787 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13849 conditions, 2797 events. 1882/2797 cut-off events. For 25778/25778 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12663 event pairs, 571 based on Foata normal form. 6/2802 useless extension candidates. Maximal degree in co-relation 13809. Up to 2701 conditions per place. 
[2024-06-04 18:11:21,795 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 99 selfloop transitions, 27 changer transitions 0/129 dead transitions.
[2024-06-04 18:11:21,795 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 129 transitions, 1218 flow
[2024-06-04 18:11:21,796 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:11:21,796 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:11:21,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions.
[2024-06-04 18:11:21,797 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37669376693766937
[2024-06-04 18:11:21,797 INFO  L175             Difference]: Start difference. First operand has 87 places, 102 transitions, 828 flow. Second operand 9 states and 139 transitions.
[2024-06-04 18:11:21,797 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 129 transitions, 1218 flow
[2024-06-04 18:11:21,818 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 129 transitions, 1159 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-04 18:11:21,820 INFO  L231             Difference]: Finished difference. Result has 90 places, 105 transitions, 869 flow
[2024-06-04 18:11:21,820 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=869, PETRI_PLACES=90, PETRI_TRANSITIONS=105}
[2024-06-04 18:11:21,820 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places.
[2024-06-04 18:11:21,820 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 105 transitions, 869 flow
[2024-06-04 18:11:21,821 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-04 18:11:21,821 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:21,821 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:21,821 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 18:11:21,821 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:21,821 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:21,822 INFO  L85        PathProgramCache]: Analyzing trace with hash 1008605830, now seen corresponding path program 1 times
[2024-06-04 18:11:21,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:21,822 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814450626]
[2024-06-04 18:11:21,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:21,822 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:21,855 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:30,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:30,038 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:30,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814450626]
[2024-06-04 18:11:30,039 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814450626] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:30,039 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:30,039 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:11:30,039 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143800458]
[2024-06-04 18:11:30,039 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:30,039 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:11:30,039 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:30,040 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:11:30,040 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:11:30,129 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:11:30,129 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 105 transitions, 869 flow. Second operand  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:30,129 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:30,129 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:11:30,129 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:30,915 INFO  L124   PetriNetUnfolderBase]: 1879/2793 cut-off events.
[2024-06-04 18:11:30,916 INFO  L125   PetriNetUnfolderBase]: For 28033/28033 co-relation queries the response was YES.
[2024-06-04 18:11:30,921 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14238 conditions, 2793 events. 1879/2793 cut-off events. For 28033/28033 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12621 event pairs, 592 based on Foata normal form. 1/2793 useless extension candidates. Maximal degree in co-relation 14197. Up to 2777 conditions per place. 
[2024-06-04 18:11:30,929 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 102 selfloop transitions, 8 changer transitions 0/113 dead transitions.
[2024-06-04 18:11:30,929 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 113 transitions, 1109 flow
[2024-06-04 18:11:30,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:11:30,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:11:30,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions.
[2024-06-04 18:11:30,930 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3804878048780488
[2024-06-04 18:11:30,930 INFO  L175             Difference]: Start difference. First operand has 90 places, 105 transitions, 869 flow. Second operand 5 states and 78 transitions.
[2024-06-04 18:11:30,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 113 transitions, 1109 flow
[2024-06-04 18:11:30,951 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 113 transitions, 1021 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-04 18:11:30,953 INFO  L231             Difference]: Finished difference. Result has 88 places, 105 transitions, 803 flow
[2024-06-04 18:11:30,953 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=803, PETRI_PLACES=88, PETRI_TRANSITIONS=105}
[2024-06-04 18:11:30,954 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places.
[2024-06-04 18:11:30,954 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 105 transitions, 803 flow
[2024-06-04 18:11:30,954 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:30,954 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:30,955 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:30,955 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 18:11:30,955 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-04 18:11:30,955 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:30,955 INFO  L85        PathProgramCache]: Analyzing trace with hash -1355039913, now seen corresponding path program 1 times
[2024-06-04 18:11:30,956 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:30,956 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768440625]
[2024-06-04 18:11:30,956 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:30,956 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:30,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:36,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:36,668 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:36,668 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768440625]
[2024-06-04 18:11:36,668 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768440625] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:36,668 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:36,668 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:36,668 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474501176]
[2024-06-04 18:11:36,668 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:36,668 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:36,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:36,669 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:36,669 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:36,822 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:11:36,822 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 105 transitions, 803 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-04 18:11:36,822 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:36,822 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:11:36,822 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:37,712 INFO  L124   PetriNetUnfolderBase]: 1890/2810 cut-off events.
[2024-06-04 18:11:37,712 INFO  L125   PetriNetUnfolderBase]: For 30849/30858 co-relation queries the response was YES.
[2024-06-04 18:11:37,718 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14365 conditions, 2810 events. 1890/2810 cut-off events. For 30849/30858 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12726 event pairs, 578 based on Foata normal form. 8/2816 useless extension candidates. Maximal degree in co-relation 14323. Up to 2672 conditions per place. 
[2024-06-04 18:11:37,725 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 109 selfloop transitions, 26 changer transitions 0/138 dead transitions.
[2024-06-04 18:11:37,725 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 138 transitions, 1275 flow
[2024-06-04 18:11:37,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:11:37,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:11:37,727 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-04 18:11:37,728 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4250871080139373
[2024-06-04 18:11:37,728 INFO  L175             Difference]: Start difference. First operand has 88 places, 105 transitions, 803 flow. Second operand 7 states and 122 transitions.
[2024-06-04 18:11:37,728 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 138 transitions, 1275 flow
[2024-06-04 18:11:37,745 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 138 transitions, 1259 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-04 18:11:37,746 INFO  L231             Difference]: Finished difference. Result has 91 places, 111 transitions, 933 flow
[2024-06-04 18:11:37,747 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=933, PETRI_PLACES=91, PETRI_TRANSITIONS=111}
[2024-06-04 18:11:37,747 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places.
[2024-06-04 18:11:37,747 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 111 transitions, 933 flow
[2024-06-04 18:11:37,748 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-04 18:11:37,748 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:37,748 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:37,748 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 18:11:37,748 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-04 18:11:37,748 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:37,749 INFO  L85        PathProgramCache]: Analyzing trace with hash -1522394431, now seen corresponding path program 2 times
[2024-06-04 18:11:37,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:37,749 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385543278]
[2024-06-04 18:11:37,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:37,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:37,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:43,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:43,774 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:43,774 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385543278]
[2024-06-04 18:11:43,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385543278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:43,774 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:43,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:43,774 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38650451]
[2024-06-04 18:11:43,774 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:43,775 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:43,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:43,775 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:43,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:43,891 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:11:43,892 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 111 transitions, 933 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-04 18:11:43,892 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:43,892 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:11:43,892 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:44,638 INFO  L124   PetriNetUnfolderBase]: 1885/2803 cut-off events.
[2024-06-04 18:11:44,639 INFO  L125   PetriNetUnfolderBase]: For 35164/35173 co-relation queries the response was YES.
[2024-06-04 18:11:44,646 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14928 conditions, 2803 events. 1885/2803 cut-off events. For 35164/35173 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12721 event pairs, 573 based on Foata normal form. 8/2809 useless extension candidates. Maximal degree in co-relation 14885. Up to 2700 conditions per place. 
[2024-06-04 18:11:44,655 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 108 selfloop transitions, 22 changer transitions 0/133 dead transitions.
[2024-06-04 18:11:44,655 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 133 transitions, 1249 flow
[2024-06-04 18:11:44,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:11:44,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:11:44,659 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-04 18:11:44,660 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4076655052264808
[2024-06-04 18:11:44,660 INFO  L175             Difference]: Start difference. First operand has 91 places, 111 transitions, 933 flow. Second operand 7 states and 117 transitions.
[2024-06-04 18:11:44,660 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 133 transitions, 1249 flow
[2024-06-04 18:11:44,687 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 133 transitions, 1168 flow, removed 31 selfloop flow, removed 3 redundant places.
[2024-06-04 18:11:44,689 INFO  L231             Difference]: Finished difference. Result has 95 places, 111 transitions, 904 flow
[2024-06-04 18:11:44,690 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=904, PETRI_PLACES=95, PETRI_TRANSITIONS=111}
[2024-06-04 18:11:44,690 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places.
[2024-06-04 18:11:44,690 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 111 transitions, 904 flow
[2024-06-04 18:11:44,690 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-04 18:11:44,690 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:44,691 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:44,691 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 18:11:44,691 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:44,691 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:44,691 INFO  L85        PathProgramCache]: Analyzing trace with hash -734708748, now seen corresponding path program 1 times
[2024-06-04 18:11:44,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:44,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995502619]
[2024-06-04 18:11:44,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:44,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:44,718 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:49,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:49,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:49,552 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995502619]
[2024-06-04 18:11:49,552 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995502619] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:49,552 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:49,553 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:49,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325356348]
[2024-06-04 18:11:49,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:49,553 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:49,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:49,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:49,554 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:49,697 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:11:49,698 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 111 transitions, 904 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-04 18:11:49,698 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:49,698 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:11:49,698 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:50,451 INFO  L124   PetriNetUnfolderBase]: 1921/2856 cut-off events.
[2024-06-04 18:11:50,451 INFO  L125   PetriNetUnfolderBase]: For 39220/39223 co-relation queries the response was YES.
[2024-06-04 18:11:50,458 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15412 conditions, 2856 events. 1921/2856 cut-off events. For 39220/39223 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12979 event pairs, 542 based on Foata normal form. 8/2861 useless extension candidates. Maximal degree in co-relation 15367. Up to 2425 conditions per place. 
[2024-06-04 18:11:50,466 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 102 selfloop transitions, 47 changer transitions 0/152 dead transitions.
[2024-06-04 18:11:50,467 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 152 transitions, 1532 flow
[2024-06-04 18:11:50,467 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:11:50,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:11:50,467 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-04 18:11:50,468 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46689895470383275
[2024-06-04 18:11:50,468 INFO  L175             Difference]: Start difference. First operand has 95 places, 111 transitions, 904 flow. Second operand 7 states and 134 transitions.
[2024-06-04 18:11:50,468 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 152 transitions, 1532 flow
[2024-06-04 18:11:50,492 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 152 transitions, 1477 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-04 18:11:50,494 INFO  L231             Difference]: Finished difference. Result has 98 places, 119 transitions, 1105 flow
[2024-06-04 18:11:50,494 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1105, PETRI_PLACES=98, PETRI_TRANSITIONS=119}
[2024-06-04 18:11:50,495 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places.
[2024-06-04 18:11:50,495 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 119 transitions, 1105 flow
[2024-06-04 18:11:50,495 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-04 18:11:50,495 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:50,496 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:50,496 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 18:11:50,496 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-04 18:11:50,496 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:50,496 INFO  L85        PathProgramCache]: Analyzing trace with hash -734703168, now seen corresponding path program 2 times
[2024-06-04 18:11:50,496 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:50,497 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042063712]
[2024-06-04 18:11:50,497 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:50,497 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:50,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:55,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:55,177 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:55,177 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042063712]
[2024-06-04 18:11:55,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042063712] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:55,177 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:55,177 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:55,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632331409]
[2024-06-04 18:11:55,178 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:55,178 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:55,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:55,178 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:55,178 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:55,270 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:11:55,271 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 119 transitions, 1105 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-04 18:11:55,271 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:55,271 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:11:55,272 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:56,070 INFO  L124   PetriNetUnfolderBase]: 1957/2908 cut-off events.
[2024-06-04 18:11:56,070 INFO  L125   PetriNetUnfolderBase]: For 45802/45805 co-relation queries the response was YES.
[2024-06-04 18:11:56,078 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16799 conditions, 2908 events. 1957/2908 cut-off events. For 45802/45805 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13274 event pairs, 541 based on Foata normal form. 8/2913 useless extension candidates. Maximal degree in co-relation 16751. Up to 2455 conditions per place. 
[2024-06-04 18:11:56,087 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 101 selfloop transitions, 48 changer transitions 0/152 dead transitions.
[2024-06-04 18:11:56,087 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 152 transitions, 1659 flow
[2024-06-04 18:11:56,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:11:56,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:11:56,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-04 18:11:56,092 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44947735191637633
[2024-06-04 18:11:56,092 INFO  L175             Difference]: Start difference. First operand has 98 places, 119 transitions, 1105 flow. Second operand 7 states and 129 transitions.
[2024-06-04 18:11:56,093 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 152 transitions, 1659 flow
[2024-06-04 18:11:56,138 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 152 transitions, 1572 flow, removed 22 selfloop flow, removed 3 redundant places.
[2024-06-04 18:11:56,140 INFO  L231             Difference]: Finished difference. Result has 102 places, 123 transitions, 1182 flow
[2024-06-04 18:11:56,140 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1182, PETRI_PLACES=102, PETRI_TRANSITIONS=123}
[2024-06-04 18:11:56,140 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places.
[2024-06-04 18:11:56,140 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 123 transitions, 1182 flow
[2024-06-04 18:11:56,141 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-04 18:11:56,141 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:56,141 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:56,141 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 18:11:56,141 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:56,141 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:56,141 INFO  L85        PathProgramCache]: Analyzing trace with hash 1894121721, now seen corresponding path program 1 times
[2024-06-04 18:11:56,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:56,142 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973618297]
[2024-06-04 18:11:56,142 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:56,142 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:56,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:01,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:01,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:01,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973618297]
[2024-06-04 18:12:01,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973618297] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:01,012 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:01,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:01,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089258585]
[2024-06-04 18:12:01,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:01,013 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:01,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:01,013 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:01,013 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:01,151 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:12:01,151 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 123 transitions, 1182 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-04 18:12:01,151 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:01,151 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:12:01,152 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:02,020 INFO  L124   PetriNetUnfolderBase]: 1959/2909 cut-off events.
[2024-06-04 18:12:02,020 INFO  L125   PetriNetUnfolderBase]: For 49543/49543 co-relation queries the response was YES.
[2024-06-04 18:12:02,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16995 conditions, 2909 events. 1959/2909 cut-off events. For 49543/49543 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13274 event pairs, 565 based on Foata normal form. 3/2911 useless extension candidates. Maximal degree in co-relation 16946. Up to 2802 conditions per place. 
[2024-06-04 18:12:02,033 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 115 selfloop transitions, 30 changer transitions 0/148 dead transitions.
[2024-06-04 18:12:02,033 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 148 transitions, 1616 flow
[2024-06-04 18:12:02,034 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:12:02,034 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:12:02,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-04 18:12:02,035 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-04 18:12:02,035 INFO  L175             Difference]: Start difference. First operand has 102 places, 123 transitions, 1182 flow. Second operand 7 states and 119 transitions.
[2024-06-04 18:12:02,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 148 transitions, 1616 flow
[2024-06-04 18:12:02,068 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 148 transitions, 1528 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-04 18:12:02,071 INFO  L231             Difference]: Finished difference. Result has 105 places, 127 transitions, 1230 flow
[2024-06-04 18:12:02,071 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1230, PETRI_PLACES=105, PETRI_TRANSITIONS=127}
[2024-06-04 18:12:02,071 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places.
[2024-06-04 18:12:02,072 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 127 transitions, 1230 flow
[2024-06-04 18:12:02,072 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-04 18:12:02,072 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:02,072 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:02,072 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 18:12:02,072 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:02,072 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:02,072 INFO  L85        PathProgramCache]: Analyzing trace with hash -590610828, now seen corresponding path program 3 times
[2024-06-04 18:12:02,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:02,073 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093913119]
[2024-06-04 18:12:02,073 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:02,073 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:02,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:06,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:06,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:06,565 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093913119]
[2024-06-04 18:12:06,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093913119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:06,565 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:06,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:12:06,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353911398]
[2024-06-04 18:12:06,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:06,566 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:12:06,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:06,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:12:06,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:12:06,682 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:12:06,682 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 127 transitions, 1230 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-04 18:12:06,682 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:06,682 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:12:06,682 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:07,562 INFO  L124   PetriNetUnfolderBase]: 1963/2916 cut-off events.
[2024-06-04 18:12:07,562 INFO  L125   PetriNetUnfolderBase]: For 53488/53497 co-relation queries the response was YES.
[2024-06-04 18:12:07,568 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17350 conditions, 2916 events. 1963/2916 cut-off events. For 53488/53497 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13300 event pairs, 570 based on Foata normal form. 12/2926 useless extension candidates. Maximal degree in co-relation 17300. Up to 2807 conditions per place. 
[2024-06-04 18:12:07,575 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 127 selfloop transitions, 23 changer transitions 0/153 dead transitions.
[2024-06-04 18:12:07,576 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 153 transitions, 1682 flow
[2024-06-04 18:12:07,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:12:07,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:12:07,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-04 18:12:07,578 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-04 18:12:07,579 INFO  L175             Difference]: Start difference. First operand has 105 places, 127 transitions, 1230 flow. Second operand 7 states and 119 transitions.
[2024-06-04 18:12:07,579 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 153 transitions, 1682 flow
[2024-06-04 18:12:07,620 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 153 transitions, 1596 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-04 18:12:07,622 INFO  L231             Difference]: Finished difference. Result has 107 places, 131 transitions, 1263 flow
[2024-06-04 18:12:07,622 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1263, PETRI_PLACES=107, PETRI_TRANSITIONS=131}
[2024-06-04 18:12:07,623 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places.
[2024-06-04 18:12:07,623 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 131 transitions, 1263 flow
[2024-06-04 18:12:07,623 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-04 18:12:07,623 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:07,623 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:07,624 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 18:12:07,624 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:07,624 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:07,625 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248168210, now seen corresponding path program 1 times
[2024-06-04 18:12:07,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:07,625 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660270753]
[2024-06-04 18:12:07,625 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:07,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:07,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:15,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:15,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:15,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660270753]
[2024-06-04 18:12:15,423 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660270753] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:15,423 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:15,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:12:15,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133019733]
[2024-06-04 18:12:15,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:15,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:12:15,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:15,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:12:15,424 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:12:15,535 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:12:15,536 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 131 transitions, 1263 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-04 18:12:15,536 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:15,536 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:12:15,536 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:16,288 INFO  L124   PetriNetUnfolderBase]: 1957/2907 cut-off events.
[2024-06-04 18:12:16,288 INFO  L125   PetriNetUnfolderBase]: For 57003/57003 co-relation queries the response was YES.
[2024-06-04 18:12:16,295 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17558 conditions, 2907 events. 1957/2907 cut-off events. For 57003/57003 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13137 event pairs, 573 based on Foata normal form. 2/2908 useless extension candidates. Maximal degree in co-relation 17507. Up to 2885 conditions per place. 
[2024-06-04 18:12:16,302 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 130 selfloop transitions, 11 changer transitions 0/144 dead transitions.
[2024-06-04 18:12:16,302 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 144 transitions, 1595 flow
[2024-06-04 18:12:16,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:12:16,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:12:16,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions.
[2024-06-04 18:12:16,303 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36585365853658536
[2024-06-04 18:12:16,303 INFO  L175             Difference]: Start difference. First operand has 107 places, 131 transitions, 1263 flow. Second operand 6 states and 90 transitions.
[2024-06-04 18:12:16,303 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 144 transitions, 1595 flow
[2024-06-04 18:12:16,340 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 144 transitions, 1524 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-04 18:12:16,342 INFO  L231             Difference]: Finished difference. Result has 108 places, 134 transitions, 1252 flow
[2024-06-04 18:12:16,342 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1252, PETRI_PLACES=108, PETRI_TRANSITIONS=134}
[2024-06-04 18:12:16,343 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places.
[2024-06-04 18:12:16,343 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 134 transitions, 1252 flow
[2024-06-04 18:12:16,343 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-04 18:12:16,343 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:16,343 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:16,343 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 18:12:16,343 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:16,344 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:16,344 INFO  L85        PathProgramCache]: Analyzing trace with hash 943433769, now seen corresponding path program 1 times
[2024-06-04 18:12:16,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:16,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515022093]
[2024-06-04 18:12:16,344 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:16,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:16,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:22,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:22,126 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:22,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515022093]
[2024-06-04 18:12:22,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515022093] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:22,127 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:22,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:22,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467226607]
[2024-06-04 18:12:22,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:22,128 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:22,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:22,128 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:22,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:22,269 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:12:22,269 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 134 transitions, 1252 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-04 18:12:22,269 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:22,269 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:12:22,269 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:23,142 INFO  L124   PetriNetUnfolderBase]: 1974/2935 cut-off events.
[2024-06-04 18:12:23,142 INFO  L125   PetriNetUnfolderBase]: For 61567/61576 co-relation queries the response was YES.
[2024-06-04 18:12:23,151 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18070 conditions, 2935 events. 1974/2935 cut-off events. For 61567/61576 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13438 event pairs, 418 based on Foata normal form. 10/2943 useless extension candidates. Maximal degree in co-relation 18018. Up to 2699 conditions per place. 
[2024-06-04 18:12:23,162 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 136 selfloop transitions, 32 changer transitions 0/171 dead transitions.
[2024-06-04 18:12:23,162 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 171 transitions, 1850 flow
[2024-06-04 18:12:23,163 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:12:23,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:12:23,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions.
[2024-06-04 18:12:23,164 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4176829268292683
[2024-06-04 18:12:23,164 INFO  L175             Difference]: Start difference. First operand has 108 places, 134 transitions, 1252 flow. Second operand 8 states and 137 transitions.
[2024-06-04 18:12:23,164 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 171 transitions, 1850 flow
[2024-06-04 18:12:23,203 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 171 transitions, 1812 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-04 18:12:23,206 INFO  L231             Difference]: Finished difference. Result has 112 places, 138 transitions, 1389 flow
[2024-06-04 18:12:23,206 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1389, PETRI_PLACES=112, PETRI_TRANSITIONS=138}
[2024-06-04 18:12:23,206 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places.
[2024-06-04 18:12:23,206 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 138 transitions, 1389 flow
[2024-06-04 18:12:23,206 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-04 18:12:23,206 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:23,207 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:23,207 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 18:12:23,207 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:23,207 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:23,207 INFO  L85        PathProgramCache]: Analyzing trace with hash 943436559, now seen corresponding path program 2 times
[2024-06-04 18:12:23,207 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:23,207 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370441256]
[2024-06-04 18:12:23,207 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:23,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:23,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:29,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:29,063 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:29,063 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370441256]
[2024-06-04 18:12:29,063 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370441256] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:29,063 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:29,063 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:29,063 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422644503]
[2024-06-04 18:12:29,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:29,064 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:29,064 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:29,064 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:29,064 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:29,153 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:12:29,153 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 138 transitions, 1389 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-04 18:12:29,153 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:29,153 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:12:29,153 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:30,113 INFO  L124   PetriNetUnfolderBase]: 1991/2962 cut-off events.
[2024-06-04 18:12:30,113 INFO  L125   PetriNetUnfolderBase]: For 68144/68153 co-relation queries the response was YES.
[2024-06-04 18:12:30,122 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18763 conditions, 2962 events. 1991/2962 cut-off events. For 68144/68153 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13557 event pairs, 541 based on Foata normal form. 10/2970 useless extension candidates. Maximal degree in co-relation 18710. Up to 2808 conditions per place. 
[2024-06-04 18:12:30,132 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 139 selfloop transitions, 28 changer transitions 0/170 dead transitions.
[2024-06-04 18:12:30,132 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 170 transitions, 1853 flow
[2024-06-04 18:12:30,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:12:30,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:12:30,134 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-04 18:12:30,134 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40853658536585363
[2024-06-04 18:12:30,134 INFO  L175             Difference]: Start difference. First operand has 112 places, 138 transitions, 1389 flow. Second operand 8 states and 134 transitions.
[2024-06-04 18:12:30,134 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 170 transitions, 1853 flow
[2024-06-04 18:12:30,187 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 170 transitions, 1745 flow, removed 39 selfloop flow, removed 4 redundant places.
[2024-06-04 18:12:30,190 INFO  L231             Difference]: Finished difference. Result has 116 places, 140 transitions, 1402 flow
[2024-06-04 18:12:30,190 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1402, PETRI_PLACES=116, PETRI_TRANSITIONS=140}
[2024-06-04 18:12:30,190 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places.
[2024-06-04 18:12:30,191 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 140 transitions, 1402 flow
[2024-06-04 18:12:30,191 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-04 18:12:30,191 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:30,191 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:30,191 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 18:12:30,191 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:30,192 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:30,192 INFO  L85        PathProgramCache]: Analyzing trace with hash -1419226167, now seen corresponding path program 1 times
[2024-06-04 18:12:30,192 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:30,192 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102026005]
[2024-06-04 18:12:30,192 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:30,192 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:30,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:35,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:35,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:35,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102026005]
[2024-06-04 18:12:35,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102026005] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:35,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:35,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:35,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608005829]
[2024-06-04 18:12:35,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:35,959 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:35,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:35,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:35,960 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:36,125 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:12:36,125 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 140 transitions, 1402 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-04 18:12:36,125 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:36,125 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:12:36,125 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:37,236 INFO  L124   PetriNetUnfolderBase]: 2075/3081 cut-off events.
[2024-06-04 18:12:37,236 INFO  L125   PetriNetUnfolderBase]: For 74753/74762 co-relation queries the response was YES.
[2024-06-04 18:12:37,245 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19559 conditions, 3081 events. 2075/3081 cut-off events. For 74753/74762 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14250 event pairs, 460 based on Foata normal form. 12/3091 useless extension candidates. Maximal degree in co-relation 19504. Up to 2406 conditions per place. 
[2024-06-04 18:12:37,256 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 134 selfloop transitions, 70 changer transitions 0/207 dead transitions.
[2024-06-04 18:12:37,256 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 207 transitions, 2420 flow
[2024-06-04 18:12:37,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:12:37,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:12:37,257 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions.
[2024-06-04 18:12:37,257 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4501108647450111
[2024-06-04 18:12:37,257 INFO  L175             Difference]: Start difference. First operand has 116 places, 140 transitions, 1402 flow. Second operand 11 states and 203 transitions.
[2024-06-04 18:12:37,258 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 207 transitions, 2420 flow
[2024-06-04 18:12:37,312 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 207 transitions, 2337 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-04 18:12:37,315 INFO  L231             Difference]: Finished difference. Result has 123 places, 152 transitions, 1651 flow
[2024-06-04 18:12:37,315 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1651, PETRI_PLACES=123, PETRI_TRANSITIONS=152}
[2024-06-04 18:12:37,315 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 81 predicate places.
[2024-06-04 18:12:37,315 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 152 transitions, 1651 flow
[2024-06-04 18:12:37,316 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-04 18:12:37,316 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:37,316 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:37,316 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 18:12:37,316 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:37,316 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:37,316 INFO  L85        PathProgramCache]: Analyzing trace with hash -1416429781, now seen corresponding path program 3 times
[2024-06-04 18:12:37,316 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:37,316 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439546888]
[2024-06-04 18:12:37,317 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:37,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:37,348 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:43,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:43,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:43,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439546888]
[2024-06-04 18:12:43,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439546888] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:43,443 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:43,443 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:43,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333889337]
[2024-06-04 18:12:43,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:43,444 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:43,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:43,444 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:43,444 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:43,585 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:12:43,586 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 152 transitions, 1651 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-04 18:12:43,586 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:43,586 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:12:43,586 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:44,407 INFO  L124   PetriNetUnfolderBase]: 2067/3069 cut-off events.
[2024-06-04 18:12:44,407 INFO  L125   PetriNetUnfolderBase]: For 81713/81722 co-relation queries the response was YES.
[2024-06-04 18:12:44,416 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20597 conditions, 3069 events. 2067/3069 cut-off events. For 81713/81722 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14124 event pairs, 537 based on Foata normal form. 10/3077 useless extension candidates. Maximal degree in co-relation 20539. Up to 2948 conditions per place. 
[2024-06-04 18:12:44,427 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 152 selfloop transitions, 24 changer transitions 0/179 dead transitions.
[2024-06-04 18:12:44,427 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 179 transitions, 2071 flow
[2024-06-04 18:12:44,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:12:44,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:12:44,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions.
[2024-06-04 18:12:44,429 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39939024390243905
[2024-06-04 18:12:44,430 INFO  L175             Difference]: Start difference. First operand has 123 places, 152 transitions, 1651 flow. Second operand 8 states and 131 transitions.
[2024-06-04 18:12:44,430 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 179 transitions, 2071 flow
[2024-06-04 18:12:44,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 179 transitions, 1894 flow, removed 53 selfloop flow, removed 6 redundant places.
[2024-06-04 18:12:44,500 INFO  L231             Difference]: Finished difference. Result has 125 places, 152 transitions, 1529 flow
[2024-06-04 18:12:44,500 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1529, PETRI_PLACES=125, PETRI_TRANSITIONS=152}
[2024-06-04 18:12:44,500 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places.
[2024-06-04 18:12:44,500 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 152 transitions, 1529 flow
[2024-06-04 18:12:44,501 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-04 18:12:44,501 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:44,501 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:44,501 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 18:12:44,501 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:44,502 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:44,502 INFO  L85        PathProgramCache]: Analyzing trace with hash -464860505, now seen corresponding path program 2 times
[2024-06-04 18:12:44,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:44,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269528960]
[2024-06-04 18:12:44,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:44,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:44,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:50,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:50,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:50,056 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269528960]
[2024-06-04 18:12:50,056 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269528960] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:50,056 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:50,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:50,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576274449]
[2024-06-04 18:12:50,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:50,057 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:50,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:50,057 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:50,058 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:50,197 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:12:50,197 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 152 transitions, 1529 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-04 18:12:50,197 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:50,197 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:12:50,197 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:51,298 INFO  L124   PetriNetUnfolderBase]: 2243/3315 cut-off events.
[2024-06-04 18:12:51,298 INFO  L125   PetriNetUnfolderBase]: For 93349/93358 co-relation queries the response was YES.
[2024-06-04 18:12:51,310 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22021 conditions, 3315 events. 2243/3315 cut-off events. For 93349/93358 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15335 event pairs, 479 based on Foata normal form. 16/3329 useless extension candidates. Maximal degree in co-relation 21961. Up to 2227 conditions per place. 
[2024-06-04 18:12:51,322 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 156 selfloop transitions, 77 changer transitions 0/236 dead transitions.
[2024-06-04 18:12:51,322 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 236 transitions, 2860 flow
[2024-06-04 18:12:51,323 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:12:51,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:12:51,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-04 18:12:51,324 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4959349593495935
[2024-06-04 18:12:51,324 INFO  L175             Difference]: Start difference. First operand has 125 places, 152 transitions, 1529 flow. Second operand 9 states and 183 transitions.
[2024-06-04 18:12:51,324 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 236 transitions, 2860 flow
[2024-06-04 18:12:51,399 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 236 transitions, 2797 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-04 18:12:51,401 INFO  L231             Difference]: Finished difference. Result has 131 places, 176 transitions, 2008 flow
[2024-06-04 18:12:51,401 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2008, PETRI_PLACES=131, PETRI_TRANSITIONS=176}
[2024-06-04 18:12:51,402 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 89 predicate places.
[2024-06-04 18:12:51,402 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 176 transitions, 2008 flow
[2024-06-04 18:12:51,402 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-04 18:12:51,402 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:51,403 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:51,403 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 18:12:51,403 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:51,403 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:51,403 INFO  L85        PathProgramCache]: Analyzing trace with hash -1301133837, now seen corresponding path program 3 times
[2024-06-04 18:12:51,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:51,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609002315]
[2024-06-04 18:12:51,403 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:51,403 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:51,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:56,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:56,650 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:56,650 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609002315]
[2024-06-04 18:12:56,650 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609002315] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:56,650 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:56,650 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:56,650 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626679510]
[2024-06-04 18:12:56,650 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:56,650 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:56,651 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:56,651 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:56,651 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:56,793 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:12:56,794 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 176 transitions, 2008 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-04 18:12:56,794 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:56,794 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:12:56,794 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:57,858 INFO  L124   PetriNetUnfolderBase]: 2339/3452 cut-off events.
[2024-06-04 18:12:57,858 INFO  L125   PetriNetUnfolderBase]: For 108731/108734 co-relation queries the response was YES.
[2024-06-04 18:12:57,868 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25193 conditions, 3452 events. 2339/3452 cut-off events. For 108731/108734 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16124 event pairs, 496 based on Foata normal form. 10/3459 useless extension candidates. Maximal degree in co-relation 25128. Up to 2536 conditions per place. 
[2024-06-04 18:12:57,881 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 166 selfloop transitions, 68 changer transitions 0/237 dead transitions.
[2024-06-04 18:12:57,881 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 237 transitions, 3141 flow
[2024-06-04 18:12:57,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:12:57,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:12:57,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-04 18:12:57,882 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49390243902439024
[2024-06-04 18:12:57,882 INFO  L175             Difference]: Start difference. First operand has 131 places, 176 transitions, 2008 flow. Second operand 8 states and 162 transitions.
[2024-06-04 18:12:57,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 237 transitions, 3141 flow
[2024-06-04 18:12:57,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 237 transitions, 3045 flow, removed 44 selfloop flow, removed 2 redundant places.
[2024-06-04 18:12:57,980 INFO  L231             Difference]: Finished difference. Result has 138 places, 187 transitions, 2262 flow
[2024-06-04 18:12:57,980 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2262, PETRI_PLACES=138, PETRI_TRANSITIONS=187}
[2024-06-04 18:12:57,980 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places.
[2024-06-04 18:12:57,981 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 187 transitions, 2262 flow
[2024-06-04 18:12:57,981 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-04 18:12:57,981 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:57,981 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:57,981 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 18:12:57,981 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:57,981 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:57,981 INFO  L85        PathProgramCache]: Analyzing trace with hash 1061708937, now seen corresponding path program 1 times
[2024-06-04 18:12:57,982 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:57,982 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732260362]
[2024-06-04 18:12:57,982 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:57,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:58,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:03,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-04 18:13:03,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:03,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732260362]
[2024-06-04 18:13:03,577 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732260362] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:03,577 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:03,577 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:13:03,577 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967058216]
[2024-06-04 18:13:03,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:03,577 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:13:03,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:03,578 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:13:03,578 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:13:03,755 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:13:03,756 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 187 transitions, 2262 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:03,756 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:03,756 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:13:03,756 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:04,926 INFO  L124   PetriNetUnfolderBase]: 2395/3539 cut-off events.
[2024-06-04 18:13:04,926 INFO  L125   PetriNetUnfolderBase]: For 121587/121596 co-relation queries the response was YES.
[2024-06-04 18:13:04,937 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26722 conditions, 3539 events. 2395/3539 cut-off events. For 121587/121596 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16751 event pairs, 486 based on Foata normal form. 18/3555 useless extension candidates. Maximal degree in co-relation 26654. Up to 3038 conditions per place. 
[2024-06-04 18:13:04,948 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 169 selfloop transitions, 56 changer transitions 0/228 dead transitions.
[2024-06-04 18:13:04,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 228 transitions, 3046 flow
[2024-06-04 18:13:04,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:13:04,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:13:04,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-04 18:13:04,949 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-04 18:13:04,950 INFO  L175             Difference]: Start difference. First operand has 138 places, 187 transitions, 2262 flow. Second operand 9 states and 162 transitions.
[2024-06-04 18:13:04,950 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 228 transitions, 3046 flow
[2024-06-04 18:13:05,051 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 228 transitions, 2861 flow, removed 33 selfloop flow, removed 5 redundant places.
[2024-06-04 18:13:05,054 INFO  L231             Difference]: Finished difference. Result has 142 places, 191 transitions, 2282 flow
[2024-06-04 18:13:05,054 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2077, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2282, PETRI_PLACES=142, PETRI_TRANSITIONS=191}
[2024-06-04 18:13:05,055 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places.
[2024-06-04 18:13:05,055 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 191 transitions, 2282 flow
[2024-06-04 18:13:05,055 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:05,055 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:05,055 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:05,056 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 18:13:05,056 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-04 18:13:05,056 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:05,056 INFO  L85        PathProgramCache]: Analyzing trace with hash 1061701993, now seen corresponding path program 4 times
[2024-06-04 18:13:05,056 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:05,057 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481022151]
[2024-06-04 18:13:05,057 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:05,057 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:05,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:10,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:10,741 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:10,741 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481022151]
[2024-06-04 18:13:10,741 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481022151] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:10,741 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:10,741 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:13:10,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999615024]
[2024-06-04 18:13:10,742 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:10,742 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:13:10,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:10,743 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:13:10,743 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:13:10,924 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:13:10,925 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 191 transitions, 2282 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-04 18:13:10,925 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:10,925 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:13:10,925 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:12,109 INFO  L124   PetriNetUnfolderBase]: 2555/3763 cut-off events.
[2024-06-04 18:13:12,110 INFO  L125   PetriNetUnfolderBase]: For 132426/132435 co-relation queries the response was YES.
[2024-06-04 18:13:12,121 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28540 conditions, 3763 events. 2555/3763 cut-off events. For 132426/132435 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17859 event pairs, 457 based on Foata normal form. 16/3777 useless extension candidates. Maximal degree in co-relation 28471. Up to 2776 conditions per place. 
[2024-06-04 18:13:12,135 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 178 selfloop transitions, 74 changer transitions 0/255 dead transitions.
[2024-06-04 18:13:12,135 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 255 transitions, 3508 flow
[2024-06-04 18:13:12,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:13:12,136 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:13:12,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-04 18:13:12,137 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46883468834688347
[2024-06-04 18:13:12,137 INFO  L175             Difference]: Start difference. First operand has 142 places, 191 transitions, 2282 flow. Second operand 9 states and 173 transitions.
[2024-06-04 18:13:12,137 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 255 transitions, 3508 flow
[2024-06-04 18:13:12,253 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 255 transitions, 3333 flow, removed 34 selfloop flow, removed 7 redundant places.
[2024-06-04 18:13:12,257 INFO  L231             Difference]: Finished difference. Result has 146 places, 206 transitions, 2571 flow
[2024-06-04 18:13:12,257 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2107, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2571, PETRI_PLACES=146, PETRI_TRANSITIONS=206}
[2024-06-04 18:13:12,258 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places.
[2024-06-04 18:13:12,258 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 206 transitions, 2571 flow
[2024-06-04 18:13:12,258 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-04 18:13:12,258 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:12,259 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:12,259 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 18:13:12,259 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:12,259 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:12,259 INFO  L85        PathProgramCache]: Analyzing trace with hash 1966490835, now seen corresponding path program 1 times
[2024-06-04 18:13:12,259 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:12,260 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207091560]
[2024-06-04 18:13:12,260 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:12,260 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:12,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:18,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:18,882 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:18,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207091560]
[2024-06-04 18:13:18,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207091560] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:18,882 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:18,882 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:13:18,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621320193]
[2024-06-04 18:13:18,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:18,882 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:13:18,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:18,883 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:13:18,883 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:13:18,982 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:13:18,982 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 206 transitions, 2571 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-04 18:13:18,983 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:18,983 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:13:18,984 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:19,936 INFO  L124   PetriNetUnfolderBase]: 2560/3769 cut-off events.
[2024-06-04 18:13:19,937 INFO  L125   PetriNetUnfolderBase]: For 139657/139657 co-relation queries the response was YES.
[2024-06-04 18:13:19,950 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29472 conditions, 3769 events. 2560/3769 cut-off events. For 139657/139657 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17839 event pairs, 649 based on Foata normal form. 1/3769 useless extension candidates. Maximal degree in co-relation 29400. Up to 3731 conditions per place. 
[2024-06-04 18:13:19,965 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 206 selfloop transitions, 17 changer transitions 0/226 dead transitions.
[2024-06-04 18:13:19,965 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 226 transitions, 3167 flow
[2024-06-04 18:13:19,965 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:13:19,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:13:19,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions.
[2024-06-04 18:13:19,966 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37630662020905925
[2024-06-04 18:13:19,966 INFO  L175             Difference]: Start difference. First operand has 146 places, 206 transitions, 2571 flow. Second operand 7 states and 108 transitions.
[2024-06-04 18:13:19,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 226 transitions, 3167 flow
[2024-06-04 18:13:20,092 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 226 transitions, 3014 flow, removed 43 selfloop flow, removed 4 redundant places.
[2024-06-04 18:13:20,095 INFO  L231             Difference]: Finished difference. Result has 149 places, 209 transitions, 2508 flow
[2024-06-04 18:13:20,095 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2418, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2508, PETRI_PLACES=149, PETRI_TRANSITIONS=209}
[2024-06-04 18:13:20,095 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places.
[2024-06-04 18:13:20,096 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 209 transitions, 2508 flow
[2024-06-04 18:13:20,096 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-04 18:13:20,096 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:20,096 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:20,096 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 18:13:20,096 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:20,096 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:20,096 INFO  L85        PathProgramCache]: Analyzing trace with hash -557001341, now seen corresponding path program 2 times
[2024-06-04 18:13:20,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:20,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708404239]
[2024-06-04 18:13:20,097 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:20,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:20,149 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:25,511 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:25,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:25,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708404239]
[2024-06-04 18:13:25,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708404239] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:25,512 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:25,512 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:13:25,512 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284868026]
[2024-06-04 18:13:25,512 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:25,512 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:13:25,512 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:25,513 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:13:25,513 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:13:25,639 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:13:25,640 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 209 transitions, 2508 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-04 18:13:25,640 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:25,640 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:13:25,640 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:26,907 INFO  L124   PetriNetUnfolderBase]: 2588/3813 cut-off events.
[2024-06-04 18:13:26,907 INFO  L125   PetriNetUnfolderBase]: For 147228/147228 co-relation queries the response was YES.
[2024-06-04 18:13:26,926 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29285 conditions, 3813 events. 2588/3813 cut-off events. For 147228/147228 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18122 event pairs, 637 based on Foata normal form. 6/3818 useless extension candidates. Maximal degree in co-relation 29212. Up to 3653 conditions per place. 
[2024-06-04 18:13:26,944 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 207 selfloop transitions, 30 changer transitions 0/240 dead transitions.
[2024-06-04 18:13:26,945 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 240 transitions, 3250 flow
[2024-06-04 18:13:26,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:13:26,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:13:26,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-04 18:13:26,946 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4115853658536585
[2024-06-04 18:13:26,946 INFO  L175             Difference]: Start difference. First operand has 149 places, 209 transitions, 2508 flow. Second operand 8 states and 135 transitions.
[2024-06-04 18:13:26,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 240 transitions, 3250 flow
[2024-06-04 18:13:27,046 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 240 transitions, 3130 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-04 18:13:27,049 INFO  L231             Difference]: Finished difference. Result has 151 places, 212 transitions, 2538 flow
[2024-06-04 18:13:27,049 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2388, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2538, PETRI_PLACES=151, PETRI_TRANSITIONS=212}
[2024-06-04 18:13:27,050 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 109 predicate places.
[2024-06-04 18:13:27,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 212 transitions, 2538 flow
[2024-06-04 18:13:27,050 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-04 18:13:27,050 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:27,050 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:27,050 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 18:13:27,050 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:27,050 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:27,050 INFO  L85        PathProgramCache]: Analyzing trace with hash -2128610807, now seen corresponding path program 3 times
[2024-06-04 18:13:27,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:27,051 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084720614]
[2024-06-04 18:13:27,051 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:27,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:27,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:32,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:32,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:32,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084720614]
[2024-06-04 18:13:32,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084720614] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:32,332 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:32,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:13:32,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134727586]
[2024-06-04 18:13:32,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:32,332 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:13:32,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:32,333 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:13:32,333 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:13:32,437 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:13:32,438 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 212 transitions, 2538 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:32,438 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:32,438 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:13:32,438 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:33,633 INFO  L124   PetriNetUnfolderBase]: 2616/3857 cut-off events.
[2024-06-04 18:13:33,633 INFO  L125   PetriNetUnfolderBase]: For 156016/156016 co-relation queries the response was YES.
[2024-06-04 18:13:33,645 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30122 conditions, 3857 events. 2616/3857 cut-off events. For 156016/156016 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18389 event pairs, 640 based on Foata normal form. 6/3862 useless extension candidates. Maximal degree in co-relation 30048. Up to 3757 conditions per place. 
[2024-06-04 18:13:33,658 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 214 selfloop transitions, 24 changer transitions 0/241 dead transitions.
[2024-06-04 18:13:33,658 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 241 transitions, 3224 flow
[2024-06-04 18:13:33,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:13:33,659 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:13:33,659 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-04 18:13:33,660 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4024390243902439
[2024-06-04 18:13:33,660 INFO  L175             Difference]: Start difference. First operand has 151 places, 212 transitions, 2538 flow. Second operand 8 states and 132 transitions.
[2024-06-04 18:13:33,660 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 241 transitions, 3224 flow
[2024-06-04 18:13:33,775 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 241 transitions, 3094 flow, removed 37 selfloop flow, removed 6 redundant places.
[2024-06-04 18:13:33,778 INFO  L231             Difference]: Finished difference. Result has 153 places, 215 transitions, 2552 flow
[2024-06-04 18:13:33,778 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2408, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2552, PETRI_PLACES=153, PETRI_TRANSITIONS=215}
[2024-06-04 18:13:33,778 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 111 predicate places.
[2024-06-04 18:13:33,779 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 215 transitions, 2552 flow
[2024-06-04 18:13:33,779 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:33,779 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:33,779 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:33,779 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 18:13:33,779 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:33,780 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:33,780 INFO  L85        PathProgramCache]: Analyzing trace with hash -2128617751, now seen corresponding path program 5 times
[2024-06-04 18:13:33,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:33,780 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512743894]
[2024-06-04 18:13:33,780 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:33,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:33,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:38,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:38,764 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:38,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512743894]
[2024-06-04 18:13:38,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512743894] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:38,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:38,764 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:13:38,764 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455980032]
[2024-06-04 18:13:38,764 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:38,765 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:13:38,765 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:38,765 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:13:38,765 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:13:38,944 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:13:38,944 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 215 transitions, 2552 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-04 18:13:38,944 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:38,944 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:13:38,944 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:40,168 INFO  L124   PetriNetUnfolderBase]: 2757/4055 cut-off events.
[2024-06-04 18:13:40,168 INFO  L125   PetriNetUnfolderBase]: For 171829/171838 co-relation queries the response was YES.
[2024-06-04 18:13:40,186 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31643 conditions, 4055 events. 2757/4055 cut-off events. For 171829/171838 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19503 event pairs, 638 based on Foata normal form. 19/4072 useless extension candidates. Maximal degree in co-relation 31568. Up to 3660 conditions per place. 
[2024-06-04 18:13:40,204 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 222 selfloop transitions, 48 changer transitions 0/273 dead transitions.
[2024-06-04 18:13:40,204 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 273 transitions, 3860 flow
[2024-06-04 18:13:40,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:13:40,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:13:40,205 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-04 18:13:40,205 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603658536585366
[2024-06-04 18:13:40,205 INFO  L175             Difference]: Start difference. First operand has 153 places, 215 transitions, 2552 flow. Second operand 8 states and 151 transitions.
[2024-06-04 18:13:40,205 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 273 transitions, 3860 flow
[2024-06-04 18:13:40,342 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 273 transitions, 3740 flow, removed 38 selfloop flow, removed 6 redundant places.
[2024-06-04 18:13:40,346 INFO  L231             Difference]: Finished difference. Result has 158 places, 234 transitions, 2947 flow
[2024-06-04 18:13:40,346 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2432, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2947, PETRI_PLACES=158, PETRI_TRANSITIONS=234}
[2024-06-04 18:13:40,347 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 116 predicate places.
[2024-06-04 18:13:40,347 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 234 transitions, 2947 flow
[2024-06-04 18:13:40,347 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-04 18:13:40,347 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:40,347 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:40,347 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 18:13:40,348 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-04 18:13:40,348 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:40,348 INFO  L85        PathProgramCache]: Analyzing trace with hash 1245587693, now seen corresponding path program 1 times
[2024-06-04 18:13:40,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:40,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868144199]
[2024-06-04 18:13:40,348 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:40,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:40,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:45,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:45,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:45,674 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868144199]
[2024-06-04 18:13:45,674 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868144199] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:45,674 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:45,674 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:13:45,674 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571579951]
[2024-06-04 18:13:45,674 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:45,675 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:13:45,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:45,675 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:13:45,675 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:13:45,837 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:13:45,838 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 234 transitions, 2947 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-04 18:13:45,838 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:45,838 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:13:45,838 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:46,919 INFO  L124   PetriNetUnfolderBase]: 2748/4042 cut-off events.
[2024-06-04 18:13:46,919 INFO  L125   PetriNetUnfolderBase]: For 175240/175246 co-relation queries the response was YES.
[2024-06-04 18:13:46,935 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32244 conditions, 4042 events. 2748/4042 cut-off events. For 175240/175246 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19406 event pairs, 645 based on Foata normal form. 7/4047 useless extension candidates. Maximal degree in co-relation 32165. Up to 3887 conditions per place. 
[2024-06-04 18:13:46,951 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 219 selfloop transitions, 38 changer transitions 0/260 dead transitions.
[2024-06-04 18:13:46,952 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 260 transitions, 3643 flow
[2024-06-04 18:13:46,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:13:46,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:13:46,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-04 18:13:46,953 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4024390243902439
[2024-06-04 18:13:46,953 INFO  L175             Difference]: Start difference. First operand has 158 places, 234 transitions, 2947 flow. Second operand 8 states and 132 transitions.
[2024-06-04 18:13:46,953 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 260 transitions, 3643 flow
[2024-06-04 18:13:47,120 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 260 transitions, 3521 flow, removed 60 selfloop flow, removed 1 redundant places.
[2024-06-04 18:13:47,123 INFO  L231             Difference]: Finished difference. Result has 165 places, 237 transitions, 2977 flow
[2024-06-04 18:13:47,123 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2827, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2977, PETRI_PLACES=165, PETRI_TRANSITIONS=237}
[2024-06-04 18:13:47,124 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 123 predicate places.
[2024-06-04 18:13:47,124 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 237 transitions, 2977 flow
[2024-06-04 18:13:47,124 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-04 18:13:47,124 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:47,124 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:47,124 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 18:13:47,125 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-04 18:13:47,125 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:47,125 INFO  L85        PathProgramCache]: Analyzing trace with hash 1245884611, now seen corresponding path program 4 times
[2024-06-04 18:13:47,125 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:47,125 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258253072]
[2024-06-04 18:13:47,125 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:47,125 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:47,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:52,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:52,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:52,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258253072]
[2024-06-04 18:13:52,145 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258253072] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:52,145 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:52,145 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:13:52,145 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845367110]
[2024-06-04 18:13:52,145 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:52,145 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:13:52,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:52,145 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:13:52,146 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:13:52,290 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:13:52,290 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 237 transitions, 2977 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:52,290 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:52,290 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:13:52,291 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:53,458 INFO  L124   PetriNetUnfolderBase]: 2776/4085 cut-off events.
[2024-06-04 18:13:53,459 INFO  L125   PetriNetUnfolderBase]: For 184136/184136 co-relation queries the response was YES.
[2024-06-04 18:13:53,474 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32688 conditions, 4085 events. 2776/4085 cut-off events. For 184136/184136 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19678 event pairs, 656 based on Foata normal form. 6/4090 useless extension candidates. Maximal degree in co-relation 32606. Up to 3957 conditions per place. 
[2024-06-04 18:13:53,488 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 235 selfloop transitions, 28 changer transitions 0/266 dead transitions.
[2024-06-04 18:13:53,488 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 266 transitions, 3727 flow
[2024-06-04 18:13:53,489 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:13:53,489 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:13:53,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-04 18:13:53,489 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4054878048780488
[2024-06-04 18:13:53,490 INFO  L175             Difference]: Start difference. First operand has 165 places, 237 transitions, 2977 flow. Second operand 8 states and 133 transitions.
[2024-06-04 18:13:53,490 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 266 transitions, 3727 flow
[2024-06-04 18:13:53,674 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 266 transitions, 3603 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-04 18:13:53,678 INFO  L231             Difference]: Finished difference. Result has 167 places, 240 transitions, 3015 flow
[2024-06-04 18:13:53,678 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2853, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3015, PETRI_PLACES=167, PETRI_TRANSITIONS=240}
[2024-06-04 18:13:53,678 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places.
[2024-06-04 18:13:53,678 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 240 transitions, 3015 flow
[2024-06-04 18:13:53,678 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:53,678 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:53,678 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:53,679 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 18:13:53,679 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:53,679 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:53,679 INFO  L85        PathProgramCache]: Analyzing trace with hash -2128380167, now seen corresponding path program 5 times
[2024-06-04 18:13:53,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:53,679 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185366377]
[2024-06-04 18:13:53,679 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:53,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:53,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:59,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:59,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:59,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185366377]
[2024-06-04 18:13:59,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185366377] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:59,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:59,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:13:59,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279231042]
[2024-06-04 18:13:59,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:59,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:13:59,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:59,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:13:59,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:13:59,468 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:13:59,468 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 240 transitions, 3015 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:59,468 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:59,468 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:13:59,468 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:00,676 INFO  L124   PetriNetUnfolderBase]: 2779/4090 cut-off events.
[2024-06-04 18:14:00,676 INFO  L125   PetriNetUnfolderBase]: For 192683/192683 co-relation queries the response was YES.
[2024-06-04 18:14:00,694 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32947 conditions, 4090 events. 2779/4090 cut-off events. For 192683/192683 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19692 event pairs, 666 based on Foata normal form. 6/4095 useless extension candidates. Maximal degree in co-relation 32864. Up to 3931 conditions per place. 
[2024-06-04 18:14:00,712 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 230 selfloop transitions, 38 changer transitions 0/271 dead transitions.
[2024-06-04 18:14:00,712 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 271 transitions, 3789 flow
[2024-06-04 18:14:00,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:14:00,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:14:00,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions.
[2024-06-04 18:14:00,713 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375609756097561
[2024-06-04 18:14:00,713 INFO  L175             Difference]: Start difference. First operand has 167 places, 240 transitions, 3015 flow. Second operand 10 states and 154 transitions.
[2024-06-04 18:14:00,713 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 271 transitions, 3789 flow
[2024-06-04 18:14:00,906 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 271 transitions, 3649 flow, removed 44 selfloop flow, removed 6 redundant places.
[2024-06-04 18:14:00,910 INFO  L231             Difference]: Finished difference. Result has 171 places, 243 transitions, 3067 flow
[2024-06-04 18:14:00,910 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3067, PETRI_PLACES=171, PETRI_TRANSITIONS=243}
[2024-06-04 18:14:00,911 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places.
[2024-06-04 18:14:00,911 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 243 transitions, 3067 flow
[2024-06-04 18:14:00,911 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:00,911 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:00,911 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:00,911 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 18:14:00,911 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:00,912 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:00,912 INFO  L85        PathProgramCache]: Analyzing trace with hash -1392365019, now seen corresponding path program 2 times
[2024-06-04 18:14:00,912 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:00,912 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344634712]
[2024-06-04 18:14:00,912 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:00,912 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:00,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:06,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:06,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:06,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344634712]
[2024-06-04 18:14:06,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344634712] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:06,685 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:06,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:14:06,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672115939]
[2024-06-04 18:14:06,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:06,686 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:14:06,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:06,686 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:14:06,686 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:14:06,786 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:14:06,786 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 243 transitions, 3067 flow. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:06,786 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:06,786 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:14:06,786 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:07,827 INFO  L124   PetriNetUnfolderBase]: 2776/4086 cut-off events.
[2024-06-04 18:14:07,827 INFO  L125   PetriNetUnfolderBase]: For 196406/196406 co-relation queries the response was YES.
[2024-06-04 18:14:07,842 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33118 conditions, 4086 events. 2776/4086 cut-off events. For 196406/196406 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19684 event pairs, 667 based on Foata normal form. 1/4086 useless extension candidates. Maximal degree in co-relation 33034. Up to 4067 conditions per place. 
[2024-06-04 18:14:07,857 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 238 selfloop transitions, 11 changer transitions 0/252 dead transitions.
[2024-06-04 18:14:07,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 252 transitions, 3587 flow
[2024-06-04 18:14:07,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:14:07,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:14:07,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions.
[2024-06-04 18:14:07,858 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3617886178861789
[2024-06-04 18:14:07,858 INFO  L175             Difference]: Start difference. First operand has 171 places, 243 transitions, 3067 flow. Second operand 6 states and 89 transitions.
[2024-06-04 18:14:07,859 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 252 transitions, 3587 flow
[2024-06-04 18:14:08,058 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 252 transitions, 3413 flow, removed 53 selfloop flow, removed 8 redundant places.
[2024-06-04 18:14:08,062 INFO  L231             Difference]: Finished difference. Result has 169 places, 243 transitions, 2921 flow
[2024-06-04 18:14:08,062 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2893, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2921, PETRI_PLACES=169, PETRI_TRANSITIONS=243}
[2024-06-04 18:14:08,062 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 127 predicate places.
[2024-06-04 18:14:08,062 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 243 transitions, 2921 flow
[2024-06-04 18:14:08,063 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:08,063 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:08,063 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:08,063 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 18:14:08,063 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:08,063 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:08,063 INFO  L85        PathProgramCache]: Analyzing trace with hash -1392566457, now seen corresponding path program 1 times
[2024-06-04 18:14:08,064 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:08,064 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439597155]
[2024-06-04 18:14:08,064 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:08,064 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:08,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:16,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:16,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:16,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439597155]
[2024-06-04 18:14:16,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439597155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:16,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:16,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:16,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007499343]
[2024-06-04 18:14:16,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:16,688 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:16,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:16,689 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:16,689 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:16,794 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:14:16,795 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 243 transitions, 2921 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-04 18:14:16,795 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:16,795 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:14:16,795 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:17,886 INFO  L124   PetriNetUnfolderBase]: 2775/4085 cut-off events.
[2024-06-04 18:14:17,886 INFO  L125   PetriNetUnfolderBase]: For 191031/191031 co-relation queries the response was YES.
[2024-06-04 18:14:17,901 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32427 conditions, 4085 events. 2775/4085 cut-off events. For 191031/191031 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19699 event pairs, 676 based on Foata normal form. 3/4087 useless extension candidates. Maximal degree in co-relation 32342. Up to 4017 conditions per place. 
[2024-06-04 18:14:17,915 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 235 selfloop transitions, 26 changer transitions 0/264 dead transitions.
[2024-06-04 18:14:17,916 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 264 transitions, 3608 flow
[2024-06-04 18:14:17,916 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:14:17,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:14:17,917 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions.
[2024-06-04 18:14:17,917 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375
[2024-06-04 18:14:17,917 INFO  L175             Difference]: Start difference. First operand has 169 places, 243 transitions, 2921 flow. Second operand 8 states and 123 transitions.
[2024-06-04 18:14:17,917 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 264 transitions, 3608 flow
[2024-06-04 18:14:18,061 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 264 transitions, 3576 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-04 18:14:18,064 INFO  L231             Difference]: Finished difference. Result has 172 places, 246 transitions, 3003 flow
[2024-06-04 18:14:18,064 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2889, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3003, PETRI_PLACES=172, PETRI_TRANSITIONS=246}
[2024-06-04 18:14:18,065 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places.
[2024-06-04 18:14:18,065 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 246 transitions, 3003 flow
[2024-06-04 18:14:18,065 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-04 18:14:18,065 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:18,065 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:18,065 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 18:14:18,065 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:18,065 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:18,066 INFO  L85        PathProgramCache]: Analyzing trace with hash -1392359067, now seen corresponding path program 2 times
[2024-06-04 18:14:18,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:18,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798602341]
[2024-06-04 18:14:18,066 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:18,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:18,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:26,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-04 18:14:26,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:26,711 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798602341]
[2024-06-04 18:14:26,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798602341] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:26,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:26,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:26,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012266202]
[2024-06-04 18:14:26,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:26,712 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:26,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:26,712 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:26,712 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:26,818 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:14:26,818 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 246 transitions, 3003 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-04 18:14:26,818 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:26,818 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:14:26,819 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:27,776 INFO  L124   PetriNetUnfolderBase]: 2738/4029 cut-off events.
[2024-06-04 18:14:27,776 INFO  L125   PetriNetUnfolderBase]: For 197522/197528 co-relation queries the response was YES.
[2024-06-04 18:14:27,794 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32297 conditions, 4029 events. 2738/4029 cut-off events. For 197522/197528 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19355 event pairs, 659 based on Foata normal form. 5/4032 useless extension candidates. Maximal degree in co-relation 32211. Up to 3963 conditions per place. 
[2024-06-04 18:14:27,891 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 230 selfloop transitions, 26 changer transitions 0/259 dead transitions.
[2024-06-04 18:14:27,891 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 259 transitions, 3547 flow
[2024-06-04 18:14:27,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:14:27,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:14:27,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-04 18:14:27,892 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3797909407665505
[2024-06-04 18:14:27,892 INFO  L175             Difference]: Start difference. First operand has 172 places, 246 transitions, 3003 flow. Second operand 7 states and 109 transitions.
[2024-06-04 18:14:27,892 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 259 transitions, 3547 flow
[2024-06-04 18:14:28,059 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 259 transitions, 3489 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-06-04 18:14:28,062 INFO  L231             Difference]: Finished difference. Result has 173 places, 246 transitions, 3003 flow
[2024-06-04 18:14:28,062 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2945, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3003, PETRI_PLACES=173, PETRI_TRANSITIONS=246}
[2024-06-04 18:14:28,063 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 131 predicate places.
[2024-06-04 18:14:28,063 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 246 transitions, 3003 flow
[2024-06-04 18:14:28,063 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-04 18:14:28,063 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:28,063 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:28,063 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 18:14:28,064 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:28,064 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:28,064 INFO  L85        PathProgramCache]: Analyzing trace with hash -820110667, now seen corresponding path program 1 times
[2024-06-04 18:14:28,064 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:28,065 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671351471]
[2024-06-04 18:14:28,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:28,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:28,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:33,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:33,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:33,630 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671351471]
[2024-06-04 18:14:33,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671351471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:33,630 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:33,630 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:14:33,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510997267]
[2024-06-04 18:14:33,630 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:33,630 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:14:33,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:33,631 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:14:33,631 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:14:33,831 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:14:33,831 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 246 transitions, 3003 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-04 18:14:33,832 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:33,832 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:14:33,832 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:35,195 INFO  L124   PetriNetUnfolderBase]: 3076/4568 cut-off events.
[2024-06-04 18:14:35,195 INFO  L125   PetriNetUnfolderBase]: For 256147/256150 co-relation queries the response was YES.
[2024-06-04 18:14:35,212 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37838 conditions, 4568 events. 3076/4568 cut-off events. For 256147/256150 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 23020 event pairs, 417 based on Foata normal form. 26/4591 useless extension candidates. Maximal degree in co-relation 37751. Up to 2783 conditions per place. 
[2024-06-04 18:14:35,228 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 231 selfloop transitions, 77 changer transitions 0/311 dead transitions.
[2024-06-04 18:14:35,228 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 311 transitions, 4458 flow
[2024-06-04 18:14:35,229 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:14:35,229 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:14:35,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-04 18:14:35,229 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47696476964769646
[2024-06-04 18:14:35,229 INFO  L175             Difference]: Start difference. First operand has 173 places, 246 transitions, 3003 flow. Second operand 9 states and 176 transitions.
[2024-06-04 18:14:35,229 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 311 transitions, 4458 flow
[2024-06-04 18:14:35,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 311 transitions, 4396 flow, removed 1 selfloop flow, removed 6 redundant places.
[2024-06-04 18:14:35,482 INFO  L231             Difference]: Finished difference. Result has 178 places, 252 transitions, 3321 flow
[2024-06-04 18:14:35,482 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2941, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3321, PETRI_PLACES=178, PETRI_TRANSITIONS=252}
[2024-06-04 18:14:35,483 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places.
[2024-06-04 18:14:35,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 252 transitions, 3321 flow
[2024-06-04 18:14:35,483 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-04 18:14:35,483 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:35,484 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:35,484 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 18:14:35,484 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:35,484 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:35,484 INFO  L85        PathProgramCache]: Analyzing trace with hash -818232997, now seen corresponding path program 2 times
[2024-06-04 18:14:35,485 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:35,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411553586]
[2024-06-04 18:14:35,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:35,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:35,517 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:41,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:41,403 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:41,403 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411553586]
[2024-06-04 18:14:41,403 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411553586] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:41,403 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:41,403 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:14:41,403 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759865681]
[2024-06-04 18:14:41,403 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:41,404 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:14:41,404 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:41,404 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:14:41,404 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:14:41,549 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:14:41,549 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 252 transitions, 3321 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-04 18:14:41,549 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:41,549 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:14:41,549 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:43,060 INFO  L124   PetriNetUnfolderBase]: 3260/4856 cut-off events.
[2024-06-04 18:14:43,060 INFO  L125   PetriNetUnfolderBase]: For 290113/290119 co-relation queries the response was YES.
[2024-06-04 18:14:43,083 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41164 conditions, 4856 events. 3260/4856 cut-off events. For 290113/290119 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 24919 event pairs, 639 based on Foata normal form. 34/4888 useless extension candidates. Maximal degree in co-relation 41074. Up to 3912 conditions per place. 
[2024-06-04 18:14:43,103 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 228 selfloop transitions, 82 changer transitions 0/313 dead transitions.
[2024-06-04 18:14:43,104 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 313 transitions, 4497 flow
[2024-06-04 18:14:43,106 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:14:43,106 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:14:43,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions.
[2024-06-04 18:14:43,107 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44634146341463415
[2024-06-04 18:14:43,107 INFO  L175             Difference]: Start difference. First operand has 178 places, 252 transitions, 3321 flow. Second operand 10 states and 183 transitions.
[2024-06-04 18:14:43,107 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 313 transitions, 4497 flow
[2024-06-04 18:14:43,450 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 313 transitions, 4322 flow, removed 44 selfloop flow, removed 4 redundant places.
[2024-06-04 18:14:43,455 INFO  L231             Difference]: Finished difference. Result has 186 places, 262 transitions, 3498 flow
[2024-06-04 18:14:43,455 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3152, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3498, PETRI_PLACES=186, PETRI_TRANSITIONS=262}
[2024-06-04 18:14:43,455 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places.
[2024-06-04 18:14:43,456 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 262 transitions, 3498 flow
[2024-06-04 18:14:43,456 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-04 18:14:43,456 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:43,456 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:43,456 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 18:14:43,456 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:43,457 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:43,457 INFO  L85        PathProgramCache]: Analyzing trace with hash -818236717, now seen corresponding path program 3 times
[2024-06-04 18:14:43,457 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:43,457 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386463392]
[2024-06-04 18:14:43,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:43,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:43,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:49,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:49,165 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:49,165 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386463392]
[2024-06-04 18:14:49,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386463392] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:49,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:49,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:14:49,166 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057772878]
[2024-06-04 18:14:49,166 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:49,166 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:14:49,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:49,166 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:14:49,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:14:49,315 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:14:49,315 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 262 transitions, 3498 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-04 18:14:49,315 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:49,315 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:14:49,315 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:51,153 INFO  L124   PetriNetUnfolderBase]: 3981/5995 cut-off events.
[2024-06-04 18:14:51,153 INFO  L125   PetriNetUnfolderBase]: For 392834/392840 co-relation queries the response was YES.
[2024-06-04 18:14:51,178 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49981 conditions, 5995 events. 3981/5995 cut-off events. For 392834/392840 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 32069 event pairs, 787 based on Foata normal form. 68/6061 useless extension candidates. Maximal degree in co-relation 49887. Up to 3175 conditions per place. 
[2024-06-04 18:14:51,201 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 214 selfloop transitions, 125 changer transitions 0/342 dead transitions.
[2024-06-04 18:14:51,201 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 342 transitions, 5084 flow
[2024-06-04 18:14:51,201 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:14:51,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:14:51,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions.
[2024-06-04 18:14:51,202 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4951219512195122
[2024-06-04 18:14:51,202 INFO  L175             Difference]: Start difference. First operand has 186 places, 262 transitions, 3498 flow. Second operand 10 states and 203 transitions.
[2024-06-04 18:14:51,202 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 342 transitions, 5084 flow
[2024-06-04 18:14:51,514 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 342 transitions, 4912 flow, removed 30 selfloop flow, removed 5 redundant places.
[2024-06-04 18:14:51,519 INFO  L231             Difference]: Finished difference. Result has 194 places, 272 transitions, 3885 flow
[2024-06-04 18:14:51,519 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3326, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3885, PETRI_PLACES=194, PETRI_TRANSITIONS=272}
[2024-06-04 18:14:51,519 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places.
[2024-06-04 18:14:51,519 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 272 transitions, 3885 flow
[2024-06-04 18:14:51,520 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-04 18:14:51,520 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:51,520 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:51,520 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 18:14:51,520 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:51,520 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:51,521 INFO  L85        PathProgramCache]: Analyzing trace with hash -959501355, now seen corresponding path program 4 times
[2024-06-04 18:14:51,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:51,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845438804]
[2024-06-04 18:14:51,521 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:51,521 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:51,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:57,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:57,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:57,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845438804]
[2024-06-04 18:14:57,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845438804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:57,725 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:57,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:14:57,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240939004]
[2024-06-04 18:14:57,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:57,726 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:14:57,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:57,727 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:14:57,727 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:14:57,880 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:14:57,880 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 272 transitions, 3885 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-04 18:14:57,880 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:57,880 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:14:57,881 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:59,749 INFO  L124   PetriNetUnfolderBase]: 4141/6251 cut-off events.
[2024-06-04 18:14:59,749 INFO  L125   PetriNetUnfolderBase]: For 407316/407322 co-relation queries the response was YES.
[2024-06-04 18:14:59,775 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54269 conditions, 6251 events. 4141/6251 cut-off events. For 407316/407322 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 34146 event pairs, 1058 based on Foata normal form. 34/6283 useless extension candidates. Maximal degree in co-relation 54171. Up to 5593 conditions per place. 
[2024-06-04 18:14:59,797 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 258 selfloop transitions, 62 changer transitions 0/323 dead transitions.
[2024-06-04 18:14:59,797 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 323 transitions, 4962 flow
[2024-06-04 18:14:59,798 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:14:59,798 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:14:59,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions.
[2024-06-04 18:14:59,798 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43658536585365854
[2024-06-04 18:14:59,798 INFO  L175             Difference]: Start difference. First operand has 194 places, 272 transitions, 3885 flow. Second operand 10 states and 179 transitions.
[2024-06-04 18:14:59,798 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 323 transitions, 4962 flow
[2024-06-04 18:15:00,255 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 323 transitions, 4788 flow, removed 48 selfloop flow, removed 4 redundant places.
[2024-06-04 18:15:00,259 INFO  L231             Difference]: Finished difference. Result has 201 places, 278 transitions, 3989 flow
[2024-06-04 18:15:00,259 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3711, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3989, PETRI_PLACES=201, PETRI_TRANSITIONS=278}
[2024-06-04 18:15:00,260 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places.
[2024-06-04 18:15:00,260 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 278 transitions, 3989 flow
[2024-06-04 18:15:00,260 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-04 18:15:00,260 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:00,260 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:00,260 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 18:15:00,260 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:00,261 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:00,261 INFO  L85        PathProgramCache]: Analyzing trace with hash -731541187, now seen corresponding path program 5 times
[2024-06-04 18:15:00,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:00,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737385226]
[2024-06-04 18:15:00,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:00,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:00,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:06,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:06,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:06,178 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737385226]
[2024-06-04 18:15:06,178 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737385226] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:06,178 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:06,178 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:06,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265251725]
[2024-06-04 18:15:06,178 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:06,178 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:06,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:06,179 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:06,179 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:06,319 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:15:06,319 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 278 transitions, 3989 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-04 18:15:06,319 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:06,319 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:15:06,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:08,313 INFO  L124   PetriNetUnfolderBase]: 4265/6455 cut-off events.
[2024-06-04 18:15:08,314 INFO  L125   PetriNetUnfolderBase]: For 424726/424732 co-relation queries the response was YES.
[2024-06-04 18:15:08,341 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56018 conditions, 6455 events. 4265/6455 cut-off events. For 424726/424732 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 35631 event pairs, 1078 based on Foata normal form. 34/6487 useless extension candidates. Maximal degree in co-relation 55917. Up to 5488 conditions per place. 
[2024-06-04 18:15:08,367 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 251 selfloop transitions, 77 changer transitions 0/331 dead transitions.
[2024-06-04 18:15:08,367 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 331 transitions, 5150 flow
[2024-06-04 18:15:08,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:15:08,368 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:15:08,368 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions.
[2024-06-04 18:15:08,368 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44124168514412415
[2024-06-04 18:15:08,368 INFO  L175             Difference]: Start difference. First operand has 201 places, 278 transitions, 3989 flow. Second operand 11 states and 199 transitions.
[2024-06-04 18:15:08,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 331 transitions, 5150 flow
[2024-06-04 18:15:08,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 331 transitions, 4965 flow, removed 35 selfloop flow, removed 7 redundant places.
[2024-06-04 18:15:08,771 INFO  L231             Difference]: Finished difference. Result has 205 places, 280 transitions, 4071 flow
[2024-06-04 18:15:08,771 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3804, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4071, PETRI_PLACES=205, PETRI_TRANSITIONS=280}
[2024-06-04 18:15:08,772 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 163 predicate places.
[2024-06-04 18:15:08,772 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 280 transitions, 4071 flow
[2024-06-04 18:15:08,772 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-04 18:15:08,773 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:08,773 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:08,773 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 18:15:08,773 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:08,773 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:08,773 INFO  L85        PathProgramCache]: Analyzing trace with hash -731544907, now seen corresponding path program 6 times
[2024-06-04 18:15:08,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:08,774 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265276286]
[2024-06-04 18:15:08,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:08,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:08,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:15,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:15,004 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:15,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265276286]
[2024-06-04 18:15:15,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265276286] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:15,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:15,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:15,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497088498]
[2024-06-04 18:15:15,004 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:15,004 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:15,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:15,005 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:15,005 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:15,172 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:15:15,172 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 280 transitions, 4071 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-04 18:15:15,172 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:15,172 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:15:15,172 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:17,252 INFO  L124   PetriNetUnfolderBase]: 4459/6761 cut-off events.
[2024-06-04 18:15:17,252 INFO  L125   PetriNetUnfolderBase]: For 447400/447406 co-relation queries the response was YES.
[2024-06-04 18:15:17,282 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59463 conditions, 6761 events. 4459/6761 cut-off events. For 447400/447406 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 37744 event pairs, 1144 based on Foata normal form. 28/6787 useless extension candidates. Maximal degree in co-relation 59361. Up to 5468 conditions per place. 
[2024-06-04 18:15:17,308 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 260 selfloop transitions, 73 changer transitions 0/336 dead transitions.
[2024-06-04 18:15:17,308 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 336 transitions, 5441 flow
[2024-06-04 18:15:17,309 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:15:17,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:15:17,310 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions.
[2024-06-04 18:15:17,310 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-04 18:15:17,310 INFO  L175             Difference]: Start difference. First operand has 205 places, 280 transitions, 4071 flow. Second operand 10 states and 185 transitions.
[2024-06-04 18:15:17,310 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 336 transitions, 5441 flow
[2024-06-04 18:15:17,830 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 336 transitions, 5143 flow, removed 45 selfloop flow, removed 12 redundant places.
[2024-06-04 18:15:17,836 INFO  L231             Difference]: Finished difference. Result has 204 places, 285 transitions, 4143 flow
[2024-06-04 18:15:17,837 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3787, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4143, PETRI_PLACES=204, PETRI_TRANSITIONS=285}
[2024-06-04 18:15:17,837 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places.
[2024-06-04 18:15:17,837 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 285 transitions, 4143 flow
[2024-06-04 18:15:17,837 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-04 18:15:17,838 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:17,838 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:17,838 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 18:15:17,838 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-04 18:15:17,838 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:17,838 INFO  L85        PathProgramCache]: Analyzing trace with hash 831376561, now seen corresponding path program 1 times
[2024-06-04 18:15:17,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:17,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899141106]
[2024-06-04 18:15:17,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:17,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:17,872 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:24,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-04 18:15:24,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:24,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899141106]
[2024-06-04 18:15:24,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899141106] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:24,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:24,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:15:24,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869405413]
[2024-06-04 18:15:24,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:24,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:15:24,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:24,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:15:24,358 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:15:24,464 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:15:24,464 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 285 transitions, 4143 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-04 18:15:24,464 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:24,464 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:15:24,464 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:26,254 INFO  L124   PetriNetUnfolderBase]: 4479/6789 cut-off events.
[2024-06-04 18:15:26,255 INFO  L125   PetriNetUnfolderBase]: For 422853/422859 co-relation queries the response was YES.
[2024-06-04 18:15:26,287 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59153 conditions, 6789 events. 4479/6789 cut-off events. For 422853/422859 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 37973 event pairs, 1262 based on Foata normal form. 8/6795 useless extension candidates. Maximal degree in co-relation 59051. Up to 6333 conditions per place. 
[2024-06-04 18:15:26,314 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 252 selfloop transitions, 66 changer transitions 0/321 dead transitions.
[2024-06-04 18:15:26,314 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 321 transitions, 5138 flow
[2024-06-04 18:15:26,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:15:26,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:15:26,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-04 18:15:26,315 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-04 18:15:26,315 INFO  L175             Difference]: Start difference. First operand has 204 places, 285 transitions, 4143 flow. Second operand 8 states and 144 transitions.
[2024-06-04 18:15:26,315 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 321 transitions, 5138 flow
[2024-06-04 18:15:26,846 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 321 transitions, 4947 flow, removed 51 selfloop flow, removed 6 redundant places.
[2024-06-04 18:15:26,850 INFO  L231             Difference]: Finished difference. Result has 206 places, 290 transitions, 4202 flow
[2024-06-04 18:15:26,850 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3957, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4202, PETRI_PLACES=206, PETRI_TRANSITIONS=290}
[2024-06-04 18:15:26,851 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places.
[2024-06-04 18:15:26,851 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 290 transitions, 4202 flow
[2024-06-04 18:15:26,851 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-04 18:15:26,851 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:26,851 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:26,851 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 18:15:26,851 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:26,851 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:26,851 INFO  L85        PathProgramCache]: Analyzing trace with hash -1452485933, now seen corresponding path program 7 times
[2024-06-04 18:15:26,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:26,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482191145]
[2024-06-04 18:15:26,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:26,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:26,883 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:33,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:33,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:33,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482191145]
[2024-06-04 18:15:33,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482191145] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:33,007 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:33,007 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:33,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117896698]
[2024-06-04 18:15:33,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:33,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:33,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:33,008 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:33,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:33,137 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:15:33,137 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 290 transitions, 4202 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-04 18:15:33,137 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:33,137 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:15:33,138 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:35,269 INFO  L124   PetriNetUnfolderBase]: 4707/7161 cut-off events.
[2024-06-04 18:15:35,269 INFO  L125   PetriNetUnfolderBase]: For 477550/477556 co-relation queries the response was YES.
[2024-06-04 18:15:35,306 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63138 conditions, 7161 events. 4707/7161 cut-off events. For 477550/477556 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 40851 event pairs, 1181 based on Foata normal form. 28/7187 useless extension candidates. Maximal degree in co-relation 63034. Up to 5855 conditions per place. 
[2024-06-04 18:15:35,335 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 266 selfloop transitions, 86 changer transitions 0/355 dead transitions.
[2024-06-04 18:15:35,335 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 355 transitions, 5771 flow
[2024-06-04 18:15:35,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:15:35,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:15:35,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-04 18:15:35,336 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47073170731707314
[2024-06-04 18:15:35,336 INFO  L175             Difference]: Start difference. First operand has 206 places, 290 transitions, 4202 flow. Second operand 10 states and 193 transitions.
[2024-06-04 18:15:35,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 355 transitions, 5771 flow
[2024-06-04 18:15:35,842 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 355 transitions, 5652 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-04 18:15:35,846 INFO  L231             Difference]: Finished difference. Result has 212 places, 294 transitions, 4453 flow
[2024-06-04 18:15:35,846 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4083, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4453, PETRI_PLACES=212, PETRI_TRANSITIONS=294}
[2024-06-04 18:15:35,847 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places.
[2024-06-04 18:15:35,847 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 294 transitions, 4453 flow
[2024-06-04 18:15:35,847 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-04 18:15:35,847 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:35,847 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:35,847 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 18:15:35,847 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:35,847 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:35,847 INFO  L85        PathProgramCache]: Analyzing trace with hash 1701360603, now seen corresponding path program 8 times
[2024-06-04 18:15:35,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:35,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524685061]
[2024-06-04 18:15:35,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:35,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:35,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:41,653 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:41,653 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:41,653 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524685061]
[2024-06-04 18:15:41,653 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524685061] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:41,653 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:41,653 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:41,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138682684]
[2024-06-04 18:15:41,653 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:41,654 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:41,654 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:41,654 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:41,654 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:41,818 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:15:41,819 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 294 transitions, 4453 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-04 18:15:41,819 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:41,819 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:15:41,819 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:44,032 INFO  L124   PetriNetUnfolderBase]: 5019/7685 cut-off events.
[2024-06-04 18:15:44,032 INFO  L125   PetriNetUnfolderBase]: For 565889/565895 co-relation queries the response was YES.
[2024-06-04 18:15:44,074 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67243 conditions, 7685 events. 5019/7685 cut-off events. For 565889/565895 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 44694 event pairs, 1262 based on Foata normal form. 78/7761 useless extension candidates. Maximal degree in co-relation 67137. Up to 5769 conditions per place. 
[2024-06-04 18:15:44,104 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 234 selfloop transitions, 124 changer transitions 0/361 dead transitions.
[2024-06-04 18:15:44,104 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 361 transitions, 5901 flow
[2024-06-04 18:15:44,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:15:44,105 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:15:44,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-04 18:15:44,105 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4926829268292683
[2024-06-04 18:15:44,106 INFO  L175             Difference]: Start difference. First operand has 212 places, 294 transitions, 4453 flow. Second operand 10 states and 202 transitions.
[2024-06-04 18:15:44,106 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 361 transitions, 5901 flow
[2024-06-04 18:15:44,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 361 transitions, 5705 flow, removed 56 selfloop flow, removed 5 redundant places.
[2024-06-04 18:15:44,737 INFO  L231             Difference]: Finished difference. Result has 217 places, 296 transitions, 4622 flow
[2024-06-04 18:15:44,738 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4263, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4622, PETRI_PLACES=217, PETRI_TRANSITIONS=296}
[2024-06-04 18:15:44,738 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 175 predicate places.
[2024-06-04 18:15:44,738 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 296 transitions, 4622 flow
[2024-06-04 18:15:44,738 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-04 18:15:44,738 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:44,738 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:44,738 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 18:15:44,739 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:44,739 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:44,739 INFO  L85        PathProgramCache]: Analyzing trace with hash -1680436429, now seen corresponding path program 1 times
[2024-06-04 18:15:44,739 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:44,739 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930825824]
[2024-06-04 18:15:44,739 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:44,739 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:44,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:50,273 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:50,274 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:50,274 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930825824]
[2024-06-04 18:15:50,274 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930825824] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:50,274 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:50,274 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:50,274 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486265609]
[2024-06-04 18:15:50,274 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:50,274 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:50,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:50,275 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:50,275 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:50,379 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:15:50,380 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 296 transitions, 4622 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-04 18:15:50,380 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:50,380 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:15:50,380 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:52,601 INFO  L124   PetriNetUnfolderBase]: 5047/7729 cut-off events.
[2024-06-04 18:15:52,601 INFO  L125   PetriNetUnfolderBase]: For 518562/518568 co-relation queries the response was YES.
[2024-06-04 18:15:52,640 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 68176 conditions, 7729 events. 5047/7729 cut-off events. For 518562/518568 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 45134 event pairs, 1506 based on Foata normal form. 10/7737 useless extension candidates. Maximal degree in co-relation 68068. Up to 7247 conditions per place. 
[2024-06-04 18:15:52,671 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 267 selfloop transitions, 68 changer transitions 0/338 dead transitions.
[2024-06-04 18:15:52,671 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 338 transitions, 5688 flow
[2024-06-04 18:15:52,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:15:52,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:15:52,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-04 18:15:52,672 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-04 18:15:52,672 INFO  L175             Difference]: Start difference. First operand has 217 places, 296 transitions, 4622 flow. Second operand 9 states and 162 transitions.
[2024-06-04 18:15:52,672 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 338 transitions, 5688 flow
[2024-06-04 18:15:53,302 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 338 transitions, 5419 flow, removed 37 selfloop flow, removed 7 redundant places.
[2024-06-04 18:15:53,307 INFO  L231             Difference]: Finished difference. Result has 219 places, 299 transitions, 4613 flow
[2024-06-04 18:15:53,307 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4353, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4613, PETRI_PLACES=219, PETRI_TRANSITIONS=299}
[2024-06-04 18:15:53,307 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 177 predicate places.
[2024-06-04 18:15:53,307 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 299 transitions, 4613 flow
[2024-06-04 18:15:53,308 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-04 18:15:53,308 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:53,308 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:53,308 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 18:15:53,308 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:53,308 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:53,308 INFO  L85        PathProgramCache]: Analyzing trace with hash -1680442381, now seen corresponding path program 9 times
[2024-06-04 18:15:53,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:53,308 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110947328]
[2024-06-04 18:15:53,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:53,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:53,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:59,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:59,105 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:59,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110947328]
[2024-06-04 18:15:59,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110947328] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:59,105 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:59,105 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:59,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27346652]
[2024-06-04 18:15:59,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:59,106 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:59,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:59,106 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:59,106 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:59,283 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:15:59,283 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 299 transitions, 4613 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-04 18:15:59,284 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:59,284 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:15:59,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:01,668 INFO  L124   PetriNetUnfolderBase]: 5359/8253 cut-off events.
[2024-06-04 18:16:01,668 INFO  L125   PetriNetUnfolderBase]: For 615929/615935 co-relation queries the response was YES.
[2024-06-04 18:16:01,711 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 70602 conditions, 8253 events. 5359/8253 cut-off events. For 615929/615935 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 49065 event pairs, 1363 based on Foata normal form. 78/8329 useless extension candidates. Maximal degree in co-relation 70493. Up to 6658 conditions per place. 
[2024-06-04 18:16:01,742 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 263 selfloop transitions, 97 changer transitions 0/363 dead transitions.
[2024-06-04 18:16:01,742 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 363 transitions, 6075 flow
[2024-06-04 18:16:01,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:16:01,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:16:01,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions.
[2024-06-04 18:16:01,744 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48048780487804876
[2024-06-04 18:16:01,744 INFO  L175             Difference]: Start difference. First operand has 219 places, 299 transitions, 4613 flow. Second operand 10 states and 197 transitions.
[2024-06-04 18:16:01,744 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 363 transitions, 6075 flow
[2024-06-04 18:16:02,416 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 363 transitions, 5845 flow, removed 49 selfloop flow, removed 7 redundant places.
[2024-06-04 18:16:02,421 INFO  L231             Difference]: Finished difference. Result has 222 places, 301 transitions, 4696 flow
[2024-06-04 18:16:02,421 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4383, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4696, PETRI_PLACES=222, PETRI_TRANSITIONS=301}
[2024-06-04 18:16:02,421 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places.
[2024-06-04 18:16:02,422 INFO  L495      AbstractCegarLoop]: Abstraction has has 222 places, 301 transitions, 4696 flow
[2024-06-04 18:16:02,422 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-04 18:16:02,422 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:02,422 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:02,422 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 18:16:02,422 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:02,422 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:02,422 INFO  L85        PathProgramCache]: Analyzing trace with hash -1674872239, now seen corresponding path program 2 times
[2024-06-04 18:16:02,422 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:02,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024284289]
[2024-06-04 18:16:02,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:02,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:02,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:07,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:07,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:07,602 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024284289]
[2024-06-04 18:16:07,602 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024284289] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:07,602 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:07,602 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:16:07,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219366496]
[2024-06-04 18:16:07,602 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:07,603 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:16:07,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:07,604 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:16:07,604 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:16:07,729 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:16:07,729 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 301 transitions, 4696 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-04 18:16:07,729 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:07,729 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:16:07,729 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:09,961 INFO  L124   PetriNetUnfolderBase]: 5387/8298 cut-off events.
[2024-06-04 18:16:09,961 INFO  L125   PetriNetUnfolderBase]: For 568754/568757 co-relation queries the response was YES.
[2024-06-04 18:16:10,004 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 71734 conditions, 8298 events. 5387/8298 cut-off events. For 568754/568757 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 49561 event pairs, 1601 based on Foata normal form. 8/8303 useless extension candidates. Maximal degree in co-relation 71624. Up to 7815 conditions per place. 
[2024-06-04 18:16:10,037 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 271 selfloop transitions, 61 changer transitions 0/335 dead transitions.
[2024-06-04 18:16:10,037 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 335 transitions, 5658 flow
[2024-06-04 18:16:10,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:16:10,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:16:10,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-04 18:16:10,040 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4329268292682927
[2024-06-04 18:16:10,040 INFO  L175             Difference]: Start difference. First operand has 222 places, 301 transitions, 4696 flow. Second operand 8 states and 142 transitions.
[2024-06-04 18:16:10,040 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 335 transitions, 5658 flow
[2024-06-04 18:16:10,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 335 transitions, 5391 flow, removed 40 selfloop flow, removed 8 redundant places.
[2024-06-04 18:16:10,808 INFO  L231             Difference]: Finished difference. Result has 222 places, 304 transitions, 4685 flow
[2024-06-04 18:16:10,808 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4429, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4685, PETRI_PLACES=222, PETRI_TRANSITIONS=304}
[2024-06-04 18:16:10,808 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places.
[2024-06-04 18:16:10,809 INFO  L495      AbstractCegarLoop]: Abstraction has has 222 places, 304 transitions, 4685 flow
[2024-06-04 18:16:10,809 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-04 18:16:10,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:10,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:10,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 18:16:10,809 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:10,810 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:10,810 INFO  L85        PathProgramCache]: Analyzing trace with hash -1675080001, now seen corresponding path program 10 times
[2024-06-04 18:16:10,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:10,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039250038]
[2024-06-04 18:16:10,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:10,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:10,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:16,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:16,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:16,516 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039250038]
[2024-06-04 18:16:16,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039250038] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:16,520 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:16,520 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:16:16,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592443610]
[2024-06-04 18:16:16,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:16,521 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:16:16,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:16,521 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:16:16,521 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:16:16,738 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:16:16,739 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 304 transitions, 4685 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-04 18:16:16,739 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:16,739 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:16:16,739 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:19,211 INFO  L124   PetriNetUnfolderBase]: 5699/8821 cut-off events.
[2024-06-04 18:16:19,211 INFO  L125   PetriNetUnfolderBase]: For 672802/672808 co-relation queries the response was YES.
[2024-06-04 18:16:19,260 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 74341 conditions, 8821 events. 5699/8821 cut-off events. For 672802/672808 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 53466 event pairs, 1429 based on Foata normal form. 78/8897 useless extension candidates. Maximal degree in co-relation 74230. Up to 7226 conditions per place. 
[2024-06-04 18:16:19,295 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 271 selfloop transitions, 90 changer transitions 0/364 dead transitions.
[2024-06-04 18:16:19,295 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 364 transitions, 6139 flow
[2024-06-04 18:16:19,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:16:19,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:16:19,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-04 18:16:19,296 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47073170731707314
[2024-06-04 18:16:19,296 INFO  L175             Difference]: Start difference. First operand has 222 places, 304 transitions, 4685 flow. Second operand 10 states and 193 transitions.
[2024-06-04 18:16:19,297 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 364 transitions, 6139 flow
[2024-06-04 18:16:19,986 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 364 transitions, 5913 flow, removed 54 selfloop flow, removed 6 redundant places.
[2024-06-04 18:16:19,990 INFO  L231             Difference]: Finished difference. Result has 226 places, 306 transitions, 4766 flow
[2024-06-04 18:16:19,990 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4459, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4766, PETRI_PLACES=226, PETRI_TRANSITIONS=306}
[2024-06-04 18:16:19,991 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 184 predicate places.
[2024-06-04 18:16:19,991 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 306 transitions, 4766 flow
[2024-06-04 18:16:19,991 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-04 18:16:19,991 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:19,991 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:19,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 18:16:19,991 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:19,992 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:19,992 INFO  L85        PathProgramCache]: Analyzing trace with hash -1674864799, now seen corresponding path program 3 times
[2024-06-04 18:16:19,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:19,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737165650]
[2024-06-04 18:16:19,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:19,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:20,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:25,161 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:25,161 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:25,162 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737165650]
[2024-06-04 18:16:25,162 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737165650] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:25,162 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:25,162 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:16:25,162 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954177210]
[2024-06-04 18:16:25,162 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:25,162 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:16:25,162 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:25,163 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:16:25,163 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:16:25,321 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:16:25,322 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 306 transitions, 4766 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-04 18:16:25,322 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:25,322 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:16:25,322 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:27,621 INFO  L124   PetriNetUnfolderBase]: 5727/8866 cut-off events.
[2024-06-04 18:16:27,621 INFO  L125   PetriNetUnfolderBase]: For 619265/619268 co-relation queries the response was YES.
[2024-06-04 18:16:27,668 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75418 conditions, 8866 events. 5727/8866 cut-off events. For 619265/619268 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 54003 event pairs, 1726 based on Foata normal form. 8/8871 useless extension candidates. Maximal degree in co-relation 75306. Up to 8229 conditions per place. 
[2024-06-04 18:16:27,700 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 265 selfloop transitions, 72 changer transitions 0/340 dead transitions.
[2024-06-04 18:16:27,700 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 340 transitions, 5743 flow
[2024-06-04 18:16:27,700 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:16:27,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:16:27,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-04 18:16:27,701 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4329268292682927
[2024-06-04 18:16:27,701 INFO  L175             Difference]: Start difference. First operand has 226 places, 306 transitions, 4766 flow. Second operand 8 states and 142 transitions.
[2024-06-04 18:16:27,701 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 340 transitions, 5743 flow
[2024-06-04 18:16:28,656 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 340 transitions, 5482 flow, removed 44 selfloop flow, removed 8 redundant places.
[2024-06-04 18:16:28,661 INFO  L231             Difference]: Finished difference. Result has 226 places, 309 transitions, 4787 flow
[2024-06-04 18:16:28,661 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4505, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4787, PETRI_PLACES=226, PETRI_TRANSITIONS=309}
[2024-06-04 18:16:28,661 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 184 predicate places.
[2024-06-04 18:16:28,661 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 309 transitions, 4787 flow
[2024-06-04 18:16:28,661 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-04 18:16:28,662 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:28,662 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:28,662 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 18:16:28,662 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:28,662 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:28,662 INFO  L85        PathProgramCache]: Analyzing trace with hash 831675463, now seen corresponding path program 1 times
[2024-06-04 18:16:28,662 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:28,662 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559013213]
[2024-06-04 18:16:28,662 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:28,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:28,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:35,476 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:35,476 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:35,476 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559013213]
[2024-06-04 18:16:35,476 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559013213] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:35,476 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:35,476 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:16:35,477 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098834698]
[2024-06-04 18:16:35,477 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:35,477 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:16:35,477 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:35,477 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:16:35,477 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:16:35,538 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:16:35,538 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 309 transitions, 4787 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-04 18:16:35,538 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:35,538 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:16:35,538 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:37,851 INFO  L124   PetriNetUnfolderBase]: 5737/8878 cut-off events.
[2024-06-04 18:16:37,851 INFO  L125   PetriNetUnfolderBase]: For 617547/617547 co-relation queries the response was YES.
[2024-06-04 18:16:37,900 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75028 conditions, 8878 events. 5737/8878 cut-off events. For 617547/617547 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 54055 event pairs, 1980 based on Foata normal form. 2/8879 useless extension candidates. Maximal degree in co-relation 74915. Up to 8816 conditions per place. 
[2024-06-04 18:16:37,933 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 309 selfloop transitions, 24 changer transitions 0/336 dead transitions.
[2024-06-04 18:16:37,933 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 336 transitions, 5731 flow
[2024-06-04 18:16:37,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:16:37,935 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:16:37,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-04 18:16:37,936 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-04 18:16:37,936 INFO  L175             Difference]: Start difference. First operand has 226 places, 309 transitions, 4787 flow. Second operand 8 states and 124 transitions.
[2024-06-04 18:16:37,936 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 336 transitions, 5731 flow
[2024-06-04 18:16:38,796 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 336 transitions, 5478 flow, removed 57 selfloop flow, removed 6 redundant places.
[2024-06-04 18:16:38,800 INFO  L231             Difference]: Finished difference. Result has 228 places, 315 transitions, 4720 flow
[2024-06-04 18:16:38,800 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4534, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4720, PETRI_PLACES=228, PETRI_TRANSITIONS=315}
[2024-06-04 18:16:38,800 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 186 predicate places.
[2024-06-04 18:16:38,800 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 315 transitions, 4720 flow
[2024-06-04 18:16:38,801 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-04 18:16:38,801 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:38,801 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:38,801 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 18:16:38,801 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:38,801 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:38,801 INFO  L85        PathProgramCache]: Analyzing trace with hash 821261751, now seen corresponding path program 2 times
[2024-06-04 18:16:38,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:38,801 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339190209]
[2024-06-04 18:16:38,801 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:38,802 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:38,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:45,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:45,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:45,529 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339190209]
[2024-06-04 18:16:45,529 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339190209] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:45,529 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:45,529 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:16:45,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559386268]
[2024-06-04 18:16:45,529 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:45,529 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:16:45,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:45,530 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:16:45,530 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:16:45,648 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:16:45,649 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 315 transitions, 4720 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-04 18:16:45,649 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:45,649 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:16:45,649 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:48,029 INFO  L124   PetriNetUnfolderBase]: 5803/8971 cut-off events.
[2024-06-04 18:16:48,029 INFO  L125   PetriNetUnfolderBase]: For 646813/646819 co-relation queries the response was YES.
[2024-06-04 18:16:48,077 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75942 conditions, 8971 events. 5803/8971 cut-off events. For 646813/646819 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 54531 event pairs, 1728 based on Foata normal form. 8/8977 useless extension candidates. Maximal degree in co-relation 75828. Up to 8469 conditions per place. 
[2024-06-04 18:16:48,112 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 277 selfloop transitions, 73 changer transitions 0/353 dead transitions.
[2024-06-04 18:16:48,113 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 353 transitions, 5950 flow
[2024-06-04 18:16:48,113 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:16:48,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:16:48,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-04 18:16:48,114 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42073170731707316
[2024-06-04 18:16:48,114 INFO  L175             Difference]: Start difference. First operand has 228 places, 315 transitions, 4720 flow. Second operand 8 states and 138 transitions.
[2024-06-04 18:16:48,114 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 353 transitions, 5950 flow
[2024-06-04 18:16:48,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 353 transitions, 5864 flow, removed 33 selfloop flow, removed 5 redundant places.
[2024-06-04 18:16:48,920 INFO  L231             Difference]: Finished difference. Result has 232 places, 328 transitions, 5084 flow
[2024-06-04 18:16:48,921 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4634, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5084, PETRI_PLACES=232, PETRI_TRANSITIONS=328}
[2024-06-04 18:16:48,921 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 190 predicate places.
[2024-06-04 18:16:48,921 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 328 transitions, 5084 flow
[2024-06-04 18:16:48,921 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-04 18:16:48,921 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:48,921 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:48,921 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 18:16:48,921 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:48,922 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:48,922 INFO  L85        PathProgramCache]: Analyzing trace with hash -41486093, now seen corresponding path program 4 times
[2024-06-04 18:16:48,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:48,922 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509434254]
[2024-06-04 18:16:48,922 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:48,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:48,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:54,754 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:54,755 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:54,755 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509434254]
[2024-06-04 18:16:54,755 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509434254] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:54,755 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:54,755 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:16:54,755 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929293016]
[2024-06-04 18:16:54,755 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:54,756 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:16:54,756 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:54,756 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:16:54,757 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:16:54,894 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:16:54,895 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 328 transitions, 5084 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-04 18:16:54,895 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:54,895 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:16:54,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:57,381 INFO  L124   PetriNetUnfolderBase]: 5828/9010 cut-off events.
[2024-06-04 18:16:57,381 INFO  L125   PetriNetUnfolderBase]: For 677184/677190 co-relation queries the response was YES.
[2024-06-04 18:16:57,432 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76917 conditions, 9010 events. 5828/9010 cut-off events. For 677184/677190 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 54951 event pairs, 1991 based on Foata normal form. 16/9024 useless extension candidates. Maximal degree in co-relation 76801. Up to 8817 conditions per place. 
[2024-06-04 18:16:57,467 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 311 selfloop transitions, 45 changer transitions 0/359 dead transitions.
[2024-06-04 18:16:57,467 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 359 transitions, 6026 flow
[2024-06-04 18:16:57,467 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:16:57,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:16:57,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions.
[2024-06-04 18:16:57,468 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3956639566395664
[2024-06-04 18:16:57,468 INFO  L175             Difference]: Start difference. First operand has 232 places, 328 transitions, 5084 flow. Second operand 9 states and 146 transitions.
[2024-06-04 18:16:57,468 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 359 transitions, 6026 flow
[2024-06-04 18:16:58,475 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 359 transitions, 5922 flow, removed 19 selfloop flow, removed 4 redundant places.
[2024-06-04 18:16:58,479 INFO  L231             Difference]: Finished difference. Result has 237 places, 332 transitions, 5248 flow
[2024-06-04 18:16:58,480 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4980, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5248, PETRI_PLACES=237, PETRI_TRANSITIONS=332}
[2024-06-04 18:16:58,480 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 195 predicate places.
[2024-06-04 18:16:58,480 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 332 transitions, 5248 flow
[2024-06-04 18:16:58,480 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-04 18:16:58,480 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:58,480 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:58,480 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 18:16:58,480 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:58,481 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:58,481 INFO  L85        PathProgramCache]: Analyzing trace with hash -297979163, now seen corresponding path program 5 times
[2024-06-04 18:16:58,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:58,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323284781]
[2024-06-04 18:16:58,481 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:58,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:58,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:04,242 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:04,242 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:04,242 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323284781]
[2024-06-04 18:17:04,242 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323284781] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:04,243 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:04,243 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:04,243 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77040641]
[2024-06-04 18:17:04,243 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:04,243 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:04,243 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:04,243 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:04,243 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:04,449 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:17:04,450 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 332 transitions, 5248 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-04 18:17:04,450 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:04,450 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:17:04,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:06,946 INFO  L124   PetriNetUnfolderBase]: 5828/9010 cut-off events.
[2024-06-04 18:17:06,946 INFO  L125   PetriNetUnfolderBase]: For 687472/687478 co-relation queries the response was YES.
[2024-06-04 18:17:06,997 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77233 conditions, 9010 events. 5828/9010 cut-off events. For 687472/687478 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 54920 event pairs, 2008 based on Foata normal form. 10/9018 useless extension candidates. Maximal degree in co-relation 77116. Up to 8827 conditions per place. 
[2024-06-04 18:17:07,031 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 326 selfloop transitions, 34 changer transitions 0/363 dead transitions.
[2024-06-04 18:17:07,031 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 363 transitions, 6265 flow
[2024-06-04 18:17:07,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:17:07,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:17:07,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-04 18:17:07,032 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40853658536585363
[2024-06-04 18:17:07,032 INFO  L175             Difference]: Start difference. First operand has 237 places, 332 transitions, 5248 flow. Second operand 8 states and 134 transitions.
[2024-06-04 18:17:07,032 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 363 transitions, 6265 flow
[2024-06-04 18:17:07,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 363 transitions, 5947 flow, removed 116 selfloop flow, removed 7 redundant places.
[2024-06-04 18:17:07,972 INFO  L231             Difference]: Finished difference. Result has 239 places, 337 transitions, 5255 flow
[2024-06-04 18:17:07,973 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5020, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5255, PETRI_PLACES=239, PETRI_TRANSITIONS=337}
[2024-06-04 18:17:07,973 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 197 predicate places.
[2024-06-04 18:17:07,973 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 337 transitions, 5255 flow
[2024-06-04 18:17:07,973 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-04 18:17:07,973 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:07,973 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:07,973 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 18:17:07,974 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:07,974 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:07,974 INFO  L85        PathProgramCache]: Analyzing trace with hash -298194365, now seen corresponding path program 11 times
[2024-06-04 18:17:07,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:07,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978232056]
[2024-06-04 18:17:07,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:07,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:08,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:13,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:13,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:13,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978232056]
[2024-06-04 18:17:13,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978232056] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:13,654 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:13,655 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:13,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279449342]
[2024-06-04 18:17:13,655 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:13,655 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:13,655 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:13,655 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:13,655 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:13,812 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:17:13,812 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 337 transitions, 5255 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-04 18:17:13,812 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:13,812 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:17:13,812 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:16,531 INFO  L124   PetriNetUnfolderBase]: 6138/9536 cut-off events.
[2024-06-04 18:17:16,531 INFO  L125   PetriNetUnfolderBase]: For 858294/858300 co-relation queries the response was YES.
[2024-06-04 18:17:16,588 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79851 conditions, 9536 events. 6138/9536 cut-off events. For 858294/858300 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 58988 event pairs, 2021 based on Foata normal form. 102/9636 useless extension candidates. Maximal degree in co-relation 79732. Up to 8539 conditions per place. 
[2024-06-04 18:17:16,625 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 330 selfloop transitions, 57 changer transitions 0/390 dead transitions.
[2024-06-04 18:17:16,625 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 390 transitions, 6781 flow
[2024-06-04 18:17:16,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:17:16,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:17:16,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions.
[2024-06-04 18:17:16,626 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44390243902439025
[2024-06-04 18:17:16,626 INFO  L175             Difference]: Start difference. First operand has 239 places, 337 transitions, 5255 flow. Second operand 10 states and 182 transitions.
[2024-06-04 18:17:16,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 390 transitions, 6781 flow
[2024-06-04 18:17:17,764 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 390 transitions, 6601 flow, removed 62 selfloop flow, removed 5 redundant places.
[2024-06-04 18:17:17,769 INFO  L231             Difference]: Finished difference. Result has 244 places, 340 transitions, 5359 flow
[2024-06-04 18:17:17,769 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5075, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5359, PETRI_PLACES=244, PETRI_TRANSITIONS=340}
[2024-06-04 18:17:17,769 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 202 predicate places.
[2024-06-04 18:17:17,770 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 340 transitions, 5359 flow
[2024-06-04 18:17:17,770 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-04 18:17:17,770 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:17,770 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:17,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 18:17:17,770 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-04 18:17:17,772 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:17,772 INFO  L85        PathProgramCache]: Analyzing trace with hash -41478653, now seen corresponding path program 6 times
[2024-06-04 18:17:17,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:17,772 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438465176]
[2024-06-04 18:17:17,772 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:17,773 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:17,812 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:24,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:24,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:24,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438465176]
[2024-06-04 18:17:24,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438465176] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:24,498 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:24,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:24,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990766335]
[2024-06-04 18:17:24,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:24,499 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:24,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:24,499 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:24,499 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:24,636 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:17:24,636 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 340 transitions, 5359 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-04 18:17:24,636 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:24,637 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:17:24,637 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:27,159 INFO  L124   PetriNetUnfolderBase]: 6163/9575 cut-off events.
[2024-06-04 18:17:27,159 INFO  L125   PetriNetUnfolderBase]: For 741537/741543 co-relation queries the response was YES.
[2024-06-04 18:17:27,220 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80840 conditions, 9575 events. 6163/9575 cut-off events. For 741537/741543 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 59415 event pairs, 2091 based on Foata normal form. 10/9583 useless extension candidates. Maximal degree in co-relation 80720. Up to 9272 conditions per place. 
[2024-06-04 18:17:27,257 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 310 selfloop transitions, 57 changer transitions 0/370 dead transitions.
[2024-06-04 18:17:27,257 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 370 transitions, 6293 flow
[2024-06-04 18:17:27,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:27,258 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:27,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-04 18:17:27,259 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3983739837398374
[2024-06-04 18:17:27,259 INFO  L175             Difference]: Start difference. First operand has 244 places, 340 transitions, 5359 flow. Second operand 9 states and 147 transitions.
[2024-06-04 18:17:27,259 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 370 transitions, 6293 flow
[2024-06-04 18:17:28,407 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 370 transitions, 6044 flow, removed 61 selfloop flow, removed 9 redundant places.
[2024-06-04 18:17:28,412 INFO  L231             Difference]: Finished difference. Result has 244 places, 343 transitions, 5374 flow
[2024-06-04 18:17:28,412 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5110, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5374, PETRI_PLACES=244, PETRI_TRANSITIONS=343}
[2024-06-04 18:17:28,412 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 202 predicate places.
[2024-06-04 18:17:28,412 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 343 transitions, 5374 flow
[2024-06-04 18:17:28,412 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-04 18:17:28,412 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:28,413 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:28,413 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 18:17:28,413 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:28,413 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:28,413 INFO  L85        PathProgramCache]: Analyzing trace with hash -32281883, now seen corresponding path program 7 times
[2024-06-04 18:17:28,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:28,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485026374]
[2024-06-04 18:17:28,413 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:28,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:28,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:34,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:34,154 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:34,154 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485026374]
[2024-06-04 18:17:34,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485026374] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:34,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:34,155 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:34,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721523425]
[2024-06-04 18:17:34,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:34,155 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:34,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:34,156 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:34,156 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:34,256 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:17:34,256 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 343 transitions, 5374 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-04 18:17:34,256 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:34,256 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:17:34,256 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:37,104 INFO  L124   PetriNetUnfolderBase]: 6163/9575 cut-off events.
[2024-06-04 18:17:37,105 INFO  L125   PetriNetUnfolderBase]: For 726016/726022 co-relation queries the response was YES.
[2024-06-04 18:17:37,181 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79454 conditions, 9575 events. 6163/9575 cut-off events. For 726016/726022 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 59142 event pairs, 2059 based on Foata normal form. 10/9583 useless extension candidates. Maximal degree in co-relation 79334. Up to 9423 conditions per place. 
[2024-06-04 18:17:37,223 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 337 selfloop transitions, 32 changer transitions 0/372 dead transitions.
[2024-06-04 18:17:37,224 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 372 transitions, 6314 flow
[2024-06-04 18:17:37,224 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:17:37,224 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:17:37,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-04 18:17:37,225 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4054878048780488
[2024-06-04 18:17:37,225 INFO  L175             Difference]: Start difference. First operand has 244 places, 343 transitions, 5374 flow. Second operand 8 states and 133 transitions.
[2024-06-04 18:17:37,225 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 372 transitions, 6314 flow
[2024-06-04 18:17:38,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 372 transitions, 6088 flow, removed 60 selfloop flow, removed 7 redundant places.
[2024-06-04 18:17:38,781 INFO  L231             Difference]: Finished difference. Result has 245 places, 346 transitions, 5364 flow
[2024-06-04 18:17:38,781 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5148, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5364, PETRI_PLACES=245, PETRI_TRANSITIONS=346}
[2024-06-04 18:17:38,781 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 203 predicate places.
[2024-06-04 18:17:38,781 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 346 transitions, 5364 flow
[2024-06-04 18:17:38,782 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-04 18:17:38,782 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:38,782 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:38,782 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 18:17:38,782 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:38,782 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:38,783 INFO  L85        PathProgramCache]: Analyzing trace with hash 1193399763, now seen corresponding path program 2 times
[2024-06-04 18:17:38,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:38,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754667543]
[2024-06-04 18:17:38,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:38,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:38,814 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:45,880 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:45,880 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:45,880 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754667543]
[2024-06-04 18:17:45,880 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754667543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:45,880 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:45,881 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:17:45,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245607390]
[2024-06-04 18:17:45,881 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:45,881 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:17:45,881 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:45,881 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:17:45,881 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:17:46,002 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:17:46,003 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 346 transitions, 5364 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-04 18:17:46,003 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:46,003 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:17:46,004 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:48,327 INFO  L124   PetriNetUnfolderBase]: 6173/9588 cut-off events.
[2024-06-04 18:17:48,327 INFO  L125   PetriNetUnfolderBase]: For 739281/739281 co-relation queries the response was YES.
[2024-06-04 18:17:48,389 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79710 conditions, 9588 events. 6173/9588 cut-off events. For 739281/739281 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 59324 event pairs, 2158 based on Foata normal form. 2/9589 useless extension candidates. Maximal degree in co-relation 79589. Up to 9546 conditions per place. 
[2024-06-04 18:17:48,426 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 341 selfloop transitions, 19 changer transitions 0/363 dead transitions.
[2024-06-04 18:17:48,426 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 363 transitions, 6281 flow
[2024-06-04 18:17:48,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:17:48,427 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:17:48,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions.
[2024-06-04 18:17:48,427 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3693379790940767
[2024-06-04 18:17:48,427 INFO  L175             Difference]: Start difference. First operand has 245 places, 346 transitions, 5364 flow. Second operand 7 states and 106 transitions.
[2024-06-04 18:17:48,427 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 363 transitions, 6281 flow
[2024-06-04 18:17:49,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 363 transitions, 6089 flow, removed 66 selfloop flow, removed 6 redundant places.
[2024-06-04 18:17:49,808 INFO  L231             Difference]: Finished difference. Result has 246 places, 349 transitions, 5265 flow
[2024-06-04 18:17:49,808 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5172, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5265, PETRI_PLACES=246, PETRI_TRANSITIONS=349}
[2024-06-04 18:17:49,808 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 204 predicate places.
[2024-06-04 18:17:49,808 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 349 transitions, 5265 flow
[2024-06-04 18:17:49,809 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-04 18:17:49,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:49,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:49,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-04 18:17:49,809 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:49,810 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:49,810 INFO  L85        PathProgramCache]: Analyzing trace with hash -213641279, now seen corresponding path program 3 times
[2024-06-04 18:17:49,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:49,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249222448]
[2024-06-04 18:17:49,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:49,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:49,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:56,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:56,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:56,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249222448]
[2024-06-04 18:17:56,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249222448] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:56,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:56,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:17:56,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299923454]
[2024-06-04 18:17:56,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:56,021 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:17:56,021 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:56,022 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:17:56,022 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:17:56,112 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:17:56,113 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 349 transitions, 5265 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-04 18:17:56,113 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:56,113 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:17:56,113 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:58,563 INFO  L124   PetriNetUnfolderBase]: 6167/9583 cut-off events.
[2024-06-04 18:17:58,563 INFO  L125   PetriNetUnfolderBase]: For 758916/758919 co-relation queries the response was YES.
[2024-06-04 18:17:58,636 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79387 conditions, 9583 events. 6167/9583 cut-off events. For 758916/758919 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 59337 event pairs, 2119 based on Foata normal form. 6/9586 useless extension candidates. Maximal degree in co-relation 79265. Up to 9486 conditions per place. 
[2024-06-04 18:17:58,678 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 325 selfloop transitions, 34 changer transitions 0/362 dead transitions.
[2024-06-04 18:17:58,678 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 362 transitions, 6135 flow
[2024-06-04 18:17:58,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:17:58,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:17:58,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-04 18:17:58,683 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39372822299651566
[2024-06-04 18:17:58,683 INFO  L175             Difference]: Start difference. First operand has 246 places, 349 transitions, 5265 flow. Second operand 7 states and 113 transitions.
[2024-06-04 18:17:58,683 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 362 transitions, 6135 flow
[2024-06-04 18:18:00,002 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 362 transitions, 6059 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-04 18:18:00,008 INFO  L231             Difference]: Finished difference. Result has 248 places, 349 transitions, 5267 flow
[2024-06-04 18:18:00,009 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5189, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5267, PETRI_PLACES=248, PETRI_TRANSITIONS=349}
[2024-06-04 18:18:00,009 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 206 predicate places.
[2024-06-04 18:18:00,009 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 349 transitions, 5267 flow
[2024-06-04 18:18:00,009 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-04 18:18:00,009 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:00,010 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:00,010 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-04 18:18:00,010 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:00,010 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:00,010 INFO  L85        PathProgramCache]: Analyzing trace with hash -213225197, now seen corresponding path program 3 times
[2024-06-04 18:18:00,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:00,011 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993443658]
[2024-06-04 18:18:00,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:00,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:00,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:07,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:07,300 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:07,300 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993443658]
[2024-06-04 18:18:07,300 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993443658] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:07,300 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:07,300 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:07,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181358043]
[2024-06-04 18:18:07,300 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:07,301 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:07,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:07,301 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:07,301 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:07,406 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:18:07,407 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 349 transitions, 5267 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-04 18:18:07,407 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:07,407 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:18:07,407 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:10,098 INFO  L124   PetriNetUnfolderBase]: 6169/9584 cut-off events.
[2024-06-04 18:18:10,098 INFO  L125   PetriNetUnfolderBase]: For 775772/775772 co-relation queries the response was YES.
[2024-06-04 18:18:10,168 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79769 conditions, 9584 events. 6169/9584 cut-off events. For 775772/775772 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 59289 event pairs, 2154 based on Foata normal form. 2/9585 useless extension candidates. Maximal degree in co-relation 79646. Up to 9556 conditions per place. 
[2024-06-04 18:18:10,209 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 346 selfloop transitions, 17 changer transitions 0/366 dead transitions.
[2024-06-04 18:18:10,209 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 366 transitions, 6089 flow
[2024-06-04 18:18:10,211 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:18:10,211 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:18:10,211 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions.
[2024-06-04 18:18:10,212 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3554006968641115
[2024-06-04 18:18:10,212 INFO  L175             Difference]: Start difference. First operand has 248 places, 349 transitions, 5267 flow. Second operand 7 states and 102 transitions.
[2024-06-04 18:18:10,212 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 366 transitions, 6089 flow
[2024-06-04 18:18:11,422 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 366 transitions, 5801 flow, removed 19 selfloop flow, removed 10 redundant places.
[2024-06-04 18:18:11,428 INFO  L231             Difference]: Finished difference. Result has 246 places, 355 transitions, 5101 flow
[2024-06-04 18:18:11,428 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4979, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5101, PETRI_PLACES=246, PETRI_TRANSITIONS=355}
[2024-06-04 18:18:11,429 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 204 predicate places.
[2024-06-04 18:18:11,430 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 355 transitions, 5101 flow
[2024-06-04 18:18:11,430 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-04 18:18:11,430 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:11,430 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:11,430 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-04 18:18:11,430 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:11,431 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:11,431 INFO  L85        PathProgramCache]: Analyzing trace with hash 1581453553, now seen corresponding path program 1 times
[2024-06-04 18:18:11,431 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:11,431 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42973334]
[2024-06-04 18:18:11,431 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:11,432 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:11,456 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:21,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:21,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:21,145 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42973334]
[2024-06-04 18:18:21,146 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42973334] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:21,146 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:21,147 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:21,147 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442259144]
[2024-06-04 18:18:21,147 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:21,148 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:21,148 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:21,154 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:21,154 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:21,279 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:18:21,279 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 355 transitions, 5101 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-04 18:18:21,279 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:21,279 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:18:21,279 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:23,742 INFO  L124   PetriNetUnfolderBase]: 6167/9582 cut-off events.
[2024-06-04 18:18:23,743 INFO  L125   PetriNetUnfolderBase]: For 794879/794879 co-relation queries the response was YES.
[2024-06-04 18:18:23,798 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79714 conditions, 9582 events. 6167/9582 cut-off events. For 794879/794879 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 59307 event pairs, 2100 based on Foata normal form. 6/9587 useless extension candidates. Maximal degree in co-relation 79591. Up to 9442 conditions per place. 
[2024-06-04 18:18:23,830 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 342 selfloop transitions, 36 changer transitions 0/381 dead transitions.
[2024-06-04 18:18:23,830 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 381 transitions, 6081 flow
[2024-06-04 18:18:23,831 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:18:23,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:18:23,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions.
[2024-06-04 18:18:23,831 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3821138211382114
[2024-06-04 18:18:23,832 INFO  L175             Difference]: Start difference. First operand has 246 places, 355 transitions, 5101 flow. Second operand 9 states and 141 transitions.
[2024-06-04 18:18:23,832 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 381 transitions, 6081 flow
[2024-06-04 18:18:24,703 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 381 transitions, 6039 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-04 18:18:24,707 INFO  L231             Difference]: Finished difference. Result has 252 places, 358 transitions, 5181 flow
[2024-06-04 18:18:24,707 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5059, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5181, PETRI_PLACES=252, PETRI_TRANSITIONS=358}
[2024-06-04 18:18:24,708 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 210 predicate places.
[2024-06-04 18:18:24,708 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 358 transitions, 5181 flow
[2024-06-04 18:18:24,708 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-04 18:18:24,708 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:24,708 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:24,709 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-04 18:18:24,709 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:24,709 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:24,709 INFO  L85        PathProgramCache]: Analyzing trace with hash -213456395, now seen corresponding path program 2 times
[2024-06-04 18:18:24,709 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:24,709 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918187205]
[2024-06-04 18:18:24,709 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:24,709 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:24,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:33,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:33,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:33,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918187205]
[2024-06-04 18:18:33,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918187205] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:33,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:33,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:33,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372878015]
[2024-06-04 18:18:33,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:33,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:33,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:33,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:33,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:33,945 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:18:33,945 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 358 transitions, 5181 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-04 18:18:33,945 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:33,945 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:18:33,945 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:36,476 INFO  L124   PetriNetUnfolderBase]: 6177/9597 cut-off events.
[2024-06-04 18:18:36,477 INFO  L125   PetriNetUnfolderBase]: For 808960/808966 co-relation queries the response was YES.
[2024-06-04 18:18:36,539 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80290 conditions, 9597 events. 6177/9597 cut-off events. For 808960/808966 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 59328 event pairs, 2103 based on Foata normal form. 6/9601 useless extension candidates. Maximal degree in co-relation 80166. Up to 9448 conditions per place. 
[2024-06-04 18:18:36,574 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 341 selfloop transitions, 39 changer transitions 0/383 dead transitions.
[2024-06-04 18:18:36,575 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 383 transitions, 6297 flow
[2024-06-04 18:18:36,575 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:18:36,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:18:36,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions.
[2024-06-04 18:18:36,576 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3932926829268293
[2024-06-04 18:18:36,576 INFO  L175             Difference]: Start difference. First operand has 252 places, 358 transitions, 5181 flow. Second operand 8 states and 129 transitions.
[2024-06-04 18:18:36,576 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 383 transitions, 6297 flow
[2024-06-04 18:18:37,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 383 transitions, 6222 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-06-04 18:18:37,821 INFO  L231             Difference]: Finished difference. Result has 254 places, 361 transitions, 5236 flow
[2024-06-04 18:18:37,821 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5108, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5236, PETRI_PLACES=254, PETRI_TRANSITIONS=361}
[2024-06-04 18:18:37,821 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places.
[2024-06-04 18:18:37,821 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 361 transitions, 5236 flow
[2024-06-04 18:18:37,822 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-04 18:18:37,822 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:37,822 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:37,822 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-04 18:18:37,822 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:37,822 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:37,822 INFO  L85        PathProgramCache]: Analyzing trace with hash -213219245, now seen corresponding path program 3 times
[2024-06-04 18:18:37,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:37,822 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127369534]
[2024-06-04 18:18:37,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:37,822 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:37,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:44,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:44,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:44,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127369534]
[2024-06-04 18:18:44,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127369534] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:44,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:44,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:18:44,767 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696687639]
[2024-06-04 18:18:44,767 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:44,767 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:18:44,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:44,767 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:18:44,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:18:44,869 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:18:44,869 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 361 transitions, 5236 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-04 18:18:44,869 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:44,869 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:18:44,869 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:47,328 INFO  L124   PetriNetUnfolderBase]: 6171/9590 cut-off events.
[2024-06-04 18:18:47,328 INFO  L125   PetriNetUnfolderBase]: For 828369/828372 co-relation queries the response was YES.
[2024-06-04 18:18:47,383 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80428 conditions, 9590 events. 6171/9590 cut-off events. For 828369/828372 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 59343 event pairs, 2117 based on Foata normal form. 2/9589 useless extension candidates. Maximal degree in co-relation 80303. Up to 9445 conditions per place. 
[2024-06-04 18:18:47,415 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 334 selfloop transitions, 40 changer transitions 0/377 dead transitions.
[2024-06-04 18:18:47,415 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 377 transitions, 6156 flow
[2024-06-04 18:18:47,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:18:47,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:18:47,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-04 18:18:47,417 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40069686411149824
[2024-06-04 18:18:47,417 INFO  L175             Difference]: Start difference. First operand has 254 places, 361 transitions, 5236 flow. Second operand 7 states and 115 transitions.
[2024-06-04 18:18:47,417 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 377 transitions, 6156 flow
[2024-06-04 18:18:48,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 377 transitions, 6016 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-04 18:18:48,489 INFO  L231             Difference]: Finished difference. Result has 254 places, 361 transitions, 5183 flow
[2024-06-04 18:18:48,490 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5096, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5183, PETRI_PLACES=254, PETRI_TRANSITIONS=361}
[2024-06-04 18:18:48,490 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places.
[2024-06-04 18:18:48,490 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 361 transitions, 5183 flow
[2024-06-04 18:18:48,490 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-04 18:18:48,490 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:48,490 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:48,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-04 18:18:48,491 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:48,491 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:48,491 INFO  L85        PathProgramCache]: Analyzing trace with hash -213210317, now seen corresponding path program 1 times
[2024-06-04 18:18:48,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:48,491 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400919570]
[2024-06-04 18:18:48,491 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:48,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:48,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:57,517 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:57,517 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:57,517 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400919570]
[2024-06-04 18:18:57,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400919570] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:57,518 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:57,518 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:57,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460522658]
[2024-06-04 18:18:57,518 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:57,518 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:57,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:57,519 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:57,519 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:57,591 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:18:57,592 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 361 transitions, 5183 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-04 18:18:57,592 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:57,592 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:18:57,592 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:59,914 INFO  L124   PetriNetUnfolderBase]: 6166/9581 cut-off events.
[2024-06-04 18:18:59,914 INFO  L125   PetriNetUnfolderBase]: For 846596/846596 co-relation queries the response was YES.
[2024-06-04 18:18:59,978 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80551 conditions, 9581 events. 6166/9581 cut-off events. For 846596/846596 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 58971 event pairs, 2099 based on Foata normal form. 2/9582 useless extension candidates. Maximal degree in co-relation 80425. Up to 9553 conditions per place. 
[2024-06-04 18:19:00,015 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 356 selfloop transitions, 15 changer transitions 0/374 dead transitions.
[2024-06-04 18:19:00,015 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 374 transitions, 5989 flow
[2024-06-04 18:19:00,015 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:19:00,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:19:00,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions.
[2024-06-04 18:19:00,016 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3519163763066202
[2024-06-04 18:19:00,016 INFO  L175             Difference]: Start difference. First operand has 254 places, 361 transitions, 5183 flow. Second operand 7 states and 101 transitions.
[2024-06-04 18:19:00,016 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 374 transitions, 5989 flow
[2024-06-04 18:19:01,331 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 374 transitions, 5888 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-04 18:19:01,335 INFO  L231             Difference]: Finished difference. Result has 254 places, 363 transitions, 5159 flow
[2024-06-04 18:19:01,336 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5082, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5159, PETRI_PLACES=254, PETRI_TRANSITIONS=363}
[2024-06-04 18:19:01,336 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places.
[2024-06-04 18:19:01,336 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 363 transitions, 5159 flow
[2024-06-04 18:19:01,336 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-04 18:19:01,337 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:01,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-04 18:19:01,337 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-04 18:19:01,337 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:01,337 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:01,337 INFO  L85        PathProgramCache]: Analyzing trace with hash -434686524, now seen corresponding path program 1 times
[2024-06-04 18:19:01,338 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:01,338 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495179949]
[2024-06-04 18:19:01,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:01,338 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:01,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:09,280 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:09,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:09,281 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495179949]
[2024-06-04 18:19:09,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495179949] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:09,281 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:09,281 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:19:09,281 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371195536]
[2024-06-04 18:19:09,281 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:09,281 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:19:09,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:09,282 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:19:09,282 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:19:09,399 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:19:09,399 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 363 transitions, 5159 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-04 18:19:09,399 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:09,399 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:19:09,399 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:11,975 INFO  L124   PetriNetUnfolderBase]: 6186/9610 cut-off events.
[2024-06-04 18:19:11,976 INFO  L125   PetriNetUnfolderBase]: For 873828/873834 co-relation queries the response was YES.
[2024-06-04 18:19:12,030 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81207 conditions, 9610 events. 6186/9610 cut-off events. For 873828/873834 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 59413 event pairs, 1820 based on Foata normal form. 8/9616 useless extension candidates. Maximal degree in co-relation 81081. Up to 8895 conditions per place. 
[2024-06-04 18:19:12,062 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 304 selfloop transitions, 104 changer transitions 0/411 dead transitions.
[2024-06-04 18:19:12,063 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 411 transitions, 6479 flow
[2024-06-04 18:19:12,063 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:19:12,063 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:19:12,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions.
[2024-06-04 18:19:12,064 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43658536585365854
[2024-06-04 18:19:12,064 INFO  L175             Difference]: Start difference. First operand has 254 places, 363 transitions, 5159 flow. Second operand 10 states and 179 transitions.
[2024-06-04 18:19:12,064 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 411 transitions, 6479 flow
[2024-06-04 18:19:12,963 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 411 transitions, 6418 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-04 18:19:12,968 INFO  L231             Difference]: Finished difference. Result has 260 places, 369 transitions, 5473 flow
[2024-06-04 18:19:12,968 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5098, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5473, PETRI_PLACES=260, PETRI_TRANSITIONS=369}
[2024-06-04 18:19:12,968 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 218 predicate places.
[2024-06-04 18:19:12,968 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 369 transitions, 5473 flow
[2024-06-04 18:19:12,969 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-04 18:19:12,969 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:12,969 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:19:12,969 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-04 18:19:12,969 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:12,969 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:12,969 INFO  L85        PathProgramCache]: Analyzing trace with hash 1595841585, now seen corresponding path program 1 times
[2024-06-04 18:19:12,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:12,969 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330131377]
[2024-06-04 18:19:12,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:12,970 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:12,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:19,683 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:19,683 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:19,683 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330131377]
[2024-06-04 18:19:19,683 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330131377] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:19,683 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:19,683 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:19:19,683 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195523425]
[2024-06-04 18:19:19,684 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:19,684 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:19:19,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:19,684 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:19:19,684 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:19:19,791 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:19:19,791 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 369 transitions, 5473 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-04 18:19:19,791 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:19,791 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:19:19,791 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:22,327 INFO  L124   PetriNetUnfolderBase]: 6402/9911 cut-off events.
[2024-06-04 18:19:22,327 INFO  L125   PetriNetUnfolderBase]: For 963016/963019 co-relation queries the response was YES.
[2024-06-04 18:19:22,390 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85708 conditions, 9911 events. 6402/9911 cut-off events. For 963016/963019 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 61253 event pairs, 1515 based on Foata normal form. 16/9924 useless extension candidates. Maximal degree in co-relation 85580. Up to 7848 conditions per place. 
[2024-06-04 18:19:22,426 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 261 selfloop transitions, 172 changer transitions 0/436 dead transitions.
[2024-06-04 18:19:22,427 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 436 transitions, 7586 flow
[2024-06-04 18:19:22,427 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:19:22,427 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:19:22,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-04 18:19:22,428 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4847560975609756
[2024-06-04 18:19:22,428 INFO  L175             Difference]: Start difference. First operand has 260 places, 369 transitions, 5473 flow. Second operand 8 states and 159 transitions.
[2024-06-04 18:19:22,428 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 436 transitions, 7586 flow
[2024-06-04 18:19:23,600 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 436 transitions, 7313 flow, removed 24 selfloop flow, removed 9 redundant places.
[2024-06-04 18:19:23,605 INFO  L231             Difference]: Finished difference. Result has 260 places, 394 transitions, 6073 flow
[2024-06-04 18:19:23,605 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5200, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6073, PETRI_PLACES=260, PETRI_TRANSITIONS=394}
[2024-06-04 18:19:23,605 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 218 predicate places.
[2024-06-04 18:19:23,605 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 394 transitions, 6073 flow
[2024-06-04 18:19:23,606 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-04 18:19:23,606 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:23,606 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:19:23,606 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-04 18:19:23,606 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:23,606 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:23,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 11922004, now seen corresponding path program 1 times
[2024-06-04 18:19:23,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:23,606 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457433293]
[2024-06-04 18:19:23,606 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:23,606 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:23,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:30,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:30,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:30,036 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457433293]
[2024-06-04 18:19:30,036 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457433293] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:30,036 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:30,036 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:19:30,036 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076489758]
[2024-06-04 18:19:30,036 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:30,036 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:19:30,036 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:30,036 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:19:30,037 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:19:30,118 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:19:30,118 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 394 transitions, 6073 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-04 18:19:30,118 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:30,118 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:19:30,118 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:32,556 INFO  L124   PetriNetUnfolderBase]: 6400/9908 cut-off events.
[2024-06-04 18:19:32,556 INFO  L125   PetriNetUnfolderBase]: For 966367/966373 co-relation queries the response was YES.
[2024-06-04 18:19:32,621 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 87763 conditions, 9908 events. 6400/9908 cut-off events. For 966367/966373 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 61251 event pairs, 1864 based on Foata normal form. 10/9916 useless extension candidates. Maximal degree in co-relation 87633. Up to 9411 conditions per place. 
[2024-06-04 18:19:32,657 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 351 selfloop transitions, 72 changer transitions 0/426 dead transitions.
[2024-06-04 18:19:32,657 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 426 transitions, 7325 flow
[2024-06-04 18:19:32,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:19:32,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:19:32,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-04 18:19:32,658 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4298780487804878
[2024-06-04 18:19:32,658 INFO  L175             Difference]: Start difference. First operand has 260 places, 394 transitions, 6073 flow. Second operand 8 states and 141 transitions.
[2024-06-04 18:19:32,658 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 426 transitions, 7325 flow
[2024-06-04 18:19:33,859 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 426 transitions, 7133 flow, removed 83 selfloop flow, removed 2 redundant places.
[2024-06-04 18:19:33,864 INFO  L231             Difference]: Finished difference. Result has 266 places, 398 transitions, 6100 flow
[2024-06-04 18:19:33,864 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5881, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6100, PETRI_PLACES=266, PETRI_TRANSITIONS=398}
[2024-06-04 18:19:33,865 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 224 predicate places.
[2024-06-04 18:19:33,865 INFO  L495      AbstractCegarLoop]: Abstraction has has 266 places, 398 transitions, 6100 flow
[2024-06-04 18:19:33,865 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-04 18:19:33,865 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:33,865 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:19:33,865 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-04 18:19:33,865 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:33,865 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:33,866 INFO  L85        PathProgramCache]: Analyzing trace with hash 6565204, now seen corresponding path program 2 times
[2024-06-04 18:19:33,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:33,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451410524]
[2024-06-04 18:19:33,866 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:33,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:33,893 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:40,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:40,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:40,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451410524]
[2024-06-04 18:19:40,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451410524] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:40,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:40,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:19:40,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784790671]
[2024-06-04 18:19:40,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:40,401 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:19:40,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:40,401 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:19:40,401 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:19:40,539 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:19:40,539 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 398 transitions, 6100 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-04 18:19:40,540 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:40,540 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:19:40,540 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:42,896 INFO  L124   PetriNetUnfolderBase]: 6394/9900 cut-off events.
[2024-06-04 18:19:42,896 INFO  L125   PetriNetUnfolderBase]: For 964242/964248 co-relation queries the response was YES.
[2024-06-04 18:19:42,963 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85454 conditions, 9900 events. 6394/9900 cut-off events. For 964242/964248 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 61119 event pairs, 1872 based on Foata normal form. 6/9904 useless extension candidates. Maximal degree in co-relation 85322. Up to 9408 conditions per place. 
[2024-06-04 18:19:42,999 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 343 selfloop transitions, 76 changer transitions 0/422 dead transitions.
[2024-06-04 18:19:42,999 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 422 transitions, 7272 flow
[2024-06-04 18:19:43,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:19:43,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:19:43,000 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-04 18:19:43,000 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-04 18:19:43,000 INFO  L175             Difference]: Start difference. First operand has 266 places, 398 transitions, 6100 flow. Second operand 8 states and 136 transitions.
[2024-06-04 18:19:43,000 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 422 transitions, 7272 flow
[2024-06-04 18:19:44,369 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 422 transitions, 7151 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-04 18:19:44,374 INFO  L231             Difference]: Finished difference. Result has 269 places, 398 transitions, 6140 flow
[2024-06-04 18:19:44,375 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5979, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6140, PETRI_PLACES=269, PETRI_TRANSITIONS=398}
[2024-06-04 18:19:44,375 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 227 predicate places.
[2024-06-04 18:19:44,375 INFO  L495      AbstractCegarLoop]: Abstraction has has 269 places, 398 transitions, 6140 flow
[2024-06-04 18:19:44,375 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-04 18:19:44,375 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:44,376 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:19:44,376 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-04 18:19:44,376 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:44,376 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:44,376 INFO  L85        PathProgramCache]: Analyzing trace with hash -1900131720, now seen corresponding path program 1 times
[2024-06-04 18:19:44,376 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:44,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935275793]
[2024-06-04 18:19:44,377 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:44,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:44,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:51,314 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:51,314 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:51,314 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935275793]
[2024-06-04 18:19:51,314 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935275793] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:51,314 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:51,314 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:19:51,314 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855985421]
[2024-06-04 18:19:51,314 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:51,315 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:19:51,315 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:51,315 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:19:51,315 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:19:51,529 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:19:51,529 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 398 transitions, 6140 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-04 18:19:51,529 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:51,529 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:19:51,529 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:54,112 INFO  L124   PetriNetUnfolderBase]: 6462/10016 cut-off events.
[2024-06-04 18:19:54,112 INFO  L125   PetriNetUnfolderBase]: For 1034978/1034984 co-relation queries the response was YES.
[2024-06-04 18:19:54,181 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 87101 conditions, 10016 events. 6462/10016 cut-off events. For 1034978/1034984 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 62106 event pairs, 1868 based on Foata normal form. 22/10036 useless extension candidates. Maximal degree in co-relation 86968. Up to 9396 conditions per place. 
[2024-06-04 18:19:54,218 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 360 selfloop transitions, 79 changer transitions 0/442 dead transitions.
[2024-06-04 18:19:54,219 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 442 transitions, 7406 flow
[2024-06-04 18:19:54,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:19:54,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:19:54,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-04 18:19:54,220 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4219512195121951
[2024-06-04 18:19:54,220 INFO  L175             Difference]: Start difference. First operand has 269 places, 398 transitions, 6140 flow. Second operand 10 states and 173 transitions.
[2024-06-04 18:19:54,220 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 442 transitions, 7406 flow
[2024-06-04 18:19:55,641 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 442 transitions, 7283 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-04 18:19:55,647 INFO  L231             Difference]: Finished difference. Result has 274 places, 400 transitions, 6318 flow
[2024-06-04 18:19:55,647 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6017, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6318, PETRI_PLACES=274, PETRI_TRANSITIONS=400}
[2024-06-04 18:19:55,647 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 232 predicate places.
[2024-06-04 18:19:55,647 INFO  L495      AbstractCegarLoop]: Abstraction has has 274 places, 400 transitions, 6318 flow
[2024-06-04 18:19:55,648 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-04 18:19:55,648 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:55,648 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:19:55,648 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-04 18:19:55,648 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:55,648 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:55,648 INFO  L85        PathProgramCache]: Analyzing trace with hash -381200346, now seen corresponding path program 2 times
[2024-06-04 18:19:55,648 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:55,648 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408821599]
[2024-06-04 18:19:55,648 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:55,649 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:55,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:01,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:01,235 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:01,235 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408821599]
[2024-06-04 18:20:01,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408821599] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:01,235 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:01,235 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:20:01,235 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784228273]
[2024-06-04 18:20:01,236 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:01,236 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:20:01,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:01,236 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:20:01,236 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:20:01,464 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:20:01,464 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 400 transitions, 6318 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-04 18:20:01,464 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:01,464 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:20:01,464 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:04,252 INFO  L124   PetriNetUnfolderBase]: 6890/10709 cut-off events.
[2024-06-04 18:20:04,252 INFO  L125   PetriNetUnfolderBase]: For 1266962/1266965 co-relation queries the response was YES.
[2024-06-04 18:20:04,327 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94371 conditions, 10709 events. 6890/10709 cut-off events. For 1266962/1266965 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 67591 event pairs, 1680 based on Foata normal form. 54/10760 useless extension candidates. Maximal degree in co-relation 94237. Up to 8668 conditions per place. 
[2024-06-04 18:20:04,368 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 350 selfloop transitions, 114 changer transitions 0/467 dead transitions.
[2024-06-04 18:20:04,368 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 467 transitions, 8407 flow
[2024-06-04 18:20:04,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:20:04,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:20:04,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-04 18:20:04,369 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4986449864498645
[2024-06-04 18:20:04,369 INFO  L175             Difference]: Start difference. First operand has 274 places, 400 transitions, 6318 flow. Second operand 9 states and 184 transitions.
[2024-06-04 18:20:04,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 467 transitions, 8407 flow
[2024-06-04 18:20:05,897 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 467 transitions, 8136 flow, removed 58 selfloop flow, removed 8 redundant places.
[2024-06-04 18:20:05,903 INFO  L231             Difference]: Finished difference. Result has 276 places, 405 transitions, 6511 flow
[2024-06-04 18:20:05,903 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6047, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6511, PETRI_PLACES=276, PETRI_TRANSITIONS=405}
[2024-06-04 18:20:05,903 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 234 predicate places.
[2024-06-04 18:20:05,903 INFO  L495      AbstractCegarLoop]: Abstraction has has 276 places, 405 transitions, 6511 flow
[2024-06-04 18:20:05,903 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-04 18:20:05,903 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:05,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-04 18:20:05,904 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-04 18:20:05,904 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:05,904 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:05,904 INFO  L85        PathProgramCache]: Analyzing trace with hash -553920876, now seen corresponding path program 3 times
[2024-06-04 18:20:05,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:05,904 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227376027]
[2024-06-04 18:20:05,904 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:05,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:05,947 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:12,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:12,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:12,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227376027]
[2024-06-04 18:20:12,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227376027] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:12,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:12,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:20:12,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115838905]
[2024-06-04 18:20:12,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:12,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:20:12,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:12,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:20:12,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:20:12,554 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:20:12,554 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 405 transitions, 6511 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-04 18:20:12,554 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:12,554 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:20:12,554 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:15,638 INFO  L124   PetriNetUnfolderBase]: 7174/11184 cut-off events.
[2024-06-04 18:20:15,639 INFO  L125   PetriNetUnfolderBase]: For 1325397/1325403 co-relation queries the response was YES.
[2024-06-04 18:20:15,718 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 98620 conditions, 11184 events. 7174/11184 cut-off events. For 1325397/1325403 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 71444 event pairs, 1837 based on Foata normal form. 58/11240 useless extension candidates. Maximal degree in co-relation 98484. Up to 9544 conditions per place. 
[2024-06-04 18:20:15,760 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 349 selfloop transitions, 122 changer transitions 0/474 dead transitions.
[2024-06-04 18:20:15,760 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 474 transitions, 8618 flow
[2024-06-04 18:20:15,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:20:15,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:20:15,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 200 transitions.
[2024-06-04 18:20:15,761 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4878048780487805
[2024-06-04 18:20:15,761 INFO  L175             Difference]: Start difference. First operand has 276 places, 405 transitions, 6511 flow. Second operand 10 states and 200 transitions.
[2024-06-04 18:20:15,761 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 474 transitions, 8618 flow
[2024-06-04 18:20:17,775 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 474 transitions, 8440 flow, removed 59 selfloop flow, removed 3 redundant places.
[2024-06-04 18:20:17,781 INFO  L231             Difference]: Finished difference. Result has 284 places, 408 transitions, 6762 flow
[2024-06-04 18:20:17,781 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6335, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6762, PETRI_PLACES=284, PETRI_TRANSITIONS=408}
[2024-06-04 18:20:17,781 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 242 predicate places.
[2024-06-04 18:20:17,782 INFO  L495      AbstractCegarLoop]: Abstraction has has 284 places, 408 transitions, 6762 flow
[2024-06-04 18:20:17,782 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-04 18:20:17,782 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:17,782 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:17,782 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-04 18:20:17,782 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:17,782 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:17,782 INFO  L85        PathProgramCache]: Analyzing trace with hash 1411829615, now seen corresponding path program 2 times
[2024-06-04 18:20:17,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:17,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668711645]
[2024-06-04 18:20:17,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:17,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:17,814 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:24,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:24,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:24,860 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668711645]
[2024-06-04 18:20:24,860 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668711645] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:24,860 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:24,860 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:20:24,860 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836731981]
[2024-06-04 18:20:24,860 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:24,860 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:20:24,860 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:24,861 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:20:24,861 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:20:24,922 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:20:24,922 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 408 transitions, 6762 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-04 18:20:24,922 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:24,922 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:20:24,922 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:28,693 INFO  L124   PetriNetUnfolderBase]: 7666/11864 cut-off events.
[2024-06-04 18:20:28,693 INFO  L125   PetriNetUnfolderBase]: For 1410218/1410221 co-relation queries the response was YES.
[2024-06-04 18:20:28,760 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109059 conditions, 11864 events. 7666/11864 cut-off events. For 1410218/1410221 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 75310 event pairs, 1902 based on Foata normal form. 8/11869 useless extension candidates. Maximal degree in co-relation 108920. Up to 9375 conditions per place. 
[2024-06-04 18:20:28,799 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 283 selfloop transitions, 205 changer transitions 0/491 dead transitions.
[2024-06-04 18:20:28,799 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 491 transitions, 9535 flow
[2024-06-04 18:20:28,799 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:20:28,800 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:20:28,800 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-04 18:20:28,800 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-04 18:20:28,800 INFO  L175             Difference]: Start difference. First operand has 284 places, 408 transitions, 6762 flow. Second operand 8 states and 152 transitions.
[2024-06-04 18:20:28,800 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 491 transitions, 9535 flow
[2024-06-04 18:20:30,625 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 491 transitions, 9151 flow, removed 57 selfloop flow, removed 7 redundant places.
[2024-06-04 18:20:30,632 INFO  L231             Difference]: Finished difference. Result has 287 places, 452 transitions, 7858 flow
[2024-06-04 18:20:30,632 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6414, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7858, PETRI_PLACES=287, PETRI_TRANSITIONS=452}
[2024-06-04 18:20:30,632 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 245 predicate places.
[2024-06-04 18:20:30,633 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 452 transitions, 7858 flow
[2024-06-04 18:20:30,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-04 18:20:30,633 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:30,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-04 18:20:30,633 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-04 18:20:30,633 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:30,634 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:30,634 INFO  L85        PathProgramCache]: Analyzing trace with hash -425162983, now seen corresponding path program 3 times
[2024-06-04 18:20:30,634 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:30,634 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970602892]
[2024-06-04 18:20:30,634 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:30,634 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:30,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:37,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:37,941 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:37,941 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970602892]
[2024-06-04 18:20:37,941 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970602892] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:37,941 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:37,941 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:20:37,941 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209274905]
[2024-06-04 18:20:37,941 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:37,941 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:20:37,941 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:37,942 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:20:37,942 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:20:38,085 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:20:38,085 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 452 transitions, 7858 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-04 18:20:38,085 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:38,086 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:20:38,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:41,916 INFO  L124   PetriNetUnfolderBase]: 7646/11841 cut-off events.
[2024-06-04 18:20:41,916 INFO  L125   PetriNetUnfolderBase]: For 1413970/1413976 co-relation queries the response was YES.
[2024-06-04 18:20:42,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109150 conditions, 11841 events. 7646/11841 cut-off events. For 1413970/1413976 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 75283 event pairs, 1901 based on Foata normal form. 20/11859 useless extension candidates. Maximal degree in co-relation 109008. Up to 9374 conditions per place. 
[2024-06-04 18:20:42,158 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 289 selfloop transitions, 206 changer transitions 0/498 dead transitions.
[2024-06-04 18:20:42,158 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 498 transitions, 9871 flow
[2024-06-04 18:20:42,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:20:42,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:20:42,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions.
[2024-06-04 18:20:42,159 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45528455284552843
[2024-06-04 18:20:42,159 INFO  L175             Difference]: Start difference. First operand has 287 places, 452 transitions, 7858 flow. Second operand 9 states and 168 transitions.
[2024-06-04 18:20:42,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 498 transitions, 9871 flow
[2024-06-04 18:20:43,665 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 498 transitions, 9474 flow, removed 121 selfloop flow, removed 3 redundant places.
[2024-06-04 18:20:43,672 INFO  L231             Difference]: Finished difference. Result has 295 places, 459 transitions, 8223 flow
[2024-06-04 18:20:43,672 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7485, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8223, PETRI_PLACES=295, PETRI_TRANSITIONS=459}
[2024-06-04 18:20:43,672 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 253 predicate places.
[2024-06-04 18:20:43,672 INFO  L495      AbstractCegarLoop]: Abstraction has has 295 places, 459 transitions, 8223 flow
[2024-06-04 18:20:43,672 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-04 18:20:43,672 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:43,672 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:43,673 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-04 18:20:43,673 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:43,673 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:43,673 INFO  L85        PathProgramCache]: Analyzing trace with hash -425163324, now seen corresponding path program 2 times
[2024-06-04 18:20:43,673 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:43,673 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873805621]
[2024-06-04 18:20:43,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:43,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:43,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:50,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:50,563 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:50,563 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873805621]
[2024-06-04 18:20:50,563 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873805621] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:50,563 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:50,563 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:20:50,564 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278969700]
[2024-06-04 18:20:50,564 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:50,564 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:20:50,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:50,564 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:20:50,564 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:20:50,715 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:20:50,716 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 459 transitions, 8223 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-04 18:20:50,716 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:50,716 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:20:50,716 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:54,185 INFO  L124   PetriNetUnfolderBase]: 7623/11814 cut-off events.
[2024-06-04 18:20:54,185 INFO  L125   PetriNetUnfolderBase]: For 1407144/1407147 co-relation queries the response was YES.
[2024-06-04 18:20:54,260 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 108259 conditions, 11814 events. 7623/11814 cut-off events. For 1407144/1407147 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 75230 event pairs, 2013 based on Foata normal form. 13/11824 useless extension candidates. Maximal degree in co-relation 108114. Up to 10441 conditions per place. 
[2024-06-04 18:20:54,301 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 356 selfloop transitions, 134 changer transitions 0/493 dead transitions.
[2024-06-04 18:20:54,301 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 493 transitions, 9971 flow
[2024-06-04 18:20:54,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:20:54,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:20:54,302 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-04 18:20:54,302 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573170731707317
[2024-06-04 18:20:54,302 INFO  L175             Difference]: Start difference. First operand has 295 places, 459 transitions, 8223 flow. Second operand 8 states and 150 transitions.
[2024-06-04 18:20:54,302 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 493 transitions, 9971 flow
[2024-06-04 18:20:56,379 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 493 transitions, 9604 flow, removed 38 selfloop flow, removed 5 redundant places.
[2024-06-04 18:20:56,386 INFO  L231             Difference]: Finished difference. Result has 298 places, 461 transitions, 8190 flow
[2024-06-04 18:20:56,386 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7856, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8190, PETRI_PLACES=298, PETRI_TRANSITIONS=461}
[2024-06-04 18:20:56,386 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 256 predicate places.
[2024-06-04 18:20:56,386 INFO  L495      AbstractCegarLoop]: Abstraction has has 298 places, 461 transitions, 8190 flow
[2024-06-04 18:20:56,387 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-04 18:20:56,387 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:56,387 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:56,387 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-04 18:20:56,387 INFO  L420      AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:56,387 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:56,388 INFO  L85        PathProgramCache]: Analyzing trace with hash -779088572, now seen corresponding path program 3 times
[2024-06-04 18:20:56,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:56,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138860622]
[2024-06-04 18:20:56,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:56,388 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:56,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:03,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-04 18:21:03,401 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:03,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138860622]
[2024-06-04 18:21:03,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138860622] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:03,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:03,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:21:03,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510365209]
[2024-06-04 18:21:03,402 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:03,402 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:21:03,402 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:03,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:21:03,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:21:03,487 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-04 18:21:03,488 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 461 transitions, 8190 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-04 18:21:03,488 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:03,488 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-04 18:21:03,488 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand