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


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix035_power.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-04 17:13:51,707 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 17:13:51,765 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 17:13:51,772 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 17:13:51,773 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 17:13:51,792 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 17:13:51,795 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 17:13:51,795 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 17:13:51,795 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 17:13:51,798 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 17:13:51,799 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 17:13:51,799 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 17:13:51,799 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 17:13:51,800 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 17:13:51,800 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 17:13:51,801 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 17:13:51,801 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 17:13:51,801 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 17:13:51,802 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 17:13:51,802 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 17:13:51,802 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 17:13:51,803 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 17:13:51,803 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 17:13:51,803 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 17:13:51,804 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 17:13:51,804 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 17:13:51,804 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 17:13:51,804 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 17:13:51,805 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 17:13:51,805 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 17:13:51,806 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 17:13:51,806 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 17:13:51,806 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 17:13:51,806 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 17:13:51,807 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 17:13:51,807 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 17:13:51,807 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 17:13:51,807 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 17:13:51,807 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 17:13:51,807 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 17:13:51,808 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 17:13:51,808 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 17:13:51,808 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 17:13:51,808 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 17:13:52,024 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 17:13:52,046 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 17:13:52,048 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 17:13:52,049 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 17:13:52,049 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 17:13:52,050 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i
[2024-06-04 17:13:53,043 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 17:13:53,257 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 17:13:53,258 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i
[2024-06-04 17:13:53,272 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516901209/4cc21e81e9da4ac9a6619a9b2ffaeb76/FLAG2b6d78a7a
[2024-06-04 17:13:53,283 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516901209/4cc21e81e9da4ac9a6619a9b2ffaeb76
[2024-06-04 17:13:53,285 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 17:13:53,286 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 17:13:53,286 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/mix035_power.opt_rmo.opt.yml/witness.yml
[2024-06-04 17:13:53,490 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 17:13:53,491 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 17:13:53,492 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 17:13:53,492 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 17:13:53,496 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 17:13:53,496 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:13:53" (1/2) ...
[2024-06-04 17:13:53,497 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee8f9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:13:53, skipping insertion in model container
[2024-06-04 17:13:53,497 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:13:53" (1/2) ...
[2024-06-04 17:13:53,499 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@56cf887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:13:53, skipping insertion in model container
[2024-06-04 17:13:53,499 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:13:53" (2/2) ...
[2024-06-04 17:13:53,499 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee8f9e2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:53, skipping insertion in model container
[2024-06-04 17:13:53,500 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:13:53" (2/2) ...
[2024-06-04 17:13:53,500 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 17:13:53,573 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 17:13:53,575 INFO  L97    edCorrectnessWitness]: Location invariant before [L844-L844] (((((((((((((((((((((! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )a) - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-04 17:13:53,576 INFO  L97    edCorrectnessWitness]: Location invariant before [L847-L847] (((((((((((((((((((((! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )a) - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-04 17:13:53,576 INFO  L97    edCorrectnessWitness]: Location invariant before [L846-L846] (((((((((((((((((((((! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )a) - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-04 17:13:53,577 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 17:13:53,577 INFO  L106   edCorrectnessWitness]: ghost_update [L842-L842] multithreaded = 1;
[2024-06-04 17:13:53,612 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 17:13:53,902 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 17:13:53,912 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-04 17:13:54,193 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 17:13:54,217 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 17:13:54,218 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54 WrapperNode
[2024-06-04 17:13:54,218 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 17:13:54,256 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 17:13:54,256 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 17:13:54,256 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 17:13:54,261 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (1/1) ...
[2024-06-04 17:13:54,302 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (1/1) ...
[2024-06-04 17:13:54,411 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128
[2024-06-04 17:13:54,411 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 17:13:54,412 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 17:13:54,412 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 17:13:54,412 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 17:13:54,421 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (1/1) ...
[2024-06-04 17:13:54,421 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (1/1) ...
[2024-06-04 17:13:54,448 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (1/1) ...
[2024-06-04 17:13:54,504 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 17:13:54,504 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (1/1) ...
[2024-06-04 17:13:54,504 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (1/1) ...
[2024-06-04 17:13:54,546 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (1/1) ...
[2024-06-04 17:13:54,548 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (1/1) ...
[2024-06-04 17:13:54,560 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (1/1) ...
[2024-06-04 17:13:54,565 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (1/1) ...
[2024-06-04 17:13:54,601 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 17:13:54,602 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 17:13:54,602 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 17:13:54,602 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 17:13:54,603 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (1/1) ...
[2024-06-04 17:13:54,607 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 17:13:54,613 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 17:13:54,626 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 17:13:54,632 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 17:13:54,666 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 17:13:54,666 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 17:13:54,667 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 17:13:54,667 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 17:13:54,667 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 17:13:54,667 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 17:13:54,667 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 17:13:54,667 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 17:13:54,668 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 17:13:54,668 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 17:13:54,668 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 17:13:54,668 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 17:13:54,669 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 17:13:54,788 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 17:13:54,790 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 17:13:56,045 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 17:13:56,046 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 17:13:56,324 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 17:13:56,324 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 17:13:56,332 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:13:56 BoogieIcfgContainer
[2024-06-04 17:13:56,332 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 17:13:56,334 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 17:13:56,334 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 17:13:56,337 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 17:13:56,337 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:13:53" (1/4) ...
[2024-06-04 17:13:56,338 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7027eab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:13:56, skipping insertion in model container
[2024-06-04 17:13:56,338 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:13:53" (2/4) ...
[2024-06-04 17:13:56,338 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7027eab8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:13:56, skipping insertion in model container
[2024-06-04 17:13:56,338 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:54" (3/4) ...
[2024-06-04 17:13:56,338 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7027eab8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:13:56, skipping insertion in model container
[2024-06-04 17:13:56,339 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:13:56" (4/4) ...
[2024-06-04 17:13:56,340 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i
[2024-06-04 17:13:56,353 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 17:13:56,353 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 17:13:56,353 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 17:13:56,444 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 17:13:56,472 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow
[2024-06-04 17:13:56,520 INFO  L124   PetriNetUnfolderBase]: 0/40 cut-off events.
[2024-06-04 17:13:56,521 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 17:13:56,523 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-04 17:13:56,524 INFO  L82        GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow
[2024-06-04 17:13:56,526 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow
[2024-06-04 17:13:56,563 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 17:13:56,569 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;@2f2e3439, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 17:13:56,570 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 17:13:56,577 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 17:13:56,578 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-04 17:13:56,578 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 17:13:56,578 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:13:56,579 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 17:13:56,579 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 17:13:56,589 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:13:56,589 INFO  L85        PathProgramCache]: Analyzing trace with hash -1358440230, now seen corresponding path program 1 times
[2024-06-04 17:13:56,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:13:56,611 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540936973]
[2024-06-04 17:13:56,612 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:13:56,613 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:13:57,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:14:02,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 17:14:02,499 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:14:02,499 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540936973]
[2024-06-04 17:14:02,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540936973] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:14:02,500 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:14:02,500 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 17:14:02,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250819178]
[2024-06-04 17:14:02,502 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:14:02,508 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 17:14:02,511 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:14:02,532 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 17:14:02,533 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 17:14:02,632 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 17:14:02,634 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:14:02,634 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:14:02,634 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 17:14:02,635 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:14:03,357 INFO  L124   PetriNetUnfolderBase]: 1116/1817 cut-off events.
[2024-06-04 17:14:03,357 INFO  L125   PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES.
[2024-06-04 17:14:03,364 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3570 conditions, 1817 events. 1116/1817 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9170 event pairs, 765 based on Foata normal form. 1/1763 useless extension candidates. Maximal degree in co-relation 3555. Up to 1676 conditions per place. 
[2024-06-04 17:14:03,373 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 33 selfloop transitions, 4 changer transitions 0/44 dead transitions.
[2024-06-04 17:14:03,374 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 177 flow
[2024-06-04 17:14:03,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 17:14:03,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 17:14:03,382 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions.
[2024-06-04 17:14:03,383 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6124031007751938
[2024-06-04 17:14:03,385 INFO  L175             Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 79 transitions.
[2024-06-04 17:14:03,385 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 177 flow
[2024-06-04 17:14:03,388 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 17:14:03,392 INFO  L231             Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow
[2024-06-04 17:14:03,394 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37}
[2024-06-04 17:14:03,396 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places.
[2024-06-04 17:14:03,397 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow
[2024-06-04 17:14:03,397 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:14:03,397 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:14:03,397 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:14:03,397 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 17:14:03,398 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 17:14:03,398 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:14:03,399 INFO  L85        PathProgramCache]: Analyzing trace with hash 209036473, now seen corresponding path program 1 times
[2024-06-04 17:14:03,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:14:03,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495795816]
[2024-06-04 17:14:03,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:14:03,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:14:03,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:14:07,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:14:07,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:14:07,876 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495795816]
[2024-06-04 17:14:07,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495795816] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:14:07,877 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:14:07,877 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 17:14:07,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336222420]
[2024-06-04 17:14:07,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:14:07,878 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 17:14:07,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:14:07,879 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 17:14:07,879 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-04 17:14:07,996 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:14:07,996 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:14:07,997 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:14:07,997 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:14:07,997 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:14:08,783 INFO  L124   PetriNetUnfolderBase]: 1280/2008 cut-off events.
[2024-06-04 17:14:08,784 INFO  L125   PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES.
[2024-06-04 17:14:08,787 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4531 conditions, 2008 events. 1280/2008 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9863 event pairs, 750 based on Foata normal form. 3/1985 useless extension candidates. Maximal degree in co-relation 4516. Up to 1897 conditions per place. 
[2024-06-04 17:14:08,793 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 41 selfloop transitions, 7 changer transitions 0/54 dead transitions.
[2024-06-04 17:14:08,794 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 246 flow
[2024-06-04 17:14:08,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 17:14:08,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 17:14:08,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions.
[2024-06-04 17:14:08,795 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5755813953488372
[2024-06-04 17:14:08,795 INFO  L175             Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 99 transitions.
[2024-06-04 17:14:08,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 246 flow
[2024-06-04 17:14:08,796 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 17:14:08,812 INFO  L231             Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow
[2024-06-04 17:14:08,812 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40}
[2024-06-04 17:14:08,813 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places.
[2024-06-04 17:14:08,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow
[2024-06-04 17:14:08,813 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:14:08,813 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:14:08,813 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:14:08,813 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 17:14:08,813 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 17:14:08,814 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:14:08,814 INFO  L85        PathProgramCache]: Analyzing trace with hash -2109802633, now seen corresponding path program 1 times
[2024-06-04 17:14:08,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:14:08,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576498387]
[2024-06-04 17:14:08,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:14:08,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:14:08,919 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:14:14,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:14:14,296 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:14:14,296 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576498387]
[2024-06-04 17:14:14,296 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576498387] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:14:14,296 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:14:14,296 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-04 17:14:14,296 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216069869]
[2024-06-04 17:14:14,297 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:14:14,297 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-04 17:14:14,297 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:14:14,298 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-04 17:14:14,298 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-04 17:14:14,421 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:14:14,421 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 flow. Second operand  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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 17:14:14,422 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:14:14,422 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:14:14,422 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:14:15,343 INFO  L124   PetriNetUnfolderBase]: 1274/2001 cut-off events.
[2024-06-04 17:14:15,343 INFO  L125   PetriNetUnfolderBase]: For 1079/1079 co-relation queries the response was YES.
[2024-06-04 17:14:15,345 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5032 conditions, 2001 events. 1274/2001 cut-off events. For 1079/1079 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9848 event pairs, 608 based on Foata normal form. 3/1978 useless extension candidates. Maximal degree in co-relation 5015. Up to 1873 conditions per place. 
[2024-06-04 17:14:15,354 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 48 selfloop transitions, 10 changer transitions 0/64 dead transitions.
[2024-06-04 17:14:15,354 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 324 flow
[2024-06-04 17:14:15,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:14:15,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:14:15,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions.
[2024-06-04 17:14:15,360 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5627906976744186
[2024-06-04 17:14:15,360 INFO  L175             Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 5 states and 121 transitions.
[2024-06-04 17:14:15,360 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 324 flow
[2024-06-04 17:14:15,362 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 310 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-04 17:14:15,363 INFO  L231             Difference]: Finished difference. Result has 50 places, 43 transitions, 176 flow
[2024-06-04 17:14:15,364 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=43}
[2024-06-04 17:14:15,365 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places.
[2024-06-04 17:14:15,365 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 176 flow
[2024-06-04 17:14:15,365 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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 17:14:15,365 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:14:15,365 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:14:15,365 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 17:14:15,366 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 17:14:15,366 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:14:15,366 INFO  L85        PathProgramCache]: Analyzing trace with hash -295724106, now seen corresponding path program 1 times
[2024-06-04 17:14:15,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:14:15,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904947242]
[2024-06-04 17:14:15,367 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:14:15,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:14:15,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:14:21,123 INFO  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 17:14:21,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:14:21,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904947242]
[2024-06-04 17:14:21,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904947242] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:14:21,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:14:21,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:14:21,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842233040]
[2024-06-04 17:14:21,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:14:21,129 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:14:21,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:14:21,130 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:14:21,130 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:14:21,275 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:14:21,276 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 176 flow. Second operand  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:14:21,276 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:14:21,276 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:14:21,276 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:14:22,176 INFO  L124   PetriNetUnfolderBase]: 1265/1984 cut-off events.
[2024-06-04 17:14:22,176 INFO  L125   PetriNetUnfolderBase]: For 1998/1998 co-relation queries the response was YES.
[2024-06-04 17:14:22,178 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5480 conditions, 1984 events. 1265/1984 cut-off events. For 1998/1998 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9718 event pairs, 445 based on Foata normal form. 6/1964 useless extension candidates. Maximal degree in co-relation 5462. Up to 1828 conditions per place. 
[2024-06-04 17:14:22,186 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 52 selfloop transitions, 12 changer transitions 0/70 dead transitions.
[2024-06-04 17:14:22,186 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 378 flow
[2024-06-04 17:14:22,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:14:22,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:14:22,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions.
[2024-06-04 17:14:22,187 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5387596899224806
[2024-06-04 17:14:22,187 INFO  L175             Difference]: Start difference. First operand has 50 places, 43 transitions, 176 flow. Second operand 6 states and 139 transitions.
[2024-06-04 17:14:22,187 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 378 flow
[2024-06-04 17:14:22,189 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 354 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 17:14:22,190 INFO  L231             Difference]: Finished difference. Result has 52 places, 44 transitions, 195 flow
[2024-06-04 17:14:22,191 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=52, PETRI_TRANSITIONS=44}
[2024-06-04 17:14:22,191 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places.
[2024-06-04 17:14:22,191 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 195 flow
[2024-06-04 17:14:22,191 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:14:22,192 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:14:22,192 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:14:22,192 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 17:14:22,192 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:14:22,192 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:14:22,192 INFO  L85        PathProgramCache]: Analyzing trace with hash -1079015881, now seen corresponding path program 1 times
[2024-06-04 17:14:22,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:14:22,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998688024]
[2024-06-04 17:14:22,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:14:22,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:14:22,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:14:30,367 INFO  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 17:14:30,367 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:14:30,367 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998688024]
[2024-06-04 17:14:30,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998688024] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:14:30,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:14:30,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:14:30,368 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34804927]
[2024-06-04 17:14:30,368 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:14:30,369 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:14:30,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:14:30,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:14:30,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:14:30,477 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:14:30,477 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 195 flow. Second operand  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:14:30,477 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:14:30,477 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:14:30,477 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:14:31,279 INFO  L124   PetriNetUnfolderBase]: 1090/1820 cut-off events.
[2024-06-04 17:14:31,279 INFO  L125   PetriNetUnfolderBase]: For 2654/2654 co-relation queries the response was YES.
[2024-06-04 17:14:31,282 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5208 conditions, 1820 events. 1090/1820 cut-off events. For 2654/2654 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9344 event pairs, 460 based on Foata normal form. 2/1815 useless extension candidates. Maximal degree in co-relation 5189. Up to 1627 conditions per place. 
[2024-06-04 17:14:31,289 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 43 selfloop transitions, 8 changer transitions 0/58 dead transitions.
[2024-06-04 17:14:31,289 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 341 flow
[2024-06-04 17:14:31,289 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:14:31,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:14:31,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions.
[2024-06-04 17:14:31,290 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4883720930232558
[2024-06-04 17:14:31,290 INFO  L175             Difference]: Start difference. First operand has 52 places, 44 transitions, 195 flow. Second operand 5 states and 105 transitions.
[2024-06-04 17:14:31,291 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 341 flow
[2024-06-04 17:14:31,292 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 308 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-04 17:14:31,293 INFO  L231             Difference]: Finished difference. Result has 53 places, 47 transitions, 208 flow
[2024-06-04 17:14:31,293 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=53, PETRI_TRANSITIONS=47}
[2024-06-04 17:14:31,294 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places.
[2024-06-04 17:14:31,294 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 208 flow
[2024-06-04 17:14:31,294 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:14:31,294 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:14:31,294 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:14:31,295 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 17:14:31,295 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:14:31,295 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:14:31,295 INFO  L85        PathProgramCache]: Analyzing trace with hash -1852829226, now seen corresponding path program 1 times
[2024-06-04 17:14:31,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:14:31,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574156888]
[2024-06-04 17:14:31,296 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:14:31,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:14:31,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:14:40,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 17:14:40,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:14:40,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574156888]
[2024-06-04 17:14:40,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574156888] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:14:40,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:14:40,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:14:40,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276170378]
[2024-06-04 17:14:40,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:14:40,332 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:14:40,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:14:40,332 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:14:40,332 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:14:40,489 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:14:40,490 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 208 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:14:40,490 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:14:40,490 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:14:40,490 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:14:41,405 INFO  L124   PetriNetUnfolderBase]: 1282/2029 cut-off events.
[2024-06-04 17:14:41,406 INFO  L125   PetriNetUnfolderBase]: For 4361/4361 co-relation queries the response was YES.
[2024-06-04 17:14:41,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6365 conditions, 2029 events. 1282/2029 cut-off events. For 4361/4361 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10018 event pairs, 530 based on Foata normal form. 4/2022 useless extension candidates. Maximal degree in co-relation 6344. Up to 1880 conditions per place. 
[2024-06-04 17:14:41,416 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 52 selfloop transitions, 11 changer transitions 0/69 dead transitions.
[2024-06-04 17:14:41,416 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 404 flow
[2024-06-04 17:14:41,417 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:14:41,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:14:41,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions.
[2024-06-04 17:14:41,417 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47674418604651164
[2024-06-04 17:14:41,418 INFO  L175             Difference]: Start difference. First operand has 53 places, 47 transitions, 208 flow. Second operand 6 states and 123 transitions.
[2024-06-04 17:14:41,418 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 404 flow
[2024-06-04 17:14:41,419 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 382 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-04 17:14:41,420 INFO  L231             Difference]: Finished difference. Result has 56 places, 50 transitions, 242 flow
[2024-06-04 17:14:41,420 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=56, PETRI_TRANSITIONS=50}
[2024-06-04 17:14:41,421 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places.
[2024-06-04 17:14:41,421 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 242 flow
[2024-06-04 17:14:41,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:14:41,421 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:14:41,422 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:14:41,422 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 17:14:41,422 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 17:14:41,422 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:14:41,422 INFO  L85        PathProgramCache]: Analyzing trace with hash 20938972, now seen corresponding path program 2 times
[2024-06-04 17:14:41,422 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:14:41,422 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479561204]
[2024-06-04 17:14:41,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:14:41,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:14:41,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:14:50,133 INFO  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 17:14:50,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:14:50,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479561204]
[2024-06-04 17:14:50,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479561204] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:14:50,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:14:50,134 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:14:50,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220593739]
[2024-06-04 17:14:50,134 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:14:50,134 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:14:50,134 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:14:50,135 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:14:50,135 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:14:50,285 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:14:50,285 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 242 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:14:50,285 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:14:50,285 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:14:50,286 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:14:51,120 INFO  L124   PetriNetUnfolderBase]: 1288/2048 cut-off events.
[2024-06-04 17:14:51,121 INFO  L125   PetriNetUnfolderBase]: For 6011/6019 co-relation queries the response was YES.
[2024-06-04 17:14:51,124 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6918 conditions, 2048 events. 1288/2048 cut-off events. For 6011/6019 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10180 event pairs, 528 based on Foata normal form. 12/2052 useless extension candidates. Maximal degree in co-relation 6896. Up to 1862 conditions per place. 
[2024-06-04 17:14:51,134 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 48 selfloop transitions, 16 changer transitions 0/70 dead transitions.
[2024-06-04 17:14:51,135 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 442 flow
[2024-06-04 17:14:51,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:14:51,136 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:14:51,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions.
[2024-06-04 17:14:51,136 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47674418604651164
[2024-06-04 17:14:51,137 INFO  L175             Difference]: Start difference. First operand has 56 places, 50 transitions, 242 flow. Second operand 6 states and 123 transitions.
[2024-06-04 17:14:51,137 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 442 flow
[2024-06-04 17:14:51,139 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 412 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-04 17:14:51,140 INFO  L231             Difference]: Finished difference. Result has 58 places, 53 transitions, 284 flow
[2024-06-04 17:14:51,140 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=58, PETRI_TRANSITIONS=53}
[2024-06-04 17:14:51,142 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places.
[2024-06-04 17:14:51,142 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 284 flow
[2024-06-04 17:14:51,142 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:14:51,142 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:14:51,143 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:14:51,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 17:14:51,143 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 17:14:51,143 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:14:51,143 INFO  L85        PathProgramCache]: Analyzing trace with hash -1847107370, now seen corresponding path program 1 times
[2024-06-04 17:14:51,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:14:51,143 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198890749]
[2024-06-04 17:14:51,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:14:51,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:14:51,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:15:00,778 INFO  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 17:15:00,778 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:15:00,778 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198890749]
[2024-06-04 17:15:00,778 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198890749] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:15:00,778 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:15:00,779 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:15:00,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570917511]
[2024-06-04 17:15:00,779 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:15:00,779 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:15:00,779 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:15:00,779 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:15:00,779 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:15:01,087 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:15:01,087 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 284 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:15:01,087 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:15:01,087 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:15:01,087 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:15:02,047 INFO  L124   PetriNetUnfolderBase]: 1379/2258 cut-off events.
[2024-06-04 17:15:02,060 INFO  L125   PetriNetUnfolderBase]: For 7831/7831 co-relation queries the response was YES.
[2024-06-04 17:15:02,063 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7859 conditions, 2258 events. 1379/2258 cut-off events. For 7831/7831 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11657 event pairs, 540 based on Foata normal form. 2/2249 useless extension candidates. Maximal degree in co-relation 7836. Up to 2030 conditions per place. 
[2024-06-04 17:15:02,070 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 55 selfloop transitions, 11 changer transitions 0/72 dead transitions.
[2024-06-04 17:15:02,070 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 480 flow
[2024-06-04 17:15:02,073 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:15:02,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:15:02,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions.
[2024-06-04 17:15:02,075 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-04 17:15:02,075 INFO  L175             Difference]: Start difference. First operand has 58 places, 53 transitions, 284 flow. Second operand 6 states and 120 transitions.
[2024-06-04 17:15:02,078 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 480 flow
[2024-06-04 17:15:02,080 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 434 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-04 17:15:02,082 INFO  L231             Difference]: Finished difference. Result has 60 places, 56 transitions, 298 flow
[2024-06-04 17:15:02,082 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=60, PETRI_TRANSITIONS=56}
[2024-06-04 17:15:02,084 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places.
[2024-06-04 17:15:02,084 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 298 flow
[2024-06-04 17:15:02,084 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:15:02,084 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:15:02,085 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:15:02,085 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 17:15:02,085 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 17:15:02,086 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:15:02,086 INFO  L85        PathProgramCache]: Analyzing trace with hash -1603250192, now seen corresponding path program 1 times
[2024-06-04 17:15:02,086 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:15:02,086 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248768865]
[2024-06-04 17:15:02,086 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:15:02,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:15:02,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:15:11,506 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:15:11,507 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:15:11,507 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248768865]
[2024-06-04 17:15:11,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248768865] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:15:11,507 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:15:11,507 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:15:11,507 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513105037]
[2024-06-04 17:15:11,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:15:11,508 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:15:11,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:15:11,509 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:15:11,510 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:15:11,718 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:15:11,719 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 298 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:15:11,719 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:15:11,719 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:15:11,719 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:15:12,733 INFO  L124   PetriNetUnfolderBase]: 1278/2030 cut-off events.
[2024-06-04 17:15:12,733 INFO  L125   PetriNetUnfolderBase]: For 9198/9198 co-relation queries the response was YES.
[2024-06-04 17:15:12,735 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7703 conditions, 2030 events. 1278/2030 cut-off events. For 9198/9198 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10069 event pairs, 479 based on Foata normal form. 2/2022 useless extension candidates. Maximal degree in co-relation 7679. Up to 1869 conditions per place. 
[2024-06-04 17:15:12,741 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 64 selfloop transitions, 14 changer transitions 0/84 dead transitions.
[2024-06-04 17:15:12,742 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 552 flow
[2024-06-04 17:15:12,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:15:12,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:15:12,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-04 17:15:12,743 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4750830564784053
[2024-06-04 17:15:12,743 INFO  L175             Difference]: Start difference. First operand has 60 places, 56 transitions, 298 flow. Second operand 7 states and 143 transitions.
[2024-06-04 17:15:12,743 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 552 flow
[2024-06-04 17:15:12,746 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 516 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-04 17:15:12,747 INFO  L231             Difference]: Finished difference. Result has 63 places, 59 transitions, 338 flow
[2024-06-04 17:15:12,747 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=63, PETRI_TRANSITIONS=59}
[2024-06-04 17:15:12,747 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places.
[2024-06-04 17:15:12,748 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 338 flow
[2024-06-04 17:15:12,748 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:15:12,748 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:15:12,748 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:15:12,748 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 17:15:12,748 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 17:15:12,749 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:15:12,749 INFO  L85        PathProgramCache]: Analyzing trace with hash 2009151036, now seen corresponding path program 1 times
[2024-06-04 17:15:12,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:15:12,749 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490626692]
[2024-06-04 17:15:12,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:15:12,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:15:12,786 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:15:22,965 INFO  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 17:15:22,965 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:15:22,965 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490626692]
[2024-06-04 17:15:22,965 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490626692] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:15:22,965 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:15:22,965 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:15:22,965 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69170725]
[2024-06-04 17:15:22,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:15:22,966 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:15:22,966 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:15:22,966 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:15:22,966 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:15:23,188 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:15:23,189 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 338 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:15:23,189 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:15:23,189 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:15:23,189 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:15:24,225 INFO  L124   PetriNetUnfolderBase]: 1361/2224 cut-off events.
[2024-06-04 17:15:24,226 INFO  L125   PetriNetUnfolderBase]: For 11639/11639 co-relation queries the response was YES.
[2024-06-04 17:15:24,229 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8475 conditions, 2224 events. 1361/2224 cut-off events. For 11639/11639 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 11420 event pairs, 500 based on Foata normal form. 4/2213 useless extension candidates. Maximal degree in co-relation 8450. Up to 1986 conditions per place. 
[2024-06-04 17:15:24,235 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 63 selfloop transitions, 13 changer transitions 0/82 dead transitions.
[2024-06-04 17:15:24,235 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 570 flow
[2024-06-04 17:15:24,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:15:24,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:15:24,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-04 17:15:24,236 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4584717607973422
[2024-06-04 17:15:24,236 INFO  L175             Difference]: Start difference. First operand has 63 places, 59 transitions, 338 flow. Second operand 7 states and 138 transitions.
[2024-06-04 17:15:24,236 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 570 flow
[2024-06-04 17:15:24,240 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 82 transitions, 518 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-04 17:15:24,241 INFO  L231             Difference]: Finished difference. Result has 65 places, 61 transitions, 351 flow
[2024-06-04 17:15:24,242 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=65, PETRI_TRANSITIONS=61}
[2024-06-04 17:15:24,242 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places.
[2024-06-04 17:15:24,242 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 351 flow
[2024-06-04 17:15:24,242 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:15:24,242 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:15:24,243 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:15:24,243 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 17:15:24,243 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:15:24,243 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:15:24,243 INFO  L85        PathProgramCache]: Analyzing trace with hash -2039861154, now seen corresponding path program 1 times
[2024-06-04 17:15:24,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:15:24,243 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081029655]
[2024-06-04 17:15:24,244 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:15:24,244 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:15:24,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:15:37,322 INFO  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 17:15:37,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:15:37,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081029655]
[2024-06-04 17:15:37,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081029655] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:15:37,322 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:15:37,322 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:15:37,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341438379]
[2024-06-04 17:15:37,322 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:15:37,323 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:15:37,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:15:37,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:15:37,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:15:37,430 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:15:37,430 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 351 flow. Second operand  has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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 17:15:37,430 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:15:37,430 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:15:37,431 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:15:38,350 INFO  L124   PetriNetUnfolderBase]: 1358/2220 cut-off events.
[2024-06-04 17:15:38,350 INFO  L125   PetriNetUnfolderBase]: For 13598/13598 co-relation queries the response was YES.
[2024-06-04 17:15:38,353 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8708 conditions, 2220 events. 1358/2220 cut-off events. For 13598/13598 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 11408 event pairs, 539 based on Foata normal form. 1/2206 useless extension candidates. Maximal degree in co-relation 8682. Up to 2024 conditions per place. 
[2024-06-04 17:15:38,359 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 58 selfloop transitions, 8 changer transitions 0/72 dead transitions.
[2024-06-04 17:15:38,359 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 525 flow
[2024-06-04 17:15:38,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:15:38,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:15:38,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions.
[2024-06-04 17:15:38,361 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4511627906976744
[2024-06-04 17:15:38,361 INFO  L175             Difference]: Start difference. First operand has 65 places, 61 transitions, 351 flow. Second operand 5 states and 97 transitions.
[2024-06-04 17:15:38,361 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 525 flow
[2024-06-04 17:15:38,366 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 478 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-04 17:15:38,367 INFO  L231             Difference]: Finished difference. Result has 65 places, 64 transitions, 354 flow
[2024-06-04 17:15:38,367 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=354, PETRI_PLACES=65, PETRI_TRANSITIONS=64}
[2024-06-04 17:15:38,368 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places.
[2024-06-04 17:15:38,368 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 354 flow
[2024-06-04 17:15:38,368 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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 17:15:38,368 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:15:38,368 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:15:38,368 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 17:15:38,368 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 17:15:38,369 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:15:38,369 INFO  L85        PathProgramCache]: Analyzing trace with hash -1455581673, now seen corresponding path program 1 times
[2024-06-04 17:15:38,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:15:38,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127989117]
[2024-06-04 17:15:38,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:15:38,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:15:38,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:15:48,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 17:15:48,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:15:48,884 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127989117]
[2024-06-04 17:15:48,884 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127989117] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:15:48,884 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:15:48,884 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:15:48,884 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079192044]
[2024-06-04 17:15:48,884 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:15:48,884 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:15:48,885 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:15:48,885 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:15:48,885 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:15:49,098 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:15:49,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 354 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:15:49,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:15:49,099 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:15:49,099 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:15:50,311 INFO  L124   PetriNetUnfolderBase]: 1576/2443 cut-off events.
[2024-06-04 17:15:50,311 INFO  L125   PetriNetUnfolderBase]: For 18351/18351 co-relation queries the response was YES.
[2024-06-04 17:15:50,315 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10254 conditions, 2443 events. 1576/2443 cut-off events. For 18351/18351 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11970 event pairs, 635 based on Foata normal form. 2/2444 useless extension candidates. Maximal degree in co-relation 10227. Up to 2298 conditions per place. 
[2024-06-04 17:15:50,323 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 74 selfloop transitions, 14 changer transitions 0/93 dead transitions.
[2024-06-04 17:15:50,323 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 93 transitions, 632 flow
[2024-06-04 17:15:50,324 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:15:50,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:15:50,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-04 17:15:50,324 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4485049833887043
[2024-06-04 17:15:50,324 INFO  L175             Difference]: Start difference. First operand has 65 places, 64 transitions, 354 flow. Second operand 7 states and 135 transitions.
[2024-06-04 17:15:50,325 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 93 transitions, 632 flow
[2024-06-04 17:15:50,330 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 93 transitions, 604 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-04 17:15:50,331 INFO  L231             Difference]: Finished difference. Result has 70 places, 70 transitions, 420 flow
[2024-06-04 17:15:50,331 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=420, PETRI_PLACES=70, PETRI_TRANSITIONS=70}
[2024-06-04 17:15:50,332 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places.
[2024-06-04 17:15:50,332 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 420 flow
[2024-06-04 17:15:50,332 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:15:50,332 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:15:50,332 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:15:50,332 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 17:15:50,332 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 17:15:50,333 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:15:50,333 INFO  L85        PathProgramCache]: Analyzing trace with hash -1248928233, now seen corresponding path program 2 times
[2024-06-04 17:15:50,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:15:50,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490968154]
[2024-06-04 17:15:50,333 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:15:50,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:15:50,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:00,701 INFO  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 17:16:00,702 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:00,702 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490968154]
[2024-06-04 17:16:00,702 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490968154] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:00,702 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:00,702 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:16:00,702 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624666378]
[2024-06-04 17:16:00,702 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:00,702 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:16:00,703 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:00,703 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:16:00,703 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:16:00,891 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:16:00,892 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 420 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:16:00,892 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:00,892 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:16:00,892 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:01,955 INFO  L124   PetriNetUnfolderBase]: 1587/2474 cut-off events.
[2024-06-04 17:16:01,955 INFO  L125   PetriNetUnfolderBase]: For 21395/21403 co-relation queries the response was YES.
[2024-06-04 17:16:01,959 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10929 conditions, 2474 events. 1587/2474 cut-off events. For 21395/21403 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12118 event pairs, 570 based on Foata normal form. 10/2483 useless extension candidates. Maximal degree in co-relation 10900. Up to 2273 conditions per place. 
[2024-06-04 17:16:01,966 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 73 selfloop transitions, 19 changer transitions 0/97 dead transitions.
[2024-06-04 17:16:01,967 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 97 transitions, 708 flow
[2024-06-04 17:16:01,967 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:16:01,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:16:01,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-04 17:16:01,968 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4485049833887043
[2024-06-04 17:16:01,968 INFO  L175             Difference]: Start difference. First operand has 70 places, 70 transitions, 420 flow. Second operand 7 states and 135 transitions.
[2024-06-04 17:16:01,968 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 97 transitions, 708 flow
[2024-06-04 17:16:01,974 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 670 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-04 17:16:01,976 INFO  L231             Difference]: Finished difference. Result has 75 places, 76 transitions, 494 flow
[2024-06-04 17:16:01,976 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=75, PETRI_TRANSITIONS=76}
[2024-06-04 17:16:01,976 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places.
[2024-06-04 17:16:01,976 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 494 flow
[2024-06-04 17:16:01,977 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:16:01,977 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:01,977 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:16:01,977 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 17:16:01,977 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:16:01,977 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:01,978 INFO  L85        PathProgramCache]: Analyzing trace with hash -2140836029, now seen corresponding path program 3 times
[2024-06-04 17:16:01,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:01,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985927946]
[2024-06-04 17:16:01,978 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:01,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:02,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:12,197 INFO  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 17:16:12,197 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:12,197 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985927946]
[2024-06-04 17:16:12,197 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985927946] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:12,197 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:12,197 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:16:12,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441601785]
[2024-06-04 17:16:12,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:12,198 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:16:12,198 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:12,198 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:16:12,198 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:16:12,465 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:16:12,465 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 494 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:16:12,465 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:12,465 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:16:12,465 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:13,517 INFO  L124   PetriNetUnfolderBase]: 1582/2467 cut-off events.
[2024-06-04 17:16:13,517 INFO  L125   PetriNetUnfolderBase]: For 24707/24715 co-relation queries the response was YES.
[2024-06-04 17:16:13,521 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11454 conditions, 2467 events. 1582/2467 cut-off events. For 24707/24715 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12062 event pairs, 575 based on Foata normal form. 10/2476 useless extension candidates. Maximal degree in co-relation 11422. Up to 2239 conditions per place. 
[2024-06-04 17:16:13,529 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 67 selfloop transitions, 27 changer transitions 0/99 dead transitions.
[2024-06-04 17:16:13,529 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 99 transitions, 774 flow
[2024-06-04 17:16:13,529 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:16:13,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:16:13,530 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-04 17:16:13,530 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4485049833887043
[2024-06-04 17:16:13,530 INFO  L175             Difference]: Start difference. First operand has 75 places, 76 transitions, 494 flow. Second operand 7 states and 135 transitions.
[2024-06-04 17:16:13,530 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 99 transitions, 774 flow
[2024-06-04 17:16:13,537 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 99 transitions, 720 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-04 17:16:13,539 INFO  L231             Difference]: Finished difference. Result has 79 places, 79 transitions, 550 flow
[2024-06-04 17:16:13,539 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=550, PETRI_PLACES=79, PETRI_TRANSITIONS=79}
[2024-06-04 17:16:13,540 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places.
[2024-06-04 17:16:13,540 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 550 flow
[2024-06-04 17:16:13,540 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:16:13,540 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:13,540 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:16:13,540 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 17:16:13,540 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:16:13,541 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:13,541 INFO  L85        PathProgramCache]: Analyzing trace with hash 1188815514, now seen corresponding path program 1 times
[2024-06-04 17:16:13,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:13,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621130121]
[2024-06-04 17:16:13,541 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:13,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:13,575 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:28,263 INFO  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 17:16:28,264 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:28,264 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621130121]
[2024-06-04 17:16:28,264 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621130121] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:28,264 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:28,264 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:16:28,264 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397616615]
[2024-06-04 17:16:28,264 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:28,265 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:16:28,265 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:28,265 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:16:28,265 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:16:28,410 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:16:28,411 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 550 flow. Second operand  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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 17:16:28,411 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:28,411 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:16:28,411 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:29,467 INFO  L124   PetriNetUnfolderBase]: 1579/2475 cut-off events.
[2024-06-04 17:16:29,467 INFO  L125   PetriNetUnfolderBase]: For 27736/27736 co-relation queries the response was YES.
[2024-06-04 17:16:29,471 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11972 conditions, 2475 events. 1579/2475 cut-off events. For 27736/27736 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12210 event pairs, 613 based on Foata normal form. 1/2475 useless extension candidates. Maximal degree in co-relation 11938. Up to 2339 conditions per place. 
[2024-06-04 17:16:29,478 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 75 selfloop transitions, 11 changer transitions 0/91 dead transitions.
[2024-06-04 17:16:29,478 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 91 transitions, 770 flow
[2024-06-04 17:16:29,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:16:29,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:16:29,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-04 17:16:29,479 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41472868217054265
[2024-06-04 17:16:29,479 INFO  L175             Difference]: Start difference. First operand has 79 places, 79 transitions, 550 flow. Second operand 6 states and 107 transitions.
[2024-06-04 17:16:29,479 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 91 transitions, 770 flow
[2024-06-04 17:16:29,486 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 91 transitions, 682 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-04 17:16:29,487 INFO  L231             Difference]: Finished difference. Result has 80 places, 82 transitions, 522 flow
[2024-06-04 17:16:29,487 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=80, PETRI_TRANSITIONS=82}
[2024-06-04 17:16:29,487 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places.
[2024-06-04 17:16:29,487 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 522 flow
[2024-06-04 17:16:29,488 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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 17:16:29,488 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:29,488 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:16:29,488 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 17:16:29,488 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 17:16:29,488 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:29,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 739800139, now seen corresponding path program 1 times
[2024-06-04 17:16:29,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:29,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195056816]
[2024-06-04 17:16:29,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:29,488 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:29,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:38,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 17:16:38,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:38,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195056816]
[2024-06-04 17:16:38,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195056816] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:38,940 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:38,940 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:16:38,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394670266]
[2024-06-04 17:16:38,940 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:38,941 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:16:38,941 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:38,941 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:16:38,941 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:16:39,167 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:16:39,167 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 522 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:16:39,167 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:39,167 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:16:39,167 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:40,274 INFO  L124   PetriNetUnfolderBase]: 1353/2126 cut-off events.
[2024-06-04 17:16:40,274 INFO  L125   PetriNetUnfolderBase]: For 31226/31226 co-relation queries the response was YES.
[2024-06-04 17:16:40,278 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11290 conditions, 2126 events. 1353/2126 cut-off events. For 31226/31226 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10618 event pairs, 337 based on Foata normal form. 4/2129 useless extension candidates. Maximal degree in co-relation 11255. Up to 1913 conditions per place. 
[2024-06-04 17:16:40,284 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 93 selfloop transitions, 15 changer transitions 0/115 dead transitions.
[2024-06-04 17:16:40,284 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 115 transitions, 854 flow
[2024-06-04 17:16:40,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:16:40,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:16:40,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-04 17:16:40,286 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4680232558139535
[2024-06-04 17:16:40,286 INFO  L175             Difference]: Start difference. First operand has 80 places, 82 transitions, 522 flow. Second operand 8 states and 161 transitions.
[2024-06-04 17:16:40,286 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 115 transitions, 854 flow
[2024-06-04 17:16:40,292 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 115 transitions, 816 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-04 17:16:40,293 INFO  L231             Difference]: Finished difference. Result has 84 places, 84 transitions, 563 flow
[2024-06-04 17:16:40,293 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=563, PETRI_PLACES=84, PETRI_TRANSITIONS=84}
[2024-06-04 17:16:40,294 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places.
[2024-06-04 17:16:40,294 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 84 transitions, 563 flow
[2024-06-04 17:16:40,294 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:16:40,294 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:40,294 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:16:40,294 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 17:16:40,295 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 17:16:40,295 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:40,295 INFO  L85        PathProgramCache]: Analyzing trace with hash 1169855727, now seen corresponding path program 2 times
[2024-06-04 17:16:40,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:40,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178927799]
[2024-06-04 17:16:40,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:40,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:40,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:51,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:16:51,151 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:51,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178927799]
[2024-06-04 17:16:51,151 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178927799] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:51,151 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:51,151 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:16:51,151 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610930491]
[2024-06-04 17:16:51,151 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:51,151 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:16:51,152 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:51,152 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:16:51,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:16:51,296 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:16:51,296 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 84 transitions, 563 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:16:51,296 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:51,296 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:16:51,296 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:52,465 INFO  L124   PetriNetUnfolderBase]: 1370/2153 cut-off events.
[2024-06-04 17:16:52,465 INFO  L125   PetriNetUnfolderBase]: For 35475/35475 co-relation queries the response was YES.
[2024-06-04 17:16:52,469 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11839 conditions, 2153 events. 1370/2153 cut-off events. For 35475/35475 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10719 event pairs, 453 based on Foata normal form. 4/2156 useless extension candidates. Maximal degree in co-relation 11803. Up to 1966 conditions per place. 
[2024-06-04 17:16:52,475 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/116 dead transitions.
[2024-06-04 17:16:52,475 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 116 transitions, 899 flow
[2024-06-04 17:16:52,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:16:52,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:16:52,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-04 17:16:52,478 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4680232558139535
[2024-06-04 17:16:52,478 INFO  L175             Difference]: Start difference. First operand has 84 places, 84 transitions, 563 flow. Second operand 8 states and 161 transitions.
[2024-06-04 17:16:52,478 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 116 transitions, 899 flow
[2024-06-04 17:16:52,487 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 116 transitions, 838 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-04 17:16:52,488 INFO  L231             Difference]: Finished difference. Result has 86 places, 86 transitions, 587 flow
[2024-06-04 17:16:52,488 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=587, PETRI_PLACES=86, PETRI_TRANSITIONS=86}
[2024-06-04 17:16:52,488 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places.
[2024-06-04 17:16:52,488 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 587 flow
[2024-06-04 17:16:52,489 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:16:52,489 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:52,489 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:16:52,489 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 17:16:52,489 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 17:16:52,489 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:52,489 INFO  L85        PathProgramCache]: Analyzing trace with hash 1169860687, now seen corresponding path program 1 times
[2024-06-04 17:16:52,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:52,490 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733192539]
[2024-06-04 17:16:52,490 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:52,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:52,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:02,583 INFO  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 17:17:02,583 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:02,583 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733192539]
[2024-06-04 17:17:02,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733192539] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:02,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:02,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:17:02,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600795337]
[2024-06-04 17:17:02,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:02,584 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:17:02,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:02,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:17:02,586 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:17:02,776 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:17:02,777 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 587 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:17:02,777 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:02,777 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:17:02,777 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:04,107 INFO  L124   PetriNetUnfolderBase]: 1721/2657 cut-off events.
[2024-06-04 17:17:04,108 INFO  L125   PetriNetUnfolderBase]: For 46611/46623 co-relation queries the response was YES.
[2024-06-04 17:17:04,113 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14423 conditions, 2657 events. 1721/2657 cut-off events. For 46611/46623 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13135 event pairs, 619 based on Foata normal form. 2/2653 useless extension candidates. Maximal degree in co-relation 14386. Up to 2476 conditions per place. 
[2024-06-04 17:17:04,122 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 96 selfloop transitions, 17 changer transitions 0/119 dead transitions.
[2024-06-04 17:17:04,122 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 119 transitions, 941 flow
[2024-06-04 17:17:04,124 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:17:04,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:17:04,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-04 17:17:04,124 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45058139534883723
[2024-06-04 17:17:04,124 INFO  L175             Difference]: Start difference. First operand has 86 places, 86 transitions, 587 flow. Second operand 8 states and 155 transitions.
[2024-06-04 17:17:04,124 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 119 transitions, 941 flow
[2024-06-04 17:17:04,137 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 874 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-04 17:17:04,139 INFO  L231             Difference]: Finished difference. Result has 88 places, 89 transitions, 620 flow
[2024-06-04 17:17:04,139 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=620, PETRI_PLACES=88, PETRI_TRANSITIONS=89}
[2024-06-04 17:17:04,139 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places.
[2024-06-04 17:17:04,139 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 89 transitions, 620 flow
[2024-06-04 17:17:04,140 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:17:04,140 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:04,140 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:04,140 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 17:17:04,140 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 17:17:04,140 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:04,141 INFO  L85        PathProgramCache]: Analyzing trace with hash 233812769, now seen corresponding path program 3 times
[2024-06-04 17:17:04,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:04,141 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987309937]
[2024-06-04 17:17:04,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:04,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:04,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:14,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:17:14,453 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:14,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987309937]
[2024-06-04 17:17:14,453 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987309937] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:14,453 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:14,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:17:14,453 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546202953]
[2024-06-04 17:17:14,453 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:14,454 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:17:14,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:14,454 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:17:14,454 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:17:14,658 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:17:14,658 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 620 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:17:14,658 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:14,658 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:17:14,658 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:15,806 INFO  L124   PetriNetUnfolderBase]: 1398/2184 cut-off events.
[2024-06-04 17:17:15,806 INFO  L125   PetriNetUnfolderBase]: For 43764/43764 co-relation queries the response was YES.
[2024-06-04 17:17:15,810 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12744 conditions, 2184 events. 1398/2184 cut-off events. For 43764/43764 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10821 event pairs, 432 based on Foata normal form. 4/2181 useless extension candidates. Maximal degree in co-relation 12706. Up to 2015 conditions per place. 
[2024-06-04 17:17:15,818 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 95 selfloop transitions, 16 changer transitions 0/118 dead transitions.
[2024-06-04 17:17:15,818 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 118 transitions, 958 flow
[2024-06-04 17:17:15,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:17:15,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:17:15,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-04 17:17:15,821 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45930232558139533
[2024-06-04 17:17:15,821 INFO  L175             Difference]: Start difference. First operand has 88 places, 89 transitions, 620 flow. Second operand 8 states and 158 transitions.
[2024-06-04 17:17:15,821 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 118 transitions, 958 flow
[2024-06-04 17:17:15,836 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 118 transitions, 882 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-04 17:17:15,837 INFO  L231             Difference]: Finished difference. Result has 90 places, 91 transitions, 635 flow
[2024-06-04 17:17:15,838 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=635, PETRI_PLACES=90, PETRI_TRANSITIONS=91}
[2024-06-04 17:17:15,838 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places.
[2024-06-04 17:17:15,838 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 91 transitions, 635 flow
[2024-06-04 17:17:15,838 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:17:15,838 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:15,838 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:15,839 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 17:17:15,839 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 17:17:15,839 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:15,839 INFO  L85        PathProgramCache]: Analyzing trace with hash 233817729, now seen corresponding path program 2 times
[2024-06-04 17:17:15,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:15,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592968928]
[2024-06-04 17:17:15,840 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:15,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:15,904 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:25,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 17:17:25,476 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:25,476 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592968928]
[2024-06-04 17:17:25,476 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592968928] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:25,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:25,477 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:17:25,477 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178857845]
[2024-06-04 17:17:25,477 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:25,477 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:17:25,477 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:25,477 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:17:25,478 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:17:25,771 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:17:25,772 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 635 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:17:25,772 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:25,772 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:17:25,772 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:27,242 INFO  L124   PetriNetUnfolderBase]: 1798/2770 cut-off events.
[2024-06-04 17:17:27,242 INFO  L125   PetriNetUnfolderBase]: For 58191/58191 co-relation queries the response was YES.
[2024-06-04 17:17:27,247 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15801 conditions, 2770 events. 1798/2770 cut-off events. For 58191/58191 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13708 event pairs, 628 based on Foata normal form. 2/2768 useless extension candidates. Maximal degree in co-relation 15762. Up to 2580 conditions per place. 
[2024-06-04 17:17:27,257 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 102 selfloop transitions, 21 changer transitions 0/129 dead transitions.
[2024-06-04 17:17:27,257 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 129 transitions, 1044 flow
[2024-06-04 17:17:27,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:17:27,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:17:27,259 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-04 17:17:27,259 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4392764857881137
[2024-06-04 17:17:27,260 INFO  L175             Difference]: Start difference. First operand has 90 places, 91 transitions, 635 flow. Second operand 9 states and 170 transitions.
[2024-06-04 17:17:27,260 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 129 transitions, 1044 flow
[2024-06-04 17:17:27,277 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 129 transitions, 952 flow, removed 26 selfloop flow, removed 7 redundant places.
[2024-06-04 17:17:27,279 INFO  L231             Difference]: Finished difference. Result has 93 places, 98 transitions, 691 flow
[2024-06-04 17:17:27,279 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=691, PETRI_PLACES=93, PETRI_TRANSITIONS=98}
[2024-06-04 17:17:27,279 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places.
[2024-06-04 17:17:27,279 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 98 transitions, 691 flow
[2024-06-04 17:17:27,280 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:17:27,280 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:27,280 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:27,280 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 17:17:27,280 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:17:27,280 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:27,280 INFO  L85        PathProgramCache]: Analyzing trace with hash 1285324837, now seen corresponding path program 3 times
[2024-06-04 17:17:27,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:27,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195762182]
[2024-06-04 17:17:27,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:27,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:27,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:37,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:17:37,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:37,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195762182]
[2024-06-04 17:17:37,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195762182] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:37,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:37,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:17:37,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072131213]
[2024-06-04 17:17:37,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:37,643 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:17:37,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:37,644 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:17:37,644 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:17:37,799 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:17:37,799 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 98 transitions, 691 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:17:37,799 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:37,799 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:17:37,799 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:39,142 INFO  L124   PetriNetUnfolderBase]: 1809/2791 cut-off events.
[2024-06-04 17:17:39,143 INFO  L125   PetriNetUnfolderBase]: For 63393/63393 co-relation queries the response was YES.
[2024-06-04 17:17:39,148 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16457 conditions, 2791 events. 1809/2791 cut-off events. For 63393/63393 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13878 event pairs, 628 based on Foata normal form. 2/2789 useless extension candidates. Maximal degree in co-relation 16417. Up to 2587 conditions per place. 
[2024-06-04 17:17:39,157 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 99 selfloop transitions, 23 changer transitions 0/128 dead transitions.
[2024-06-04 17:17:39,158 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 128 transitions, 1071 flow
[2024-06-04 17:17:39,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:17:39,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:17:39,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 17:17:39,160 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44476744186046513
[2024-06-04 17:17:39,160 INFO  L175             Difference]: Start difference. First operand has 93 places, 98 transitions, 691 flow. Second operand 8 states and 153 transitions.
[2024-06-04 17:17:39,160 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 128 transitions, 1071 flow
[2024-06-04 17:17:39,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 128 transitions, 981 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-04 17:17:39,177 INFO  L231             Difference]: Finished difference. Result has 95 places, 101 transitions, 731 flow
[2024-06-04 17:17:39,178 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=731, PETRI_PLACES=95, PETRI_TRANSITIONS=101}
[2024-06-04 17:17:39,178 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places.
[2024-06-04 17:17:39,178 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 101 transitions, 731 flow
[2024-06-04 17:17:39,178 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:17:39,178 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:39,178 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:39,178 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 17:17:39,178 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 17:17:39,179 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:39,179 INFO  L85        PathProgramCache]: Analyzing trace with hash 233997467, now seen corresponding path program 1 times
[2024-06-04 17:17:39,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:39,179 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596445587]
[2024-06-04 17:17:39,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:39,179 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:39,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:49,296 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:17:49,297 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:49,297 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596445587]
[2024-06-04 17:17:49,297 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596445587] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:49,297 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:49,297 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:17:49,297 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484729005]
[2024-06-04 17:17:49,297 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:49,297 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:17:49,298 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:49,298 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:17:49,298 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:17:49,599 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:17:49,599 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 101 transitions, 731 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:17:49,600 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:49,600 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:17:49,600 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:50,931 INFO  L124   PetriNetUnfolderBase]: 1826/2818 cut-off events.
[2024-06-04 17:17:50,932 INFO  L125   PetriNetUnfolderBase]: For 70772/70772 co-relation queries the response was YES.
[2024-06-04 17:17:50,937 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17118 conditions, 2818 events. 1826/2818 cut-off events. For 70772/70772 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13979 event pairs, 628 based on Foata normal form. 4/2818 useless extension candidates. Maximal degree in co-relation 17077. Up to 2632 conditions per place. 
[2024-06-04 17:17:50,945 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 109 selfloop transitions, 16 changer transitions 0/131 dead transitions.
[2024-06-04 17:17:50,945 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 131 transitions, 1103 flow
[2024-06-04 17:17:50,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:17:50,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:17:50,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-04 17:17:50,948 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-04 17:17:50,948 INFO  L175             Difference]: Start difference. First operand has 95 places, 101 transitions, 731 flow. Second operand 8 states and 152 transitions.
[2024-06-04 17:17:50,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 131 transitions, 1103 flow
[2024-06-04 17:17:50,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 131 transitions, 999 flow, removed 33 selfloop flow, removed 6 redundant places.
[2024-06-04 17:17:50,970 INFO  L231             Difference]: Finished difference. Result has 97 places, 103 transitions, 720 flow
[2024-06-04 17:17:50,970 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=720, PETRI_PLACES=97, PETRI_TRANSITIONS=103}
[2024-06-04 17:17:50,970 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places.
[2024-06-04 17:17:50,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 103 transitions, 720 flow
[2024-06-04 17:17:50,971 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:17:50,971 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:50,971 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:50,971 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 17:17:50,971 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 17:17:50,971 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:50,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 1285331347, now seen corresponding path program 4 times
[2024-06-04 17:17:50,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:50,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611972439]
[2024-06-04 17:17:50,972 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:50,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:51,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:01,483 INFO  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 17:18:01,484 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:01,484 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611972439]
[2024-06-04 17:18:01,484 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611972439] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:01,484 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:01,484 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:18:01,484 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425591238]
[2024-06-04 17:18:01,484 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:01,484 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:18:01,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:01,485 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:18:01,485 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:18:01,760 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:18:01,760 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 103 transitions, 720 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:18:01,760 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:01,760 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:18:01,760 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:03,076 INFO  L124   PetriNetUnfolderBase]: 1837/2834 cut-off events.
[2024-06-04 17:18:03,076 INFO  L125   PetriNetUnfolderBase]: For 69660/69660 co-relation queries the response was YES.
[2024-06-04 17:18:03,081 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17046 conditions, 2834 events. 1837/2834 cut-off events. For 69660/69660 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14091 event pairs, 628 based on Foata normal form. 2/2832 useless extension candidates. Maximal degree in co-relation 17004. Up to 2612 conditions per place. 
[2024-06-04 17:18:03,090 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 99 selfloop transitions, 28 changer transitions 0/133 dead transitions.
[2024-06-04 17:18:03,090 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 133 transitions, 1112 flow
[2024-06-04 17:18:03,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:18:03,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:18:03,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-04 17:18:03,092 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4476744186046512
[2024-06-04 17:18:03,093 INFO  L175             Difference]: Start difference. First operand has 97 places, 103 transitions, 720 flow. Second operand 8 states and 154 transitions.
[2024-06-04 17:18:03,093 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 133 transitions, 1112 flow
[2024-06-04 17:18:03,110 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 133 transitions, 1039 flow, removed 22 selfloop flow, removed 6 redundant places.
[2024-06-04 17:18:03,112 INFO  L231             Difference]: Finished difference. Result has 99 places, 106 transitions, 785 flow
[2024-06-04 17:18:03,112 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=785, PETRI_PLACES=99, PETRI_TRANSITIONS=106}
[2024-06-04 17:18:03,112 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places.
[2024-06-04 17:18:03,112 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 106 transitions, 785 flow
[2024-06-04 17:18:03,113 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:18:03,113 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:03,113 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:03,113 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 17:18:03,113 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:18:03,113 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:03,113 INFO  L85        PathProgramCache]: Analyzing trace with hash -1812864579, now seen corresponding path program 1 times
[2024-06-04 17:18:03,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:03,114 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140131756]
[2024-06-04 17:18:03,114 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:03,114 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:03,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:17,426 INFO  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 17:18:17,426 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:17,427 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140131756]
[2024-06-04 17:18:17,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140131756] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:17,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:17,427 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:18:17,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996075616]
[2024-06-04 17:18:17,427 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:17,427 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:18:17,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:17,427 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:18:17,428 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:18:17,582 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:18:17,583 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 106 transitions, 785 flow. Second operand  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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 17:18:17,583 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:17,583 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:18:17,583 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:18,806 INFO  L124   PetriNetUnfolderBase]: 1854/2857 cut-off events.
[2024-06-04 17:18:18,806 INFO  L125   PetriNetUnfolderBase]: For 75409/75409 co-relation queries the response was YES.
[2024-06-04 17:18:18,812 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17607 conditions, 2857 events. 1854/2857 cut-off events. For 75409/75409 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14143 event pairs, 611 based on Foata normal form. 2/2858 useless extension candidates. Maximal degree in co-relation 17564. Up to 2670 conditions per place. 
[2024-06-04 17:18:18,822 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 106 selfloop transitions, 18 changer transitions 0/130 dead transitions.
[2024-06-04 17:18:18,822 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 130 transitions, 1209 flow
[2024-06-04 17:18:18,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:18:18,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:18:18,822 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions.
[2024-06-04 17:18:18,823 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573643410852713
[2024-06-04 17:18:18,823 INFO  L175             Difference]: Start difference. First operand has 99 places, 106 transitions, 785 flow. Second operand 6 states and 118 transitions.
[2024-06-04 17:18:18,823 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 130 transitions, 1209 flow
[2024-06-04 17:18:18,844 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 130 transitions, 1095 flow, removed 31 selfloop flow, removed 6 redundant places.
[2024-06-04 17:18:18,846 INFO  L231             Difference]: Finished difference. Result has 99 places, 112 transitions, 788 flow
[2024-06-04 17:18:18,846 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=788, PETRI_PLACES=99, PETRI_TRANSITIONS=112}
[2024-06-04 17:18:18,846 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places.
[2024-06-04 17:18:18,846 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 112 transitions, 788 flow
[2024-06-04 17:18:18,846 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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 17:18:18,846 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:18,847 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:18,847 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 17:18:18,847 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 17:18:18,847 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:18,847 INFO  L85        PathProgramCache]: Analyzing trace with hash 2117200963, now seen corresponding path program 4 times
[2024-06-04 17:18:18,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:18,847 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049528945]
[2024-06-04 17:18:18,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:18,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:18,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:29,265 INFO  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 17:18:29,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:29,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049528945]
[2024-06-04 17:18:29,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049528945] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:29,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:29,266 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:18:29,266 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427072999]
[2024-06-04 17:18:29,266 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:29,266 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:18:29,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:29,266 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:18:29,266 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:18:29,450 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:18:29,451 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 112 transitions, 788 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:18:29,451 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:29,451 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:18:29,451 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:30,551 INFO  L124   PetriNetUnfolderBase]: 1630/2538 cut-off events.
[2024-06-04 17:18:30,551 INFO  L125   PetriNetUnfolderBase]: For 75465/75473 co-relation queries the response was YES.
[2024-06-04 17:18:30,557 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16586 conditions, 2538 events. 1630/2538 cut-off events. For 75465/75473 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12825 event pairs, 482 based on Foata normal form. 12/2543 useless extension candidates. Maximal degree in co-relation 16542. Up to 2300 conditions per place. 
[2024-06-04 17:18:30,565 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 104 selfloop transitions, 26 changer transitions 0/138 dead transitions.
[2024-06-04 17:18:30,565 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 138 transitions, 1166 flow
[2024-06-04 17:18:30,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:18:30,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:18:30,568 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-04 17:18:30,568 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45930232558139533
[2024-06-04 17:18:30,568 INFO  L175             Difference]: Start difference. First operand has 99 places, 112 transitions, 788 flow. Second operand 8 states and 158 transitions.
[2024-06-04 17:18:30,568 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 138 transitions, 1166 flow
[2024-06-04 17:18:30,592 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 138 transitions, 1132 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-06-04 17:18:30,594 INFO  L231             Difference]: Finished difference. Result has 105 places, 114 transitions, 875 flow
[2024-06-04 17:18:30,594 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=875, PETRI_PLACES=105, PETRI_TRANSITIONS=114}
[2024-06-04 17:18:30,594 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places.
[2024-06-04 17:18:30,594 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 114 transitions, 875 flow
[2024-06-04 17:18:30,595 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:18:30,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:30,595 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:30,595 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 17:18:30,595 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 17:18:30,595 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:30,595 INFO  L85        PathProgramCache]: Analyzing trace with hash 2117205923, now seen corresponding path program 5 times
[2024-06-04 17:18:30,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:30,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299792491]
[2024-06-04 17:18:30,596 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:30,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:30,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:40,608 INFO  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 17:18:40,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:40,609 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299792491]
[2024-06-04 17:18:40,609 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299792491] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:40,609 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:40,609 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:18:40,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183046381]
[2024-06-04 17:18:40,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:40,609 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:18:40,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:40,610 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:18:40,610 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:18:40,972 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:18:40,973 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 114 transitions, 875 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:18:40,973 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:40,973 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:18:40,973 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:42,421 INFO  L124   PetriNetUnfolderBase]: 1860/2867 cut-off events.
[2024-06-04 17:18:42,421 INFO  L125   PetriNetUnfolderBase]: For 86798/86806 co-relation queries the response was YES.
[2024-06-04 17:18:42,428 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18363 conditions, 2867 events. 1860/2867 cut-off events. For 86798/86806 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14222 event pairs, 541 based on Foata normal form. 10/2876 useless extension candidates. Maximal degree in co-relation 18317. Up to 2591 conditions per place. 
[2024-06-04 17:18:42,438 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 113 selfloop transitions, 31 changer transitions 0/150 dead transitions.
[2024-06-04 17:18:42,438 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 150 transitions, 1344 flow
[2024-06-04 17:18:42,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:18:42,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:18:42,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-04 17:18:42,441 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-04 17:18:42,441 INFO  L175             Difference]: Start difference. First operand has 105 places, 114 transitions, 875 flow. Second operand 9 states and 171 transitions.
[2024-06-04 17:18:42,441 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 150 transitions, 1344 flow
[2024-06-04 17:18:42,468 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 150 transitions, 1222 flow, removed 31 selfloop flow, removed 7 redundant places.
[2024-06-04 17:18:42,469 INFO  L231             Difference]: Finished difference. Result has 108 places, 121 transitions, 941 flow
[2024-06-04 17:18:42,470 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=941, PETRI_PLACES=108, PETRI_TRANSITIONS=121}
[2024-06-04 17:18:42,470 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 64 predicate places.
[2024-06-04 17:18:42,470 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 121 transitions, 941 flow
[2024-06-04 17:18:42,470 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:18:42,470 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:42,470 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:42,471 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 17:18:42,471 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 17:18:42,471 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:42,471 INFO  L85        PathProgramCache]: Analyzing trace with hash 2123635013, now seen corresponding path program 6 times
[2024-06-04 17:18:42,471 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:42,471 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616472521]
[2024-06-04 17:18:42,471 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:42,471 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:42,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:53,190 INFO  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 17:18:53,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:53,191 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616472521]
[2024-06-04 17:18:53,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616472521] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:53,191 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:53,191 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:18:53,191 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994025477]
[2024-06-04 17:18:53,191 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:53,191 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:18:53,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:53,192 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:18:53,192 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:18:53,476 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:18:53,476 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 121 transitions, 941 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:18:53,476 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:53,476 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:18:53,476 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:54,786 INFO  L124   PetriNetUnfolderBase]: 1871/2888 cut-off events.
[2024-06-04 17:18:54,787 INFO  L125   PetriNetUnfolderBase]: For 93290/93298 co-relation queries the response was YES.
[2024-06-04 17:18:54,794 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18979 conditions, 2888 events. 1871/2888 cut-off events. For 93290/93298 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14372 event pairs, 541 based on Foata normal form. 10/2897 useless extension candidates. Maximal degree in co-relation 18932. Up to 2598 conditions per place. 
[2024-06-04 17:18:54,805 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 110 selfloop transitions, 33 changer transitions 0/149 dead transitions.
[2024-06-04 17:18:54,805 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 149 transitions, 1381 flow
[2024-06-04 17:18:54,807 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:18:54,807 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:18:54,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-04 17:18:54,808 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4476744186046512
[2024-06-04 17:18:54,808 INFO  L175             Difference]: Start difference. First operand has 108 places, 121 transitions, 941 flow. Second operand 8 states and 154 transitions.
[2024-06-04 17:18:54,808 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 149 transitions, 1381 flow
[2024-06-04 17:18:54,836 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 149 transitions, 1251 flow, removed 37 selfloop flow, removed 6 redundant places.
[2024-06-04 17:18:54,838 INFO  L231             Difference]: Finished difference. Result has 110 places, 124 transitions, 979 flow
[2024-06-04 17:18:54,838 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=979, PETRI_PLACES=110, PETRI_TRANSITIONS=124}
[2024-06-04 17:18:54,839 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places.
[2024-06-04 17:18:54,839 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 124 transitions, 979 flow
[2024-06-04 17:18:54,839 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:18:54,839 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:54,839 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:54,839 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 17:18:54,839 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 17:18:54,839 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:54,840 INFO  L85        PathProgramCache]: Analyzing trace with hash 1030028211, now seen corresponding path program 2 times
[2024-06-04 17:18:54,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:54,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431713839]
[2024-06-04 17:18:54,840 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:54,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:54,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:19:05,198 INFO  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 17:19:05,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:19:05,198 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431713839]
[2024-06-04 17:19:05,198 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431713839] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:19:05,199 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:19:05,199 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:19:05,199 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924355185]
[2024-06-04 17:19:05,199 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:19:05,200 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:19:05,200 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:19:05,200 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:19:05,200 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:19:05,449 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:19:05,449 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 124 transitions, 979 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:19:05,449 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:19:05,450 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:19:05,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:19:06,754 INFO  L124   PetriNetUnfolderBase]: 1888/2915 cut-off events.
[2024-06-04 17:19:06,754 INFO  L125   PetriNetUnfolderBase]: For 102189/102197 co-relation queries the response was YES.
[2024-06-04 17:19:06,761 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19606 conditions, 2915 events. 1888/2915 cut-off events. For 102189/102197 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14446 event pairs, 546 based on Foata normal form. 12/2926 useless extension candidates. Maximal degree in co-relation 19558. Up to 2670 conditions per place. 
[2024-06-04 17:19:06,770 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 125 selfloop transitions, 21 changer transitions 0/152 dead transitions.
[2024-06-04 17:19:06,770 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 152 transitions, 1403 flow
[2024-06-04 17:19:06,772 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:19:06,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:19:06,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-04 17:19:06,773 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-04 17:19:06,773 INFO  L175             Difference]: Start difference. First operand has 110 places, 124 transitions, 979 flow. Second operand 8 states and 152 transitions.
[2024-06-04 17:19:06,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 152 transitions, 1403 flow
[2024-06-04 17:19:06,812 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 152 transitions, 1261 flow, removed 42 selfloop flow, removed 6 redundant places.
[2024-06-04 17:19:06,814 INFO  L231             Difference]: Finished difference. Result has 112 places, 126 transitions, 950 flow
[2024-06-04 17:19:06,814 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=950, PETRI_PLACES=112, PETRI_TRANSITIONS=126}
[2024-06-04 17:19:06,815 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 68 predicate places.
[2024-06-04 17:19:06,815 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 126 transitions, 950 flow
[2024-06-04 17:19:06,815 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:19:06,815 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:19:06,815 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:19:06,815 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 17:19:06,815 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 17:19:06,816 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:19:06,816 INFO  L85        PathProgramCache]: Analyzing trace with hash -62068623, now seen corresponding path program 7 times
[2024-06-04 17:19:06,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:19:06,816 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257092955]
[2024-06-04 17:19:06,816 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:19:06,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:19:06,879 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:19:17,570 INFO  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 17:19:17,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:19:17,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257092955]
[2024-06-04 17:19:17,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257092955] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:19:17,570 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:19:17,570 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:19:17,570 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674072368]
[2024-06-04 17:19:17,570 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:19:17,571 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:19:17,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:19:17,571 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:19:17,571 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:19:17,834 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:19:17,835 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 126 transitions, 950 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:19:17,835 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:19:17,835 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:19:17,835 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:19:19,174 INFO  L124   PetriNetUnfolderBase]: 1899/2933 cut-off events.
[2024-06-04 17:19:19,175 INFO  L125   PetriNetUnfolderBase]: For 100016/100020 co-relation queries the response was YES.
[2024-06-04 17:19:19,182 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19513 conditions, 2933 events. 1899/2933 cut-off events. For 100016/100020 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14603 event pairs, 524 based on Foata normal form. 3/2934 useless extension candidates. Maximal degree in co-relation 19464. Up to 2590 conditions per place. 
[2024-06-04 17:19:19,191 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 105 selfloop transitions, 43 changer transitions 0/154 dead transitions.
[2024-06-04 17:19:19,192 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 154 transitions, 1402 flow
[2024-06-04 17:19:19,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:19:19,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:19:19,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-04 17:19:19,194 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45348837209302323
[2024-06-04 17:19:19,194 INFO  L175             Difference]: Start difference. First operand has 112 places, 126 transitions, 950 flow. Second operand 8 states and 156 transitions.
[2024-06-04 17:19:19,194 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 154 transitions, 1402 flow
[2024-06-04 17:19:19,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 154 transitions, 1309 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-04 17:19:19,229 INFO  L231             Difference]: Finished difference. Result has 114 places, 129 transitions, 1043 flow
[2024-06-04 17:19:19,229 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1043, PETRI_PLACES=114, PETRI_TRANSITIONS=129}
[2024-06-04 17:19:19,229 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 70 predicate places.
[2024-06-04 17:19:19,229 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 129 transitions, 1043 flow
[2024-06-04 17:19:19,229 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:19:19,230 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:19:19,230 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:19:19,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 17:19:19,230 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:19:19,230 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:19:19,230 INFO  L85        PathProgramCache]: Analyzing trace with hash -1941109605, now seen corresponding path program 3 times
[2024-06-04 17:19:19,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:19:19,231 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302860587]
[2024-06-04 17:19:19,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:19:19,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:19:19,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:19:30,579 INFO  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 17:19:30,580 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:19:30,580 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302860587]
[2024-06-04 17:19:30,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302860587] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:19:30,580 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:19:30,580 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:19:30,580 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097618368]
[2024-06-04 17:19:30,580 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:19:30,580 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:19:30,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:19:30,581 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:19:30,581 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:19:30,752 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:19:30,753 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 129 transitions, 1043 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:19:30,753 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:19:30,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:19:30,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:19:32,186 INFO  L124   PetriNetUnfolderBase]: 2002/3105 cut-off events.
[2024-06-04 17:19:32,186 INFO  L125   PetriNetUnfolderBase]: For 118970/118978 co-relation queries the response was YES.
[2024-06-04 17:19:32,194 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21757 conditions, 3105 events. 2002/3105 cut-off events. For 118970/118978 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15809 event pairs, 539 based on Foata normal form. 12/3116 useless extension candidates. Maximal degree in co-relation 21707. Up to 2375 conditions per place. 
[2024-06-04 17:19:32,205 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 99 selfloop transitions, 60 changer transitions 0/165 dead transitions.
[2024-06-04 17:19:32,205 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 165 transitions, 1713 flow
[2024-06-04 17:19:32,207 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:19:32,207 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:19:32,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-04 17:19:32,208 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47093023255813954
[2024-06-04 17:19:32,208 INFO  L175             Difference]: Start difference. First operand has 114 places, 129 transitions, 1043 flow. Second operand 8 states and 162 transitions.
[2024-06-04 17:19:32,208 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 165 transitions, 1713 flow
[2024-06-04 17:19:32,243 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 165 transitions, 1551 flow, removed 40 selfloop flow, removed 6 redundant places.
[2024-06-04 17:19:32,245 INFO  L231             Difference]: Finished difference. Result has 116 places, 133 transitions, 1140 flow
[2024-06-04 17:19:32,245 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1140, PETRI_PLACES=116, PETRI_TRANSITIONS=133}
[2024-06-04 17:19:32,246 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 72 predicate places.
[2024-06-04 17:19:32,246 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 133 transitions, 1140 flow
[2024-06-04 17:19:32,246 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:19:32,246 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:19:32,246 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:19:32,246 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 17:19:32,246 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 17:19:32,247 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:19:32,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -53794413, now seen corresponding path program 8 times
[2024-06-04 17:19:32,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:19:32,247 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950600853]
[2024-06-04 17:19:32,247 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:19:32,247 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:19:32,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:19:42,596 INFO  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 17:19:42,596 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:19:42,596 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950600853]
[2024-06-04 17:19:42,596 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950600853] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:19:42,596 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:19:42,596 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:19:42,596 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170884178]
[2024-06-04 17:19:42,597 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:19:42,597 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:19:42,597 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:19:42,597 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:19:42,597 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:19:42,850 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:19:42,850 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 133 transitions, 1140 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:19:42,850 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:19:42,850 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:19:42,850 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:19:44,273 INFO  L124   PetriNetUnfolderBase]: 1997/3095 cut-off events.
[2024-06-04 17:19:44,274 INFO  L125   PetriNetUnfolderBase]: For 126063/126067 co-relation queries the response was YES.
[2024-06-04 17:19:44,282 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22025 conditions, 3095 events. 1997/3095 cut-off events. For 126063/126067 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15759 event pairs, 560 based on Foata normal form. 3/3096 useless extension candidates. Maximal degree in co-relation 21974. Up to 2680 conditions per place. 
[2024-06-04 17:19:44,294 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 90 selfloop transitions, 64 changer transitions 0/160 dead transitions.
[2024-06-04 17:19:44,294 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 160 transitions, 1606 flow
[2024-06-04 17:19:44,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:19:44,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:19:44,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-04 17:19:44,297 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45058139534883723
[2024-06-04 17:19:44,297 INFO  L175             Difference]: Start difference. First operand has 116 places, 133 transitions, 1140 flow. Second operand 8 states and 155 transitions.
[2024-06-04 17:19:44,297 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 160 transitions, 1606 flow
[2024-06-04 17:19:44,348 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 160 transitions, 1456 flow, removed 34 selfloop flow, removed 6 redundant places.
[2024-06-04 17:19:44,350 INFO  L231             Difference]: Finished difference. Result has 118 places, 136 transitions, 1226 flow
[2024-06-04 17:19:44,350 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1226, PETRI_PLACES=118, PETRI_TRANSITIONS=136}
[2024-06-04 17:19:44,350 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 74 predicate places.
[2024-06-04 17:19:44,351 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 136 transitions, 1226 flow
[2024-06-04 17:19:44,351 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:19:44,351 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:19:44,351 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:19:44,351 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 17:19:44,351 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 17:19:44,351 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:19:44,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 2123872411, now seen corresponding path program 4 times
[2024-06-04 17:19:44,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:19:44,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419134929]
[2024-06-04 17:19:44,352 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:19:44,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:19:44,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:19:54,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:19:54,945 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:19:54,945 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419134929]
[2024-06-04 17:19:54,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419134929] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:19:54,945 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:19:54,945 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:19:54,945 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588974478]
[2024-06-04 17:19:54,945 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:19:54,946 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:19:54,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:19:54,946 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:19:54,946 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:19:55,293 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:19:55,294 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 136 transitions, 1226 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:19:55,294 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:19:55,294 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:19:55,294 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:19:56,698 INFO  L124   PetriNetUnfolderBase]: 1989/3086 cut-off events.
[2024-06-04 17:19:56,698 INFO  L125   PetriNetUnfolderBase]: For 132193/132201 co-relation queries the response was YES.
[2024-06-04 17:19:56,705 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22063 conditions, 3086 events. 1989/3086 cut-off events. For 132193/132201 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15750 event pairs, 580 based on Foata normal form. 12/3097 useless extension candidates. Maximal degree in co-relation 22012. Up to 2809 conditions per place. 
[2024-06-04 17:19:56,716 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 127 selfloop transitions, 29 changer transitions 0/162 dead transitions.
[2024-06-04 17:19:56,716 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 162 transitions, 1656 flow
[2024-06-04 17:19:56,718 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:19:56,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:19:56,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-04 17:19:56,719 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-04 17:19:56,719 INFO  L175             Difference]: Start difference. First operand has 118 places, 136 transitions, 1226 flow. Second operand 8 states and 152 transitions.
[2024-06-04 17:19:56,719 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 162 transitions, 1656 flow
[2024-06-04 17:19:56,758 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 162 transitions, 1444 flow, removed 44 selfloop flow, removed 6 redundant places.
[2024-06-04 17:19:56,760 INFO  L231             Difference]: Finished difference. Result has 120 places, 137 transitions, 1133 flow
[2024-06-04 17:19:56,760 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1133, PETRI_PLACES=120, PETRI_TRANSITIONS=137}
[2024-06-04 17:19:56,761 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 76 predicate places.
[2024-06-04 17:19:56,761 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 137 transitions, 1133 flow
[2024-06-04 17:19:56,761 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:19:56,761 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:19:56,761 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:19:56,761 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 17:19:56,761 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:19:56,761 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:19:56,762 INFO  L85        PathProgramCache]: Analyzing trace with hash -1801436739, now seen corresponding path program 2 times
[2024-06-04 17:19:56,762 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:19:56,762 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829176356]
[2024-06-04 17:19:56,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:19:56,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:19:56,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:20:11,909 INFO  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 17:20:11,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:20:11,910 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829176356]
[2024-06-04 17:20:11,910 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829176356] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:20:11,910 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:20:11,910 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:20:11,910 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99047070]
[2024-06-04 17:20:11,910 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:20:11,910 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:20:11,910 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:20:11,910 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:20:11,910 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:20:12,028 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:20:12,029 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 137 transitions, 1133 flow. Second operand  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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 17:20:12,029 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:20:12,029 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:20:12,029 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:20:13,402 INFO  L124   PetriNetUnfolderBase]: 1983/3075 cut-off events.
[2024-06-04 17:20:13,402 INFO  L125   PetriNetUnfolderBase]: For 136449/136453 co-relation queries the response was YES.
[2024-06-04 17:20:13,411 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21952 conditions, 3075 events. 1983/3075 cut-off events. For 136449/136453 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15671 event pairs, 644 based on Foata normal form. 3/3076 useless extension candidates. Maximal degree in co-relation 21900. Up to 2882 conditions per place. 
[2024-06-04 17:20:13,423 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 124 selfloop transitions, 18 changer transitions 0/148 dead transitions.
[2024-06-04 17:20:13,423 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 148 transitions, 1463 flow
[2024-06-04 17:20:13,424 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:20:13,424 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:20:13,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions.
[2024-06-04 17:20:13,424 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43410852713178294
[2024-06-04 17:20:13,424 INFO  L175             Difference]: Start difference. First operand has 120 places, 137 transitions, 1133 flow. Second operand 6 states and 112 transitions.
[2024-06-04 17:20:13,424 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 148 transitions, 1463 flow
[2024-06-04 17:20:13,481 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 148 transitions, 1330 flow, removed 39 selfloop flow, removed 6 redundant places.
[2024-06-04 17:20:13,483 INFO  L231             Difference]: Finished difference. Result has 120 places, 137 transitions, 1042 flow
[2024-06-04 17:20:13,483 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1042, PETRI_PLACES=120, PETRI_TRANSITIONS=137}
[2024-06-04 17:20:13,483 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 76 predicate places.
[2024-06-04 17:20:13,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 137 transitions, 1042 flow
[2024-06-04 17:20:13,484 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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 17:20:13,484 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:20:13,484 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:20:13,484 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 17:20:13,484 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:20:13,484 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:20:13,484 INFO  L85        PathProgramCache]: Analyzing trace with hash -1807144707, now seen corresponding path program 1 times
[2024-06-04 17:20:13,485 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:20:13,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511468504]
[2024-06-04 17:20:13,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:20:13,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:20:13,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:20:25,176 INFO  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 17:20:25,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:20:25,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511468504]
[2024-06-04 17:20:25,176 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511468504] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:20:25,176 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:20:25,176 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:20:25,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218465835]
[2024-06-04 17:20:25,177 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:20:25,177 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:20:25,177 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:20:25,177 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:20:25,177 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:20:25,346 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:20:25,346 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 137 transitions, 1042 flow. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:20:25,346 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:20:25,346 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:20:25,347 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:20:26,418 INFO  L124   PetriNetUnfolderBase]: 1781/2854 cut-off events.
[2024-06-04 17:20:26,418 INFO  L125   PetriNetUnfolderBase]: For 122581/122581 co-relation queries the response was YES.
[2024-06-04 17:20:26,426 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19724 conditions, 2854 events. 1781/2854 cut-off events. For 122581/122581 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14998 event pairs, 525 based on Foata normal form. 1/2854 useless extension candidates. Maximal degree in co-relation 19671. Up to 2620 conditions per place. 
[2024-06-04 17:20:26,436 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 136 selfloop transitions, 15 changer transitions 0/158 dead transitions.
[2024-06-04 17:20:26,436 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 158 transitions, 1501 flow
[2024-06-04 17:20:26,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:20:26,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:20:26,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions.
[2024-06-04 17:20:26,437 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573643410852713
[2024-06-04 17:20:26,437 INFO  L175             Difference]: Start difference. First operand has 120 places, 137 transitions, 1042 flow. Second operand 6 states and 118 transitions.
[2024-06-04 17:20:26,437 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 158 transitions, 1501 flow
[2024-06-04 17:20:26,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 158 transitions, 1455 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-04 17:20:26,481 INFO  L231             Difference]: Finished difference. Result has 122 places, 145 transitions, 1112 flow
[2024-06-04 17:20:26,481 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1112, PETRI_PLACES=122, PETRI_TRANSITIONS=145}
[2024-06-04 17:20:26,482 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 78 predicate places.
[2024-06-04 17:20:26,482 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 145 transitions, 1112 flow
[2024-06-04 17:20:26,482 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:20:26,482 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:20:26,482 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:20:26,482 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 17:20:26,482 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:20:26,482 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:20:26,482 INFO  L85        PathProgramCache]: Analyzing trace with hash -828158817, now seen corresponding path program 2 times
[2024-06-04 17:20:26,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:20:26,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635922897]
[2024-06-04 17:20:26,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:20:26,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:20:26,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:20:38,463 INFO  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 17:20:38,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:20:38,464 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635922897]
[2024-06-04 17:20:38,464 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635922897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:20:38,464 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:20:38,464 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:20:38,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683716467]
[2024-06-04 17:20:38,464 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:20:38,464 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:20:38,465 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:20:38,465 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:20:38,465 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:20:38,587 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:20:38,587 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 145 transitions, 1112 flow. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:20:38,587 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:20:38,587 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:20:38,587 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:20:39,665 INFO  L124   PetriNetUnfolderBase]: 1778/2850 cut-off events.
[2024-06-04 17:20:39,666 INFO  L125   PetriNetUnfolderBase]: For 128802/128802 co-relation queries the response was YES.
[2024-06-04 17:20:39,674 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20182 conditions, 2850 events. 1778/2850 cut-off events. For 128802/128802 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15004 event pairs, 524 based on Foata normal form. 1/2850 useless extension candidates. Maximal degree in co-relation 20127. Up to 2629 conditions per place. 
[2024-06-04 17:20:39,685 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 137 selfloop transitions, 11 changer transitions 0/155 dead transitions.
[2024-06-04 17:20:39,685 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 155 transitions, 1439 flow
[2024-06-04 17:20:39,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:20:39,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:20:39,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions.
[2024-06-04 17:20:39,686 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43410852713178294
[2024-06-04 17:20:39,686 INFO  L175             Difference]: Start difference. First operand has 122 places, 145 transitions, 1112 flow. Second operand 6 states and 112 transitions.
[2024-06-04 17:20:39,686 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 155 transitions, 1439 flow
[2024-06-04 17:20:39,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 155 transitions, 1389 flow, removed 21 selfloop flow, removed 2 redundant places.
[2024-06-04 17:20:39,728 INFO  L231             Difference]: Finished difference. Result has 126 places, 146 transitions, 1101 flow
[2024-06-04 17:20:39,728 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1101, PETRI_PLACES=126, PETRI_TRANSITIONS=146}
[2024-06-04 17:20:39,728 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 82 predicate places.
[2024-06-04 17:20:39,728 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 146 transitions, 1101 flow
[2024-06-04 17:20:39,728 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:20:39,728 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:20:39,728 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:20:39,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 17:20:39,728 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:20:39,729 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:20:39,729 INFO  L85        PathProgramCache]: Analyzing trace with hash -1801422851, now seen corresponding path program 1 times
[2024-06-04 17:20:39,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:20:39,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796508138]
[2024-06-04 17:20:39,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:20:39,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:20:39,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:20:55,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:20:55,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:20:55,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796508138]
[2024-06-04 17:20:55,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796508138] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:20:55,551 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:20:55,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:20:55,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542781473]
[2024-06-04 17:20:55,551 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:20:55,551 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:20:55,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:20:55,551 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:20:55,551 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:20:55,688 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:20:55,689 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 146 transitions, 1101 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:20:55,689 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:20:55,689 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:20:55,689 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:20:56,961 INFO  L124   PetriNetUnfolderBase]: 1888/2958 cut-off events.
[2024-06-04 17:20:56,961 INFO  L125   PetriNetUnfolderBase]: For 133294/133294 co-relation queries the response was YES.
[2024-06-04 17:20:56,970 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21020 conditions, 2958 events. 1888/2958 cut-off events. For 133294/133294 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15086 event pairs, 564 based on Foata normal form. 2/2959 useless extension candidates. Maximal degree in co-relation 20963. Up to 2820 conditions per place. 
[2024-06-04 17:20:56,981 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 141 selfloop transitions, 14 changer transitions 0/160 dead transitions.
[2024-06-04 17:20:56,982 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 160 transitions, 1471 flow
[2024-06-04 17:20:56,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:20:56,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:20:56,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-04 17:20:56,982 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4053156146179402
[2024-06-04 17:20:56,982 INFO  L175             Difference]: Start difference. First operand has 126 places, 146 transitions, 1101 flow. Second operand 7 states and 122 transitions.
[2024-06-04 17:20:56,982 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 160 transitions, 1471 flow
[2024-06-04 17:20:57,040 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 160 transitions, 1451 flow, removed 1 selfloop flow, removed 4 redundant places.
[2024-06-04 17:20:57,042 INFO  L231             Difference]: Finished difference. Result has 129 places, 149 transitions, 1155 flow
[2024-06-04 17:20:57,042 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1155, PETRI_PLACES=129, PETRI_TRANSITIONS=149}
[2024-06-04 17:20:57,042 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 85 predicate places.
[2024-06-04 17:20:57,043 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 149 transitions, 1155 flow
[2024-06-04 17:20:57,043 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:20:57,043 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:20:57,043 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 17:20:57,043 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 17:20:57,043 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:20:57,043 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:20:57,043 INFO  L85        PathProgramCache]: Analyzing trace with hash 1905944113, now seen corresponding path program 1 times
[2024-06-04 17:20:57,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:20:57,043 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609652953]
[2024-06-04 17:20:57,043 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:20:57,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:20:57,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:21:07,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:21:07,257 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:21:07,257 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609652953]
[2024-06-04 17:21:07,257 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609652953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:21:07,257 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:21:07,257 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:21:07,257 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484651186]
[2024-06-04 17:21:07,257 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:21:07,257 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:21:07,257 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:21:07,258 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:21:07,258 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:21:07,568 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:21:07,569 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 149 transitions, 1155 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:07,569 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:21:07,569 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:21:07,569 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:21:09,187 INFO  L124   PetriNetUnfolderBase]: 2037/3164 cut-off events.
[2024-06-04 17:21:09,187 INFO  L125   PetriNetUnfolderBase]: For 169532/169532 co-relation queries the response was YES.
[2024-06-04 17:21:09,196 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23934 conditions, 3164 events. 2037/3164 cut-off events. For 169532/169532 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16290 event pairs, 636 based on Foata normal form. 16/3177 useless extension candidates. Maximal degree in co-relation 23876. Up to 2872 conditions per place. 
[2024-06-04 17:21:09,207 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 164 selfloop transitions, 18 changer transitions 0/188 dead transitions.
[2024-06-04 17:21:09,207 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 188 transitions, 1715 flow
[2024-06-04 17:21:09,209 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:21:09,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:21:09,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-04 17:21:09,210 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4496124031007752
[2024-06-04 17:21:09,210 INFO  L175             Difference]: Start difference. First operand has 129 places, 149 transitions, 1155 flow. Second operand 9 states and 174 transitions.
[2024-06-04 17:21:09,210 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 188 transitions, 1715 flow
[2024-06-04 17:21:09,252 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 188 transitions, 1663 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-04 17:21:09,254 INFO  L231             Difference]: Finished difference. Result has 133 places, 150 transitions, 1202 flow
[2024-06-04 17:21:09,255 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1202, PETRI_PLACES=133, PETRI_TRANSITIONS=150}
[2024-06-04 17:21:09,255 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places.
[2024-06-04 17:21:09,255 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 150 transitions, 1202 flow
[2024-06-04 17:21:09,255 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:09,255 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:21:09,255 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 17:21:09,255 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 17:21:09,255 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:21:09,256 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:21:09,256 INFO  L85        PathProgramCache]: Analyzing trace with hash 1190365467, now seen corresponding path program 2 times
[2024-06-04 17:21:09,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:21:09,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616377515]
[2024-06-04 17:21:09,256 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:21:09,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:21:09,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:21:20,001 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:21:20,002 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:21:20,002 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616377515]
[2024-06-04 17:21:20,002 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616377515] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:21:20,002 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:21:20,002 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:21:20,002 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437397075]
[2024-06-04 17:21:20,002 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:21:20,002 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:21:20,002 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:21:20,003 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:21:20,003 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:21:20,361 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:21:20,362 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 150 transitions, 1202 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:20,362 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:21:20,362 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:21:20,362 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:21:21,895 INFO  L124   PetriNetUnfolderBase]: 2095/3266 cut-off events.
[2024-06-04 17:21:21,895 INFO  L125   PetriNetUnfolderBase]: For 183472/183472 co-relation queries the response was YES.
[2024-06-04 17:21:21,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25024 conditions, 3266 events. 2095/3266 cut-off events. For 183472/183472 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 17037 event pairs, 592 based on Foata normal form. 16/3281 useless extension candidates. Maximal degree in co-relation 24965. Up to 2939 conditions per place. 
[2024-06-04 17:21:21,917 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 156 selfloop transitions, 24 changer transitions 0/186 dead transitions.
[2024-06-04 17:21:21,917 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 186 transitions, 1750 flow
[2024-06-04 17:21:21,920 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:21:21,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:21:21,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-04 17:21:21,920 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-04 17:21:21,920 INFO  L175             Difference]: Start difference. First operand has 133 places, 150 transitions, 1202 flow. Second operand 9 states and 172 transitions.
[2024-06-04 17:21:21,920 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 186 transitions, 1750 flow
[2024-06-04 17:21:22,003 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 186 transitions, 1693 flow, removed 12 selfloop flow, removed 7 redundant places.
[2024-06-04 17:21:22,005 INFO  L231             Difference]: Finished difference. Result has 135 places, 151 transitions, 1258 flow
[2024-06-04 17:21:22,005 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1258, PETRI_PLACES=135, PETRI_TRANSITIONS=151}
[2024-06-04 17:21:22,005 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 91 predicate places.
[2024-06-04 17:21:22,006 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 151 transitions, 1258 flow
[2024-06-04 17:21:22,006 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:22,006 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:21:22,006 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 17:21:22,006 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 17:21:22,006 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:21:22,006 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:21:22,006 INFO  L85        PathProgramCache]: Analyzing trace with hash 1190567277, now seen corresponding path program 3 times
[2024-06-04 17:21:22,006 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:21:22,006 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111324079]
[2024-06-04 17:21:22,006 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:21:22,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:21:22,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:21:33,864 INFO  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 17:21:33,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:21:33,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111324079]
[2024-06-04 17:21:33,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111324079] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:21:33,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:21:33,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:21:33,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947348688]
[2024-06-04 17:21:33,864 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:21:33,865 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:21:33,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:21:33,865 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:21:33,865 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:21:34,212 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:21:34,212 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 151 transitions, 1258 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:34,212 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:21:34,212 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:21:34,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:21:35,795 INFO  L124   PetriNetUnfolderBase]: 2153/3374 cut-off events.
[2024-06-04 17:21:35,795 INFO  L125   PetriNetUnfolderBase]: For 195379/195379 co-relation queries the response was YES.
[2024-06-04 17:21:35,806 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26009 conditions, 3374 events. 2153/3374 cut-off events. For 195379/195379 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17812 event pairs, 607 based on Foata normal form. 16/3389 useless extension candidates. Maximal degree in co-relation 25949. Up to 3029 conditions per place. 
[2024-06-04 17:21:35,818 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 152 selfloop transitions, 29 changer transitions 0/187 dead transitions.
[2024-06-04 17:21:35,818 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 187 transitions, 1810 flow
[2024-06-04 17:21:35,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:21:35,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:21:35,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-04 17:21:35,821 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4470284237726098
[2024-06-04 17:21:35,821 INFO  L175             Difference]: Start difference. First operand has 135 places, 151 transitions, 1258 flow. Second operand 9 states and 173 transitions.
[2024-06-04 17:21:35,821 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 187 transitions, 1810 flow
[2024-06-04 17:21:35,923 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 187 transitions, 1743 flow, removed 12 selfloop flow, removed 7 redundant places.
[2024-06-04 17:21:35,925 INFO  L231             Difference]: Finished difference. Result has 137 places, 152 transitions, 1314 flow
[2024-06-04 17:21:35,925 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1314, PETRI_PLACES=137, PETRI_TRANSITIONS=152}
[2024-06-04 17:21:35,925 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 93 predicate places.
[2024-06-04 17:21:35,926 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 152 transitions, 1314 flow
[2024-06-04 17:21:35,926 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:35,926 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:21:35,926 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 17:21:35,926 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 17:21:35,926 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 17:21:35,926 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:21:35,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 1190574717, now seen corresponding path program 4 times
[2024-06-04 17:21:35,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:21:35,926 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739939732]
[2024-06-04 17:21:35,926 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:21:35,926 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:21:35,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:21:46,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:21:46,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:21:46,079 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739939732]
[2024-06-04 17:21:46,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739939732] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:21:46,079 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:21:46,079 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:21:46,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158636748]
[2024-06-04 17:21:46,079 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:21:46,079 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:21:46,079 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:21:46,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:21:46,080 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:21:46,427 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:21:46,427 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 152 transitions, 1314 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:46,427 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:21:46,427 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:21:46,427 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:21:48,089 INFO  L124   PetriNetUnfolderBase]: 2194/3445 cut-off events.
[2024-06-04 17:21:48,089 INFO  L125   PetriNetUnfolderBase]: For 204027/204027 co-relation queries the response was YES.
[2024-06-04 17:21:48,100 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26726 conditions, 3445 events. 2194/3445 cut-off events. For 204027/204027 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 18240 event pairs, 569 based on Foata normal form. 12/3456 useless extension candidates. Maximal degree in co-relation 26665. Up to 2777 conditions per place. 
[2024-06-04 17:21:48,111 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 144 selfloop transitions, 41 changer transitions 0/191 dead transitions.
[2024-06-04 17:21:48,112 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 191 transitions, 1904 flow
[2024-06-04 17:21:48,114 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:21:48,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:21:48,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-04 17:21:48,114 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45478036175710596
[2024-06-04 17:21:48,114 INFO  L175             Difference]: Start difference. First operand has 137 places, 152 transitions, 1314 flow. Second operand 9 states and 176 transitions.
[2024-06-04 17:21:48,114 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 191 transitions, 1904 flow
[2024-06-04 17:21:48,195 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 191 transitions, 1823 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-06-04 17:21:48,197 INFO  L231             Difference]: Finished difference. Result has 139 places, 153 transitions, 1381 flow
[2024-06-04 17:21:48,197 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1381, PETRI_PLACES=139, PETRI_TRANSITIONS=153}
[2024-06-04 17:21:48,198 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 95 predicate places.
[2024-06-04 17:21:48,198 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 153 transitions, 1381 flow
[2024-06-04 17:21:48,198 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:48,198 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:21:48,198 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 17:21:48,198 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 17:21:48,198 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:21:48,199 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:21:48,199 INFO  L85        PathProgramCache]: Analyzing trace with hash -364225253, now seen corresponding path program 1 times
[2024-06-04 17:21:48,199 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:21:48,199 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324494770]
[2024-06-04 17:21:48,199 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:21:48,199 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:21:48,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:22:04,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:22:04,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:22:04,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324494770]
[2024-06-04 17:22:04,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324494770] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:22:04,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:22:04,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:22:04,282 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526657019]
[2024-06-04 17:22:04,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:22:04,283 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:22:04,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:22:04,283 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:22:04,283 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:22:04,418 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-04 17:22:04,419 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 153 transitions, 1381 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:04,419 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:22:04,419 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-04 17:22:04,419 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:22:05,962 INFO  L124   PetriNetUnfolderBase]: 2317/3572 cut-off events.
[2024-06-04 17:22:05,962 INFO  L125   PetriNetUnfolderBase]: For 205730/205730 co-relation queries the response was YES.
[2024-06-04 17:22:05,973 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27723 conditions, 3572 events. 2317/3572 cut-off events. For 205730/205730 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 18599 event pairs, 690 based on Foata normal form. 2/3573 useless extension candidates. Maximal degree in co-relation 27661. Up to 3433 conditions per place. 
[2024-06-04 17:22:05,986 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 150 selfloop transitions, 25 changer transitions 0/179 dead transitions.
[2024-06-04 17:22:05,986 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 179 transitions, 1977 flow
[2024-06-04 17:22:05,997 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:22:05,997 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:22:05,997 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-04 17:22:05,998 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 17:22:05,998 INFO  L175             Difference]: Start difference. First operand has 139 places, 153 transitions, 1381 flow. Second operand 7 states and 129 transitions.
[2024-06-04 17:22:05,998 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 179 transitions, 1977 flow
[2024-06-04 17:22:06,089 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 179 transitions, 1861 flow, removed 18 selfloop flow, removed 7 redundant places.
[2024-06-04 17:22:06,091 INFO  L231             Difference]: Finished difference. Result has 139 places, 159 transitions, 1419 flow
[2024-06-04 17:22:06,092 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1419, PETRI_PLACES=139, PETRI_TRANSITIONS=159}
[2024-06-04 17:22:06,092 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 95 predicate places.
[2024-06-04 17:22:06,092 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 159 transitions, 1419 flow
[2024-06-04 17:22:06,092 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:06,092 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:22:06,092 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 17:22:06,092 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 17:22:06,092 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 17:22:06,093 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:22:06,093 INFO  L85        PathProgramCache]: Analyzing trace with hash 1214237737, now seen corresponding path program 5 times
[2024-06-04 17:22:06,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:22:06,093 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806528464]
[2024-06-04 17:22:06,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:22:06,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:22:06,149 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:22:17,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:22:17,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:22:17,832 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806528464]
[2024-06-04 17:22:17,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806528464] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:22:17,832 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:22:17,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:22:17,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603325340]
[2024-06-04 17:22:17,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:22:17,832 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:22:17,832 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:22:17,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:22:17,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:22:18,006 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:22:18,007 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 159 transitions, 1419 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:18,007 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:22:18,007 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:22:18,007 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:22:19,762 INFO  L124   PetriNetUnfolderBase]: 2307/3624 cut-off events.
[2024-06-04 17:22:19,762 INFO  L125   PetriNetUnfolderBase]: For 227421/227427 co-relation queries the response was YES.
[2024-06-04 17:22:19,774 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28438 conditions, 3624 events. 2307/3624 cut-off events. For 227421/227427 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 19578 event pairs, 630 based on Foata normal form. 22/3645 useless extension candidates. Maximal degree in co-relation 28375. Up to 3214 conditions per place. 
[2024-06-04 17:22:19,787 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 158 selfloop transitions, 40 changer transitions 0/206 dead transitions.
[2024-06-04 17:22:19,788 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 206 transitions, 2075 flow
[2024-06-04 17:22:19,790 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:22:19,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:22:19,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions.
[2024-06-04 17:22:19,790 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4441860465116279
[2024-06-04 17:22:19,790 INFO  L175             Difference]: Start difference. First operand has 139 places, 159 transitions, 1419 flow. Second operand 10 states and 191 transitions.
[2024-06-04 17:22:19,790 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 206 transitions, 2075 flow
[2024-06-04 17:22:19,901 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 206 transitions, 2022 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-04 17:22:19,904 INFO  L231             Difference]: Finished difference. Result has 149 places, 170 transitions, 1608 flow
[2024-06-04 17:22:19,904 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1366, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1608, PETRI_PLACES=149, PETRI_TRANSITIONS=170}
[2024-06-04 17:22:19,904 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 105 predicate places.
[2024-06-04 17:22:19,904 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 170 transitions, 1608 flow
[2024-06-04 17:22:19,905 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:19,905 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:22:19,905 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 17:22:19,905 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 17:22:19,905 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 17:22:19,905 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:22:19,905 INFO  L85        PathProgramCache]: Analyzing trace with hash -221018745, now seen corresponding path program 6 times
[2024-06-04 17:22:19,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:22:19,906 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062267791]
[2024-06-04 17:22:19,906 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:22:19,906 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:22:19,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:22:31,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:22:31,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:22:31,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062267791]
[2024-06-04 17:22:31,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062267791] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:22:31,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:22:31,936 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:22:31,936 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181858259]
[2024-06-04 17:22:31,936 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:22:31,936 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:22:31,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:22:31,937 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:22:31,937 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:22:32,248 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:22:32,249 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 170 transitions, 1608 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:32,249 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:22:32,249 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:22:32,249 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:22:34,025 INFO  L124   PetriNetUnfolderBase]: 2365/3722 cut-off events.
[2024-06-04 17:22:34,025 INFO  L125   PetriNetUnfolderBase]: For 244888/244894 co-relation queries the response was YES.
[2024-06-04 17:22:34,038 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29960 conditions, 3722 events. 2365/3722 cut-off events. For 244888/244894 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20332 event pairs, 635 based on Foata normal form. 22/3743 useless extension candidates. Maximal degree in co-relation 29892. Up to 3312 conditions per place. 
[2024-06-04 17:22:34,051 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 159 selfloop transitions, 40 changer transitions 0/207 dead transitions.
[2024-06-04 17:22:34,052 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 207 transitions, 2204 flow
[2024-06-04 17:22:34,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:22:34,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:22:34,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-04 17:22:34,054 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-04 17:22:34,054 INFO  L175             Difference]: Start difference. First operand has 149 places, 170 transitions, 1608 flow. Second operand 10 states and 190 transitions.
[2024-06-04 17:22:34,054 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 207 transitions, 2204 flow
[2024-06-04 17:22:34,170 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 207 transitions, 2116 flow, removed 18 selfloop flow, removed 4 redundant places.
[2024-06-04 17:22:34,172 INFO  L231             Difference]: Finished difference. Result has 155 places, 171 transitions, 1667 flow
[2024-06-04 17:22:34,173 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1667, PETRI_PLACES=155, PETRI_TRANSITIONS=171}
[2024-06-04 17:22:34,173 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 111 predicate places.
[2024-06-04 17:22:34,173 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 171 transitions, 1667 flow
[2024-06-04 17:22:34,173 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:34,173 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:22:34,174 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 17:22:34,174 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 17:22:34,174 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 17:22:34,174 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:22:34,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 1672157555, now seen corresponding path program 7 times
[2024-06-04 17:22:34,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:22:34,174 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028526840]
[2024-06-04 17:22:34,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:22:34,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:22:34,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:22:45,951 INFO  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 17:22:45,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:22:45,951 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028526840]
[2024-06-04 17:22:45,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028526840] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:22:45,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:22:45,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:22:45,952 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206317485]
[2024-06-04 17:22:45,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:22:45,952 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:22:45,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:22:45,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:22:45,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:22:46,234 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:22:46,234 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 171 transitions, 1667 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:46,234 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:22:46,234 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:22:46,234 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:22:48,015 INFO  L124   PetriNetUnfolderBase]: 2445/3864 cut-off events.
[2024-06-04 17:22:48,015 INFO  L125   PetriNetUnfolderBase]: For 257984/257986 co-relation queries the response was YES.
[2024-06-04 17:22:48,029 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31072 conditions, 3864 events. 2445/3864 cut-off events. For 257984/257986 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 21357 event pairs, 628 based on Foata normal form. 16/3878 useless extension candidates. Maximal degree in co-relation 31003. Up to 3382 conditions per place. 
[2024-06-04 17:22:48,044 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 153 selfloop transitions, 53 changer transitions 0/214 dead transitions.
[2024-06-04 17:22:48,044 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 214 transitions, 2310 flow
[2024-06-04 17:22:48,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:22:48,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:22:48,046 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-04 17:22:48,047 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44883720930232557
[2024-06-04 17:22:48,047 INFO  L175             Difference]: Start difference. First operand has 155 places, 171 transitions, 1667 flow. Second operand 10 states and 193 transitions.
[2024-06-04 17:22:48,047 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 214 transitions, 2310 flow
[2024-06-04 17:22:48,167 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 214 transitions, 2205 flow, removed 14 selfloop flow, removed 8 redundant places.
[2024-06-04 17:22:48,169 INFO  L231             Difference]: Finished difference. Result has 159 places, 178 transitions, 1796 flow
[2024-06-04 17:22:48,169 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1562, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1796, PETRI_PLACES=159, PETRI_TRANSITIONS=178}
[2024-06-04 17:22:48,169 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 115 predicate places.
[2024-06-04 17:22:48,169 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 178 transitions, 1796 flow
[2024-06-04 17:22:48,170 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:48,170 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:22:48,170 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 17:22:48,170 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 17:22:48,170 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 17:22:48,171 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:22:48,171 INFO  L85        PathProgramCache]: Analyzing trace with hash 1214446987, now seen corresponding path program 8 times
[2024-06-04 17:22:48,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:22:48,171 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994938341]
[2024-06-04 17:22:48,171 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:22:48,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:22:48,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:22:58,864 INFO  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 17:22:58,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:22:58,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994938341]
[2024-06-04 17:22:58,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994938341] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:22:58,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:22:58,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:22:58,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005597513]
[2024-06-04 17:22:58,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:22:58,865 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:22:58,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:22:58,865 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:22:58,865 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:22:59,067 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:22:59,067 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 178 transitions, 1796 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:59,067 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:22:59,067 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:22:59,067 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:23:00,885 INFO  L124   PetriNetUnfolderBase]: 2503/3972 cut-off events.
[2024-06-04 17:23:00,886 INFO  L125   PetriNetUnfolderBase]: For 265685/265687 co-relation queries the response was YES.
[2024-06-04 17:23:00,900 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31989 conditions, 3972 events. 2503/3972 cut-off events. For 265685/265687 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 22163 event pairs, 628 based on Foata normal form. 12/3982 useless extension candidates. Maximal degree in co-relation 31917. Up to 3209 conditions per place. 
[2024-06-04 17:23:00,916 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 155 selfloop transitions, 57 changer transitions 0/220 dead transitions.
[2024-06-04 17:23:00,916 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 220 transitions, 2464 flow
[2024-06-04 17:23:00,918 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:23:00,918 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:23:00,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-04 17:23:00,919 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45348837209302323
[2024-06-04 17:23:00,919 INFO  L175             Difference]: Start difference. First operand has 159 places, 178 transitions, 1796 flow. Second operand 10 states and 195 transitions.
[2024-06-04 17:23:00,919 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 220 transitions, 2464 flow
[2024-06-04 17:23:01,044 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 220 transitions, 2347 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-04 17:23:01,046 INFO  L231             Difference]: Finished difference. Result has 164 places, 181 transitions, 1891 flow
[2024-06-04 17:23:01,046 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1679, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1891, PETRI_PLACES=164, PETRI_TRANSITIONS=181}
[2024-06-04 17:23:01,047 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 120 predicate places.
[2024-06-04 17:23:01,047 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 181 transitions, 1891 flow
[2024-06-04 17:23:01,047 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:23:01,047 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:23:01,047 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 17:23:01,047 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 17:23:01,048 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:23:01,048 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:23:01,048 INFO  L85        PathProgramCache]: Analyzing trace with hash -44854675, now seen corresponding path program 9 times
[2024-06-04 17:23:01,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:23:01,048 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676747364]
[2024-06-04 17:23:01,048 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:23:01,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:23:01,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:23:11,721 INFO  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 17:23:11,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:23:11,722 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676747364]
[2024-06-04 17:23:11,722 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676747364] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:23:11,722 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:23:11,722 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:23:11,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238700402]
[2024-06-04 17:23:11,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:23:11,722 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:23:11,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:23:11,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:23:11,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:23:12,050 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:23:12,051 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 181 transitions, 1891 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:23:12,051 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:23:12,051 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:23:12,051 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:23:13,897 INFO  L124   PetriNetUnfolderBase]: 2666/4252 cut-off events.
[2024-06-04 17:23:13,897 INFO  L125   PetriNetUnfolderBase]: For 304604/304610 co-relation queries the response was YES.
[2024-06-04 17:23:13,914 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35561 conditions, 4252 events. 2666/4252 cut-off events. For 304604/304610 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 24248 event pairs, 665 based on Foata normal form. 18/4269 useless extension candidates. Maximal degree in co-relation 35487. Up to 2716 conditions per place. 
[2024-06-04 17:23:13,931 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 128 selfloop transitions, 86 changer transitions 0/222 dead transitions.
[2024-06-04 17:23:13,931 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 222 transitions, 2829 flow
[2024-06-04 17:23:13,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:23:13,932 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:23:13,932 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-04 17:23:13,932 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4599483204134367
[2024-06-04 17:23:13,932 INFO  L175             Difference]: Start difference. First operand has 164 places, 181 transitions, 1891 flow. Second operand 9 states and 178 transitions.
[2024-06-04 17:23:13,933 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 222 transitions, 2829 flow
[2024-06-04 17:23:14,117 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 222 transitions, 2689 flow, removed 20 selfloop flow, removed 7 redundant places.
[2024-06-04 17:23:14,119 INFO  L231             Difference]: Finished difference. Result has 167 places, 184 transitions, 2159 flow
[2024-06-04 17:23:14,120 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2159, PETRI_PLACES=167, PETRI_TRANSITIONS=184}
[2024-06-04 17:23:14,120 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 123 predicate places.
[2024-06-04 17:23:14,120 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 184 transitions, 2159 flow
[2024-06-04 17:23:14,120 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:23:14,120 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:23:14,120 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 17:23:14,121 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 17:23:14,121 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 17:23:14,121 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:23:14,121 INFO  L85        PathProgramCache]: Analyzing trace with hash -54058885, now seen corresponding path program 10 times
[2024-06-04 17:23:14,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:23:14,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471810296]
[2024-06-04 17:23:14,121 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:23:14,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:23:14,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:23:26,152 INFO  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 17:23:26,152 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:23:26,152 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471810296]
[2024-06-04 17:23:26,152 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471810296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:23:26,153 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:23:26,153 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:23:26,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656618580]
[2024-06-04 17:23:26,153 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:23:26,153 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:23:26,153 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:23:26,153 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:23:26,153 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:23:26,401 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-04 17:23:26,402 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 184 transitions, 2159 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:23:26,402 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:23:26,402 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-04 17:23:26,402 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:23:28,425 INFO  L124   PetriNetUnfolderBase]: 2724/4350 cut-off events.
[2024-06-04 17:23:28,425 INFO  L125   PetriNetUnfolderBase]: For 326920/326926 co-relation queries the response was YES.
[2024-06-04 17:23:28,441 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37004 conditions, 4350 events. 2724/4350 cut-off events. For 326920/326926 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 25100 event pairs, 733 based on Foata normal form. 22/4371 useless extension candidates. Maximal degree in co-relation 36928. Up to 3798 conditions per place. 
[2024-06-04 17:23:28,457 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 138 selfloop transitions, 71 changer transitions 0/217 dead transitions.
[2024-06-04 17:23:28,457 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 217 transitions, 2774 flow
[2024-06-04 17:23:28,459 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:23:28,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:23:28,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-04 17:23:28,460 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42377260981912146
[2024-06-04 17:23:28,460 INFO  L175             Difference]: Start difference. First operand has 167 places, 184 transitions, 2159 flow. Second operand 9 states and 164 transitions.
[2024-06-04 17:23:28,460 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 217 transitions, 2774 flow
[2024-06-04 17:23:28,642 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 217 transitions, 2649 flow, removed 21 selfloop flow, removed 5 redundant places.
[2024-06-04 17:23:28,645 INFO  L231             Difference]: Finished difference. Result has 171 places, 185 transitions, 2252 flow
[2024-06-04 17:23:28,645 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2034, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2252, PETRI_PLACES=171, PETRI_TRANSITIONS=185}
[2024-06-04 17:23:28,645 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 127 predicate places.
[2024-06-04 17:23:28,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 185 transitions, 2252 flow
[2024-06-04 17:23:28,646 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:23:28,646 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:23:28,646 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 17:23:28,646 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 17:23:28,646 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 17:23:28,646 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:23:28,646 INFO  L85        PathProgramCache]: Analyzing trace with hash -310761205, now seen corresponding path program 11 times
[2024-06-04 17:23:28,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:23:28,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039604354]
[2024-06-04 17:23:28,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:23:28,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:23:28,703 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:23:40,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:23:40,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:23:40,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039604354]
[2024-06-04 17:23:40,428 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039604354] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:23:40,428 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:23:40,428 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:23:40,428 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445155236]
[2024-06-04 17:23:40,428 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:23:40,428 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:23:40,429 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:23:40,429 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:23:40,429 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:23:40,616 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:23:40,616 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 185 transitions, 2252 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:23:40,616 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:23:40,616 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:23:40,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:23:42,571 INFO  L124   PetriNetUnfolderBase]: 2696/4306 cut-off events.
[2024-06-04 17:23:42,571 INFO  L125   PetriNetUnfolderBase]: For 322886/322892 co-relation queries the response was YES.
[2024-06-04 17:23:42,587 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36206 conditions, 4306 events. 2696/4306 cut-off events. For 322886/322892 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 24795 event pairs, 717 based on Foata normal form. 22/4327 useless extension candidates. Maximal degree in co-relation 36128. Up to 3669 conditions per place. 
[2024-06-04 17:23:42,604 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 162 selfloop transitions, 47 changer transitions 0/217 dead transitions.
[2024-06-04 17:23:42,604 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 217 transitions, 2800 flow
[2024-06-04 17:23:42,606 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:23:42,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:23:42,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-04 17:23:42,606 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4470284237726098
[2024-06-04 17:23:42,606 INFO  L175             Difference]: Start difference. First operand has 171 places, 185 transitions, 2252 flow. Second operand 9 states and 173 transitions.
[2024-06-04 17:23:42,606 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 217 transitions, 2800 flow
[2024-06-04 17:23:42,857 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 217 transitions, 2627 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-04 17:23:42,860 INFO  L231             Difference]: Finished difference. Result has 173 places, 185 transitions, 2186 flow
[2024-06-04 17:23:42,860 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2186, PETRI_PLACES=173, PETRI_TRANSITIONS=185}
[2024-06-04 17:23:42,860 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 129 predicate places.
[2024-06-04 17:23:42,860 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 185 transitions, 2186 flow
[2024-06-04 17:23:42,860 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:23:42,860 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:23:42,860 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 17:23:42,860 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 17:23:42,861 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 17:23:42,861 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:23:42,861 INFO  L85        PathProgramCache]: Analyzing trace with hash 1866096965, now seen corresponding path program 12 times
[2024-06-04 17:23:42,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:23:42,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888607477]
[2024-06-04 17:23:42,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:23:42,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:23:42,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:23:54,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:23:54,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:23:54,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888607477]
[2024-06-04 17:23:54,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888607477] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:23:54,680 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:23:54,680 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:23:54,680 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225082093]
[2024-06-04 17:23:54,680 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:23:54,680 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:23:54,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:23:54,680 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:23:54,680 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:23:54,859 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:23:54,859 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 185 transitions, 2186 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:23:54,859 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:23:54,860 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:23:54,860 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:23:56,799 INFO  L124   PetriNetUnfolderBase]: 2729/4372 cut-off events.
[2024-06-04 17:23:56,800 INFO  L125   PetriNetUnfolderBase]: For 330868/330870 co-relation queries the response was YES.
[2024-06-04 17:23:56,816 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36564 conditions, 4372 events. 2729/4372 cut-off events. For 330868/330870 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 25384 event pairs, 708 based on Foata normal form. 16/4386 useless extension candidates. Maximal degree in co-relation 36485. Up to 3751 conditions per place. 
[2024-06-04 17:23:56,833 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 149 selfloop transitions, 61 changer transitions 0/218 dead transitions.
[2024-06-04 17:23:56,833 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 218 transitions, 2805 flow
[2024-06-04 17:23:56,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:23:56,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:23:56,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-04 17:23:56,835 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45219638242894056
[2024-06-04 17:23:56,835 INFO  L175             Difference]: Start difference. First operand has 173 places, 185 transitions, 2186 flow. Second operand 9 states and 175 transitions.
[2024-06-04 17:23:56,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 218 transitions, 2805 flow
[2024-06-04 17:23:57,138 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 218 transitions, 2694 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-06-04 17:23:57,140 INFO  L231             Difference]: Finished difference. Result has 175 places, 186 transitions, 2278 flow
[2024-06-04 17:23:57,141 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2075, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2278, PETRI_PLACES=175, PETRI_TRANSITIONS=186}
[2024-06-04 17:23:57,141 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 131 predicate places.
[2024-06-04 17:23:57,141 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 186 transitions, 2278 flow
[2024-06-04 17:23:57,141 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:23:57,141 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:23:57,142 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 17:23:57,142 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 17:23:57,142 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 17:23:57,142 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:23:57,142 INFO  L85        PathProgramCache]: Analyzing trace with hash -1667618179, now seen corresponding path program 13 times
[2024-06-04 17:23:57,142 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:23:57,142 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101925992]
[2024-06-04 17:23:57,143 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:23:57,143 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:23:57,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:24:07,843 INFO  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 17:24:07,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:24:07,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101925992]
[2024-06-04 17:24:07,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101925992] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:24:07,844 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:24:07,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:24:07,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024083994]
[2024-06-04 17:24:07,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:24:07,844 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:24:07,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:24:07,844 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:24:07,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:24:08,077 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:24:08,077 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 186 transitions, 2278 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:08,077 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:24:08,077 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:24:08,077 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:24:10,130 INFO  L124   PetriNetUnfolderBase]: 2770/4453 cut-off events.
[2024-06-04 17:24:10,130 INFO  L125   PetriNetUnfolderBase]: For 339852/339854 co-relation queries the response was YES.
[2024-06-04 17:24:10,146 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37422 conditions, 4453 events. 2770/4453 cut-off events. For 339852/339854 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26080 event pairs, 708 based on Foata normal form. 12/4463 useless extension candidates. Maximal degree in co-relation 37342. Up to 3755 conditions per place. 
[2024-06-04 17:24:10,162 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 133 selfloop transitions, 81 changer transitions 0/222 dead transitions.
[2024-06-04 17:24:10,162 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 222 transitions, 2937 flow
[2024-06-04 17:24:10,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:24:10,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:24:10,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-04 17:24:10,165 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573643410852713
[2024-06-04 17:24:10,165 INFO  L175             Difference]: Start difference. First operand has 175 places, 186 transitions, 2278 flow. Second operand 9 states and 177 transitions.
[2024-06-04 17:24:10,165 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 222 transitions, 2937 flow
[2024-06-04 17:24:10,483 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 222 transitions, 2787 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-04 17:24:10,486 INFO  L231             Difference]: Finished difference. Result has 177 places, 187 transitions, 2369 flow
[2024-06-04 17:24:10,486 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2369, PETRI_PLACES=177, PETRI_TRANSITIONS=187}
[2024-06-04 17:24:10,486 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 133 predicate places.
[2024-06-04 17:24:10,486 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 187 transitions, 2369 flow
[2024-06-04 17:24:10,487 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:10,487 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:24:10,487 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 17:24:10,487 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 17:24:10,487 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 17:24:10,487 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:24:10,487 INFO  L85        PathProgramCache]: Analyzing trace with hash -205180337, now seen corresponding path program 14 times
[2024-06-04 17:24:10,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:24:10,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241869493]
[2024-06-04 17:24:10,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:24:10,488 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:24:10,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:24:20,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:24:20,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:24:20,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241869493]
[2024-06-04 17:24:20,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241869493] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:24:20,846 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:24:20,846 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:24:20,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47418488]
[2024-06-04 17:24:20,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:24:20,846 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:24:20,846 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:24:20,847 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:24:20,847 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:24:21,188 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:24:21,188 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 187 transitions, 2369 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:21,188 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:24:21,189 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:24:21,189 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:24:23,154 INFO  L124   PetriNetUnfolderBase]: 2750/4421 cut-off events.
[2024-06-04 17:24:23,154 INFO  L125   PetriNetUnfolderBase]: For 336458/336460 co-relation queries the response was YES.
[2024-06-04 17:24:23,170 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36659 conditions, 4421 events. 2750/4421 cut-off events. For 336458/336460 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25784 event pairs, 679 based on Foata normal form. 12/4431 useless extension candidates. Maximal degree in co-relation 36578. Up to 3340 conditions per place. 
[2024-06-04 17:24:23,185 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 146 selfloop transitions, 68 changer transitions 0/222 dead transitions.
[2024-06-04 17:24:23,185 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 222 transitions, 2957 flow
[2024-06-04 17:24:23,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:24:23,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:24:23,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-04 17:24:23,188 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573643410852713
[2024-06-04 17:24:23,188 INFO  L175             Difference]: Start difference. First operand has 177 places, 187 transitions, 2369 flow. Second operand 9 states and 177 transitions.
[2024-06-04 17:24:23,188 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 222 transitions, 2957 flow
[2024-06-04 17:24:23,471 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 222 transitions, 2733 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-04 17:24:23,474 INFO  L231             Difference]: Finished difference. Result has 179 places, 187 transitions, 2289 flow
[2024-06-04 17:24:23,474 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2289, PETRI_PLACES=179, PETRI_TRANSITIONS=187}
[2024-06-04 17:24:23,474 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places.
[2024-06-04 17:24:23,474 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 187 transitions, 2289 flow
[2024-06-04 17:24:23,475 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:23,475 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:24:23,475 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 17:24:23,475 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 17:24:23,475 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:24:23,475 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:24:23,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 1067566263, now seen corresponding path program 2 times
[2024-06-04 17:24:23,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:24:23,476 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015625452]
[2024-06-04 17:24:23,476 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:24:23,476 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:24:23,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:24:39,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:24:39,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:24:39,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015625452]
[2024-06-04 17:24:39,520 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015625452] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:24:39,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:24:39,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:24:39,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445058940]
[2024-06-04 17:24:39,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:24:39,521 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:24:39,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:24:39,521 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:24:39,521 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:24:39,685 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-04 17:24:39,686 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 187 transitions, 2289 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:39,686 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:24:39,686 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-04 17:24:39,686 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:24:41,463 INFO  L124   PetriNetUnfolderBase]: 2861/4538 cut-off events.
[2024-06-04 17:24:41,464 INFO  L125   PetriNetUnfolderBase]: For 330859/330861 co-relation queries the response was YES.
[2024-06-04 17:24:41,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37253 conditions, 4538 events. 2861/4538 cut-off events. For 330859/330861 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 26074 event pairs, 811 based on Foata normal form. 2/4538 useless extension candidates. Maximal degree in co-relation 37171. Up to 4344 conditions per place. 
[2024-06-04 17:24:41,501 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 172 selfloop transitions, 28 changer transitions 0/204 dead transitions.
[2024-06-04 17:24:41,501 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 204 transitions, 2901 flow
[2024-06-04 17:24:41,501 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:24:41,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:24:41,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-04 17:24:41,502 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4119601328903654
[2024-06-04 17:24:41,502 INFO  L175             Difference]: Start difference. First operand has 179 places, 187 transitions, 2289 flow. Second operand 7 states and 124 transitions.
[2024-06-04 17:24:41,502 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 204 transitions, 2901 flow
[2024-06-04 17:24:41,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 204 transitions, 2700 flow, removed 14 selfloop flow, removed 8 redundant places.
[2024-06-04 17:24:41,806 INFO  L231             Difference]: Finished difference. Result has 178 places, 190 transitions, 2202 flow
[2024-06-04 17:24:41,806 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2202, PETRI_PLACES=178, PETRI_TRANSITIONS=190}
[2024-06-04 17:24:41,806 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 134 predicate places.
[2024-06-04 17:24:41,806 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 190 transitions, 2202 flow
[2024-06-04 17:24:41,806 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:41,806 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:24:41,806 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 17:24:41,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 17:24:41,806 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:24:41,807 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:24:41,807 INFO  L85        PathProgramCache]: Analyzing trace with hash -9546503, now seen corresponding path program 3 times
[2024-06-04 17:24:41,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:24:41,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438894379]
[2024-06-04 17:24:41,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:24:41,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:24:41,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:24:57,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 17:24:57,582 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:24:57,582 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438894379]
[2024-06-04 17:24:57,583 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438894379] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:24:57,583 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:24:57,583 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:24:57,583 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607852176]
[2024-06-04 17:24:57,583 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:24:57,583 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:24:57,583 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:24:57,583 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:24:57,584 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:24:57,724 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-04 17:24:57,725 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 190 transitions, 2202 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:57,725 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:24:57,725 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-04 17:24:57,725 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:24:59,540 INFO  L124   PetriNetUnfolderBase]: 2855/4530 cut-off events.
[2024-06-04 17:24:59,541 INFO  L125   PetriNetUnfolderBase]: For 333063/333065 co-relation queries the response was YES.
[2024-06-04 17:24:59,558 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36773 conditions, 4530 events. 2855/4530 cut-off events. For 333063/333065 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 26055 event pairs, 805 based on Foata normal form. 2/4530 useless extension candidates. Maximal degree in co-relation 36690. Up to 4339 conditions per place. 
[2024-06-04 17:24:59,575 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 170 selfloop transitions, 29 changer transitions 0/203 dead transitions.
[2024-06-04 17:24:59,575 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 203 transitions, 2660 flow
[2024-06-04 17:24:59,575 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:24:59,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:24:59,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-04 17:24:59,576 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4053156146179402
[2024-06-04 17:24:59,576 INFO  L175             Difference]: Start difference. First operand has 178 places, 190 transitions, 2202 flow. Second operand 7 states and 122 transitions.
[2024-06-04 17:24:59,576 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 203 transitions, 2660 flow
[2024-06-04 17:24:59,889 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 203 transitions, 2528 flow, removed 36 selfloop flow, removed 5 redundant places.
[2024-06-04 17:24:59,891 INFO  L231             Difference]: Finished difference. Result has 180 places, 190 transitions, 2134 flow
[2024-06-04 17:24:59,891 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2134, PETRI_PLACES=180, PETRI_TRANSITIONS=190}
[2024-06-04 17:24:59,892 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 136 predicate places.
[2024-06-04 17:24:59,892 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 190 transitions, 2134 flow
[2024-06-04 17:24:59,892 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:59,892 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:24:59,892 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 17:24:59,892 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 17:24:59,892 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 17:24:59,892 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:24:59,892 INFO  L85        PathProgramCache]: Analyzing trace with hash -187029377, now seen corresponding path program 1 times
[2024-06-04 17:24:59,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:24:59,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158644392]
[2024-06-04 17:24:59,893 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:24:59,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:24:59,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:25: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 17:25:12,283 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:25:12,283 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158644392]
[2024-06-04 17:25:12,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158644392] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:25:12,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:25:12,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:25:12,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935168867]
[2024-06-04 17:25:12,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:25:12,284 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:25:12,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:25:12,284 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:25:12,284 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:25:12,535 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:25:12,535 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 190 transitions, 2134 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:25:12,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:25:12,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:25:12,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:25:14,110 INFO  L124   PetriNetUnfolderBase]: 2553/4208 cut-off events.
[2024-06-04 17:25:14,110 INFO  L125   PetriNetUnfolderBase]: For 300839/300839 co-relation queries the response was YES.
[2024-06-04 17:25:14,128 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33475 conditions, 4208 events. 2553/4208 cut-off events. For 300839/300839 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25326 event pairs, 671 based on Foata normal form. 1/4208 useless extension candidates. Maximal degree in co-relation 33391. Up to 3905 conditions per place. 
[2024-06-04 17:25:14,144 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 179 selfloop transitions, 16 changer transitions 0/205 dead transitions.
[2024-06-04 17:25:14,144 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 205 transitions, 2598 flow
[2024-06-04 17:25:14,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:25:14,144 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:25:14,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-04 17:25:14,144 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45348837209302323
[2024-06-04 17:25:14,144 INFO  L175             Difference]: Start difference. First operand has 180 places, 190 transitions, 2134 flow. Second operand 6 states and 117 transitions.
[2024-06-04 17:25:14,145 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 205 transitions, 2598 flow
[2024-06-04 17:25:14,446 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 205 transitions, 2532 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-04 17:25:14,448 INFO  L231             Difference]: Finished difference. Result has 180 places, 193 transitions, 2160 flow
[2024-06-04 17:25:14,448 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2160, PETRI_PLACES=180, PETRI_TRANSITIONS=193}
[2024-06-04 17:25:14,448 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 136 predicate places.
[2024-06-04 17:25:14,448 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 193 transitions, 2160 flow
[2024-06-04 17:25:14,448 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:25:14,449 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:25:14,449 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 17:25:14,449 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 17:25:14,449 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 17:25:14,449 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:25:14,449 INFO  L85        PathProgramCache]: Analyzing trace with hash -162031079, now seen corresponding path program 2 times
[2024-06-04 17:25:14,449 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:25:14,449 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184244722]
[2024-06-04 17:25:14,449 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:25:14,449 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:25:14,486 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:25:26,781 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:25:26,781 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:25:26,781 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184244722]
[2024-06-04 17:25:26,781 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184244722] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:25:26,781 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:25:26,781 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:25:26,781 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399900476]
[2024-06-04 17:25:26,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:25:26,782 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:25:26,782 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:25:26,782 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:25:26,782 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:25:26,980 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:25:26,981 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 193 transitions, 2160 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:25:26,981 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:25:26,981 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:25:26,981 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:25:28,486 INFO  L124   PetriNetUnfolderBase]: 2558/4215 cut-off events.
[2024-06-04 17:25:28,486 INFO  L125   PetriNetUnfolderBase]: For 309881/309881 co-relation queries the response was YES.
[2024-06-04 17:25:28,504 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33931 conditions, 4215 events. 2558/4215 cut-off events. For 309881/309881 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25341 event pairs, 672 based on Foata normal form. 1/4215 useless extension candidates. Maximal degree in co-relation 33846. Up to 3899 conditions per place. 
[2024-06-04 17:25:28,521 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 177 selfloop transitions, 26 changer transitions 0/213 dead transitions.
[2024-06-04 17:25:28,521 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 213 transitions, 2804 flow
[2024-06-04 17:25:28,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:25:28,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:25:28,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-04 17:25:28,521 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4485049833887043
[2024-06-04 17:25:28,522 INFO  L175             Difference]: Start difference. First operand has 180 places, 193 transitions, 2160 flow. Second operand 7 states and 135 transitions.
[2024-06-04 17:25:28,522 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 213 transitions, 2804 flow
[2024-06-04 17:25:28,832 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 213 transitions, 2738 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-04 17:25:28,835 INFO  L231             Difference]: Finished difference. Result has 182 places, 199 transitions, 2260 flow
[2024-06-04 17:25:28,835 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2260, PETRI_PLACES=182, PETRI_TRANSITIONS=199}
[2024-06-04 17:25:28,835 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 138 predicate places.
[2024-06-04 17:25:28,835 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 199 transitions, 2260 flow
[2024-06-04 17:25:28,835 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:25:28,835 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:25:28,835 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 17:25:28,836 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 17:25:28,836 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:25:28,836 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:25:28,836 INFO  L85        PathProgramCache]: Analyzing trace with hash -162030893, now seen corresponding path program 1 times
[2024-06-04 17:25:28,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:25:28,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665031431]
[2024-06-04 17:25:28,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:25:28,837 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:25:28,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:25:41,621 INFO  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 17:25:41,621 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:25:41,621 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665031431]
[2024-06-04 17:25:41,621 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665031431] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:25:41,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:25:41,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:25:41,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084773850]
[2024-06-04 17:25:41,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:25:41,622 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:25:41,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:25:41,622 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:25:41,622 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:25:41,766 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:25:41,766 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 199 transitions, 2260 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:25:41,766 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:25:41,766 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:25:41,766 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:25:43,290 INFO  L124   PetriNetUnfolderBase]: 2666/4325 cut-off events.
[2024-06-04 17:25:43,290 INFO  L125   PetriNetUnfolderBase]: For 311158/311158 co-relation queries the response was YES.
[2024-06-04 17:25:43,307 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34835 conditions, 4325 events. 2666/4325 cut-off events. For 311158/311158 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25471 event pairs, 718 based on Foata normal form. 1/4325 useless extension candidates. Maximal degree in co-relation 34750. Up to 4109 conditions per place. 
[2024-06-04 17:25:43,323 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 191 selfloop transitions, 23 changer transitions 0/219 dead transitions.
[2024-06-04 17:25:43,323 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 219 transitions, 2902 flow
[2024-06-04 17:25:43,323 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:25:43,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:25:43,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-04 17:25:43,324 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 17:25:43,324 INFO  L175             Difference]: Start difference. First operand has 182 places, 199 transitions, 2260 flow. Second operand 7 states and 129 transitions.
[2024-06-04 17:25:43,324 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 219 transitions, 2902 flow
[2024-06-04 17:25:43,633 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 219 transitions, 2840 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-04 17:25:43,635 INFO  L231             Difference]: Finished difference. Result has 186 places, 205 transitions, 2332 flow
[2024-06-04 17:25:43,635 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2198, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2332, PETRI_PLACES=186, PETRI_TRANSITIONS=205}
[2024-06-04 17:25:43,636 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 142 predicate places.
[2024-06-04 17:25:43,636 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 205 transitions, 2332 flow
[2024-06-04 17:25:43,636 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:25:43,636 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:25:43,636 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 17:25:43,636 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 17:25:43,636 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:25:43,636 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:25:43,636 INFO  L85        PathProgramCache]: Analyzing trace with hash 97119447, now seen corresponding path program 2 times
[2024-06-04 17:25:43,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:25:43,637 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824653897]
[2024-06-04 17:25:43,637 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:25:43,637 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:25:43,674 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:25:55,106 INFO  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 17:25:55,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:25:55,107 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824653897]
[2024-06-04 17:25:55,107 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824653897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:25:55,107 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:25:55,107 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:25:55,107 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071569523]
[2024-06-04 17:25:55,107 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:25:55,107 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:25:55,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:25:55,108 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:25:55,108 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:25:55,241 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:25:55,241 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 205 transitions, 2332 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:25:55,241 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:25:55,241 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:25:55,241 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:25:56,826 INFO  L124   PetriNetUnfolderBase]: 2671/4332 cut-off events.
[2024-06-04 17:25:56,826 INFO  L125   PetriNetUnfolderBase]: For 321847/321847 co-relation queries the response was YES.
[2024-06-04 17:25:56,845 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35386 conditions, 4332 events. 2671/4332 cut-off events. For 321847/321847 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25495 event pairs, 711 based on Foata normal form. 1/4332 useless extension candidates. Maximal degree in co-relation 35299. Up to 4137 conditions per place. 
[2024-06-04 17:25:56,861 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 199 selfloop transitions, 14 changer transitions 0/218 dead transitions.
[2024-06-04 17:25:56,862 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 218 transitions, 2826 flow
[2024-06-04 17:25:56,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:25:56,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:25:56,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-04 17:25:56,862 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4019933554817276
[2024-06-04 17:25:56,862 INFO  L175             Difference]: Start difference. First operand has 186 places, 205 transitions, 2332 flow. Second operand 7 states and 121 transitions.
[2024-06-04 17:25:56,862 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 218 transitions, 2826 flow
[2024-06-04 17:25:57,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 218 transitions, 2764 flow, removed 24 selfloop flow, removed 3 redundant places.
[2024-06-04 17:25:57,225 INFO  L231             Difference]: Finished difference. Result has 190 places, 208 transitions, 2354 flow
[2024-06-04 17:25:57,225 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2278, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2354, PETRI_PLACES=190, PETRI_TRANSITIONS=208}
[2024-06-04 17:25:57,225 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 146 predicate places.
[2024-06-04 17:25:57,225 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 208 transitions, 2354 flow
[2024-06-04 17:25:57,225 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:25:57,225 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:25:57,225 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 17:25:57,226 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 17:25:57,226 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:25:57,226 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:25:57,226 INFO  L85        PathProgramCache]: Analyzing trace with hash -9777701, now seen corresponding path program 3 times
[2024-06-04 17:25:57,226 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:25:57,226 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904952218]
[2024-06-04 17:25:57,226 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:25:57,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:25:57,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:26:09,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:26:09,015 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:26:09,015 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904952218]
[2024-06-04 17:26:09,015 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904952218] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:26:09,015 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:26:09,015 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:26:09,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148530904]
[2024-06-04 17:26:09,015 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:26:09,015 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:26:09,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:26:09,016 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:26:09,016 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:26:09,215 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:26:09,215 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 208 transitions, 2354 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:09,215 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:26:09,215 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:26:09,215 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:26:10,728 INFO  L124   PetriNetUnfolderBase]: 2668/4328 cut-off events.
[2024-06-04 17:26:10,728 INFO  L125   PetriNetUnfolderBase]: For 329930/329930 co-relation queries the response was YES.
[2024-06-04 17:26:10,748 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35485 conditions, 4328 events. 2668/4328 cut-off events. For 329930/329930 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25488 event pairs, 711 based on Foata normal form. 1/4328 useless extension candidates. Maximal degree in co-relation 35396. Up to 4127 conditions per place. 
[2024-06-04 17:26:10,766 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 194 selfloop transitions, 19 changer transitions 0/218 dead transitions.
[2024-06-04 17:26:10,766 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 218 transitions, 2804 flow
[2024-06-04 17:26:10,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:26:10,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:26:10,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-04 17:26:10,767 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40863787375415284
[2024-06-04 17:26:10,767 INFO  L175             Difference]: Start difference. First operand has 190 places, 208 transitions, 2354 flow. Second operand 7 states and 123 transitions.
[2024-06-04 17:26:10,767 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 218 transitions, 2804 flow
[2024-06-04 17:26:11,125 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 218 transitions, 2740 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-04 17:26:11,128 INFO  L231             Difference]: Finished difference. Result has 192 places, 208 transitions, 2334 flow
[2024-06-04 17:26:11,128 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2334, PETRI_PLACES=192, PETRI_TRANSITIONS=208}
[2024-06-04 17:26:11,128 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 148 predicate places.
[2024-06-04 17:26:11,128 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 208 transitions, 2334 flow
[2024-06-04 17:26:11,128 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:11,128 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:26:11,128 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 17:26:11,128 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 17:26:11,129 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:26:11,129 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:26:11,129 INFO  L85        PathProgramCache]: Analyzing trace with hash -157389449, now seen corresponding path program 3 times
[2024-06-04 17:26:11,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:26:11,129 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118160042]
[2024-06-04 17:26:11,129 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:26:11,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:26:11,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:26:23,233 INFO  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 17:26:23,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:26:23,234 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118160042]
[2024-06-04 17:26:23,234 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118160042] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:26:23,234 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:26:23,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:26:23,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503558097]
[2024-06-04 17:26:23,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:26:23,235 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:26:23,235 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:26:23,235 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:26:23,235 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:26:23,413 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:26:23,413 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 208 transitions, 2334 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:23,413 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:26:23,413 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:26:23,413 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:26:25,023 INFO  L124   PetriNetUnfolderBase]: 2572/4231 cut-off events.
[2024-06-04 17:26:25,024 INFO  L125   PetriNetUnfolderBase]: For 338511/338511 co-relation queries the response was YES.
[2024-06-04 17:26:25,042 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34993 conditions, 4231 events. 2572/4231 cut-off events. For 338511/338511 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25389 event pairs, 678 based on Foata normal form. 1/4231 useless extension candidates. Maximal degree in co-relation 34903. Up to 3940 conditions per place. 
[2024-06-04 17:26:25,059 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 191 selfloop transitions, 14 changer transitions 0/218 dead transitions.
[2024-06-04 17:26:25,059 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 218 transitions, 2768 flow
[2024-06-04 17:26:25,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:26:25,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:26:25,060 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-04 17:26:25,060 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4219269102990033
[2024-06-04 17:26:25,060 INFO  L175             Difference]: Start difference. First operand has 192 places, 208 transitions, 2334 flow. Second operand 7 states and 127 transitions.
[2024-06-04 17:26:25,060 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 218 transitions, 2768 flow
[2024-06-04 17:26:25,387 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 218 transitions, 2672 flow, removed 24 selfloop flow, removed 6 redundant places.
[2024-06-04 17:26:25,390 INFO  L231             Difference]: Finished difference. Result has 193 places, 208 transitions, 2272 flow
[2024-06-04 17:26:25,390 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2238, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2272, PETRI_PLACES=193, PETRI_TRANSITIONS=208}
[2024-06-04 17:26:25,390 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 149 predicate places.
[2024-06-04 17:26:25,390 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 208 transitions, 2272 flow
[2024-06-04 17:26:25,390 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:25,391 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:26:25,391 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 17:26:25,391 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 17:26:25,391 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 17:26:25,391 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:26:25,391 INFO  L85        PathProgramCache]: Analyzing trace with hash 499386766, now seen corresponding path program 1 times
[2024-06-04 17:26:25,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:26:25,391 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068814294]
[2024-06-04 17:26:25,391 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:26:25,391 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:26:25,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:26:36,819 INFO  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 17:26:36,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:26:36,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068814294]
[2024-06-04 17:26:36,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068814294] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:26:36,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:26:36,819 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:26:36,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37274481]
[2024-06-04 17:26:36,819 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:26:36,819 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:26:36,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:26:36,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:26:36,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:26:37,190 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:26:37,190 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 208 transitions, 2272 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:37,190 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:26:37,190 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:26:37,190 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:26:39,333 INFO  L124   PetriNetUnfolderBase]: 2850/4562 cut-off events.
[2024-06-04 17:26:39,333 INFO  L125   PetriNetUnfolderBase]: For 420808/420808 co-relation queries the response was YES.
[2024-06-04 17:26:39,352 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39294 conditions, 4562 events. 2850/4562 cut-off events. For 420808/420808 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 26545 event pairs, 666 based on Foata normal form. 12/4567 useless extension candidates. Maximal degree in co-relation 39203. Up to 4183 conditions per place. 
[2024-06-04 17:26:39,367 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 224 selfloop transitions, 18 changer transitions 0/254 dead transitions.
[2024-06-04 17:26:39,368 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 254 transitions, 2964 flow
[2024-06-04 17:26:39,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:26:39,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:26:39,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-04 17:26:39,370 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43953488372093025
[2024-06-04 17:26:39,370 INFO  L175             Difference]: Start difference. First operand has 193 places, 208 transitions, 2272 flow. Second operand 10 states and 189 transitions.
[2024-06-04 17:26:39,370 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 254 transitions, 2964 flow
[2024-06-04 17:26:39,725 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 254 transitions, 2920 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-04 17:26:39,727 INFO  L231             Difference]: Finished difference. Result has 198 places, 211 transitions, 2359 flow
[2024-06-04 17:26:39,728 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2359, PETRI_PLACES=198, PETRI_TRANSITIONS=211}
[2024-06-04 17:26:39,728 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 154 predicate places.
[2024-06-04 17:26:39,728 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 211 transitions, 2359 flow
[2024-06-04 17:26:39,728 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:39,728 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:26:39,728 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 17:26:39,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 17:26:39,728 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:26:39,729 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:26:39,729 INFO  L85        PathProgramCache]: Analyzing trace with hash -1045458000, now seen corresponding path program 2 times
[2024-06-04 17:26:39,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:26:39,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095284717]
[2024-06-04 17:26:39,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:26:39,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:26:39,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:26:52,501 INFO  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 17:26:52,501 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:26:52,501 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095284717]
[2024-06-04 17:26:52,501 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095284717] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:26:52,501 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:26:52,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:26:52,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382552491]
[2024-06-04 17:26:52,501 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:26:52,502 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:26:52,502 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:26:52,502 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:26:52,502 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:26:52,844 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:26:52,844 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 211 transitions, 2359 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:52,844 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:26:52,844 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:26:52,845 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:26:54,784 INFO  L124   PetriNetUnfolderBase]: 2830/4524 cut-off events.
[2024-06-04 17:26:54,785 INFO  L125   PetriNetUnfolderBase]: For 418082/418082 co-relation queries the response was YES.
[2024-06-04 17:26:54,805 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38840 conditions, 4524 events. 2830/4524 cut-off events. For 418082/418082 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 26451 event pairs, 795 based on Foata normal form. 12/4520 useless extension candidates. Maximal degree in co-relation 38747. Up to 4163 conditions per place. 
[2024-06-04 17:26:54,822 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 221 selfloop transitions, 17 changer transitions 0/250 dead transitions.
[2024-06-04 17:26:54,822 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 250 transitions, 2975 flow
[2024-06-04 17:26:54,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:26:54,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:26:54,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-04 17:26:54,825 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4496124031007752
[2024-06-04 17:26:54,825 INFO  L175             Difference]: Start difference. First operand has 198 places, 211 transitions, 2359 flow. Second operand 9 states and 174 transitions.
[2024-06-04 17:26:54,825 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 250 transitions, 2975 flow
[2024-06-04 17:26:55,238 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 250 transitions, 2889 flow, removed 27 selfloop flow, removed 7 redundant places.
[2024-06-04 17:26:55,241 INFO  L231             Difference]: Finished difference. Result has 200 places, 211 transitions, 2313 flow
[2024-06-04 17:26:55,241 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2313, PETRI_PLACES=200, PETRI_TRANSITIONS=211}
[2024-06-04 17:26:55,241 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 156 predicate places.
[2024-06-04 17:26:55,241 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 211 transitions, 2313 flow
[2024-06-04 17:26:55,242 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:55,242 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:26:55,242 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 17:26:55,242 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-04 17:26:55,242 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:26:55,243 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:26:55,243 INFO  L85        PathProgramCache]: Analyzing trace with hash -1924377296, now seen corresponding path program 3 times
[2024-06-04 17:26:55,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:26:55,243 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641275997]
[2024-06-04 17:26:55,243 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:26:55,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:26:55,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:27:08,362 INFO  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 17:27:08,363 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:27:08,363 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641275997]
[2024-06-04 17:27:08,363 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641275997] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:27:08,363 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:27:08,363 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:27:08,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767645772]
[2024-06-04 17:27:08,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:27:08,363 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:27:08,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:27:08,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:27:08,363 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:27:08,638 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-04 17:27:08,638 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 211 transitions, 2313 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:27:08,638 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:27:08,638 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-04 17:27:08,638 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:27:10,710 INFO  L124   PetriNetUnfolderBase]: 2888/4628 cut-off events.
[2024-06-04 17:27:10,710 INFO  L125   PetriNetUnfolderBase]: For 434835/434835 co-relation queries the response was YES.
[2024-06-04 17:27:10,733 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39484 conditions, 4628 events. 2888/4628 cut-off events. For 434835/434835 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 27161 event pairs, 750 based on Foata normal form. 12/4633 useless extension candidates. Maximal degree in co-relation 39390. Up to 4231 conditions per place. 
[2024-06-04 17:27:10,752 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 220 selfloop transitions, 23 changer transitions 0/255 dead transitions.
[2024-06-04 17:27:10,752 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 255 transitions, 3015 flow
[2024-06-04 17:27:10,754 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:27:10,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:27:10,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions.
[2024-06-04 17:27:10,754 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41627906976744183
[2024-06-04 17:27:10,754 INFO  L175             Difference]: Start difference. First operand has 200 places, 211 transitions, 2313 flow. Second operand 10 states and 179 transitions.
[2024-06-04 17:27:10,755 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 255 transitions, 3015 flow
[2024-06-04 17:27:11,274 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 255 transitions, 2885 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-04 17:27:11,276 INFO  L231             Difference]: Finished difference. Result has 203 places, 215 transitions, 2330 flow
[2024-06-04 17:27:11,277 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2330, PETRI_PLACES=203, PETRI_TRANSITIONS=215}
[2024-06-04 17:27:11,277 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 159 predicate places.
[2024-06-04 17:27:11,277 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 215 transitions, 2330 flow
[2024-06-04 17:27:11,277 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:27:11,277 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:27:11,277 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 17:27:11,277 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-04 17:27:11,277 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:27:11,277 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:27:11,278 INFO  L85        PathProgramCache]: Analyzing trace with hash 25419362, now seen corresponding path program 4 times
[2024-06-04 17:27:11,278 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:27:11,278 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395008167]
[2024-06-04 17:27:11,278 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:27:11,278 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:27:11,348 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:27:22,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 17:27:22,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:27:22,565 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395008167]
[2024-06-04 17:27:22,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395008167] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:27:22,565 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:27:22,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:27:22,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813948599]
[2024-06-04 17:27:22,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:27:22,566 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:27:22,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:27:22,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:27:22,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:27:22,945 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:27:22,945 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 215 transitions, 2330 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:27:22,945 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:27:22,945 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:27:22,945 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:27:25,034 INFO  L124   PetriNetUnfolderBase]: 2929/4699 cut-off events.
[2024-06-04 17:27:25,034 INFO  L125   PetriNetUnfolderBase]: For 449030/449030 co-relation queries the response was YES.
[2024-06-04 17:27:25,058 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39973 conditions, 4699 events. 2929/4699 cut-off events. For 449030/449030 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 27719 event pairs, 760 based on Foata normal form. 12/4704 useless extension candidates. Maximal degree in co-relation 39878. Up to 4233 conditions per place. 
[2024-06-04 17:27:25,078 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 216 selfloop transitions, 23 changer transitions 0/251 dead transitions.
[2024-06-04 17:27:25,078 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 251 transitions, 2992 flow
[2024-06-04 17:27:25,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:27:25,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:27:25,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-04 17:27:25,081 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-04 17:27:25,081 INFO  L175             Difference]: Start difference. First operand has 203 places, 215 transitions, 2330 flow. Second operand 9 states and 172 transitions.
[2024-06-04 17:27:25,081 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 251 transitions, 2992 flow
[2024-06-04 17:27:25,502 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 251 transitions, 2890 flow, removed 30 selfloop flow, removed 7 redundant places.
[2024-06-04 17:27:25,505 INFO  L231             Difference]: Finished difference. Result has 205 places, 216 transitions, 2348 flow
[2024-06-04 17:27:25,505 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2348, PETRI_PLACES=205, PETRI_TRANSITIONS=216}
[2024-06-04 17:27:25,505 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 161 predicate places.
[2024-06-04 17:27:25,505 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 216 transitions, 2348 flow
[2024-06-04 17:27:25,506 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:27:25,506 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:27:25,506 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 17:27:25,506 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-04 17:27:25,506 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 17:27:25,506 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:27:25,506 INFO  L85        PathProgramCache]: Analyzing trace with hash -938732026, now seen corresponding path program 1 times
[2024-06-04 17:27:25,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:27:25,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745160449]
[2024-06-04 17:27:25,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:27:25,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:27:25,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:27:37,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:27:37,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:27:37,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745160449]
[2024-06-04 17:27:37,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745160449] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:27:37,470 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:27:37,470 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:27:37,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307901737]
[2024-06-04 17:27:37,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:27:37,470 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:27:37,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:27:37,471 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:27:37,471 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:27:37,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:27:37,624 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 216 transitions, 2348 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:27:37,624 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:27:37,624 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:27:37,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:27:39,359 INFO  L124   PetriNetUnfolderBase]: 2955/4737 cut-off events.
[2024-06-04 17:27:39,360 INFO  L125   PetriNetUnfolderBase]: For 425643/425643 co-relation queries the response was YES.
[2024-06-04 17:27:39,382 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39917 conditions, 4737 events. 2955/4737 cut-off events. For 425643/425643 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 27941 event pairs, 789 based on Foata normal form. 2/4732 useless extension candidates. Maximal degree in co-relation 39821. Up to 4470 conditions per place. 
[2024-06-04 17:27:39,398 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 217 selfloop transitions, 24 changer transitions 0/253 dead transitions.
[2024-06-04 17:27:39,399 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 253 transitions, 3203 flow
[2024-06-04 17:27:39,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:27:39,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:27:39,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-04 17:27:39,400 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45182724252491696
[2024-06-04 17:27:39,400 INFO  L175             Difference]: Start difference. First operand has 205 places, 216 transitions, 2348 flow. Second operand 7 states and 136 transitions.
[2024-06-04 17:27:39,400 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 253 transitions, 3203 flow
[2024-06-04 17:27:39,836 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 253 transitions, 3105 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-04 17:27:39,839 INFO  L231             Difference]: Finished difference. Result has 207 places, 230 transitions, 2526 flow
[2024-06-04 17:27:39,839 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2526, PETRI_PLACES=207, PETRI_TRANSITIONS=230}
[2024-06-04 17:27:39,839 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 163 predicate places.
[2024-06-04 17:27:39,840 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 230 transitions, 2526 flow
[2024-06-04 17:27:39,840 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:27:39,840 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:27:39,840 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 17:27:39,840 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-04 17:27:39,840 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 17:27:39,840 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:27:39,840 INFO  L85        PathProgramCache]: Analyzing trace with hash -1459320758, now seen corresponding path program 2 times
[2024-06-04 17:27:39,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:27:39,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919654480]
[2024-06-04 17:27:39,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:27:39,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:27:39,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15