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


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix032.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix032.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-04 17:11:17,976 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 17:11:18,052 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 17:11:18,057 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 17:11:18,057 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 17:11:18,084 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 17:11:18,085 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 17:11:18,085 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 17:11:18,102 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 17:11:18,105 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 17:11:18,105 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 17:11:18,105 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 17:11:18,106 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 17:11:18,107 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 17:11:18,107 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 17:11:18,107 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 17:11:18,107 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 17:11:18,108 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 17:11:18,108 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 17:11:18,108 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 17:11:18,108 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 17:11:18,109 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 17:11:18,109 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 17:11:18,109 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 17:11:18,109 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 17:11:18,109 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 17:11:18,109 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 17:11:18,110 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 17:11:18,110 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 17:11:18,110 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 17:11:18,111 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 17:11:18,111 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 17:11:18,111 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 17:11:18,111 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 17:11:18,112 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 17:11:18,112 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 17:11:18,112 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 17:11:18,112 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 17:11:18,112 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 17:11:18,113 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 17:11:18,113 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 17:11:18,113 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 17:11:18,113 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 17:11:18,113 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:11:18,322 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 17:11:18,347 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 17:11:18,349 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 17:11:18,350 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 17:11:18,354 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 17:11:18,355 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/mix032.oepc.yml/witness.yml
[2024-06-04 17:11:18,579 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 17:11:18,581 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 17:11:18,582 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.oepc.i
[2024-06-04 17:11:19,576 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 17:11:19,801 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 17:11:19,803 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.oepc.i
[2024-06-04 17:11:19,815 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1001056/3af2ebdd4df54ada998636c0469e1639/FLAGed81782c0
[2024-06-04 17:11:19,831 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1001056/3af2ebdd4df54ada998636c0469e1639
[2024-06-04 17:11:19,832 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 17:11:19,833 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 17:11:19,836 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 17:11:19,836 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 17:11:19,840 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 17:11:19,840 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:11:18" (1/2) ...
[2024-06-04 17:11:19,841 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621f3f92 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:19, skipping insertion in model container
[2024-06-04 17:11:19,841 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:11:18" (1/2) ...
[2024-06-04 17:11:19,843 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3dca2b6f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:19, skipping insertion in model container
[2024-06-04 17:11:19,843 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:11:19" (2/2) ...
[2024-06-04 17:11:19,843 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621f3f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:19, skipping insertion in model container
[2024-06-04 17:11:19,843 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:11:19" (2/2) ...
[2024-06-04 17:11:19,844 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 17:11:19,932 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 17:11:19,933 INFO  L97    edCorrectnessWitness]: Location invariant before [L861-L861] (((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )b$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff1) + (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_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 0LL) && (long long )__unbuffered_cnt + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )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_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )b$flush_delayed >= 0LL) && (long long )a + (long long )b$mem_tmp >= 0LL) && (long long )a + (long long )b$r_buff0_thd0 >= 0LL) && (long long )a + (long long )b$r_buff0_thd2 >= 0LL) && (long long )a + (long long )b$r_buff0_thd3 >= 0LL) && (long long )a + (long long )b$r_buff1_thd0 >= 0LL) && (long long )a + (long long )b$r_buff1_thd2 >= 0LL) && (long long )a + (long long )b$r_buff1_thd3 >= 0LL) && (long long )a + (long long )b$read_delayed >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )b$flush_delayed >= 0LL) && (long long )b + (long long )b$mem_tmp >= 0LL) && (long long )b + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b + (long long )b$read_delayed >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff1 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )b$flush_delayed + (long long )b$mem_tmp >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$flush_delayed + (long long )x >= 0LL) && (long long )b$flush_delayed + (long long )y >= 0LL) && (long long )b$flush_delayed + (long long )z >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff1 >= 0LL) && (long long )b$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )b$mem_tmp + (long long )x >= 0LL) && (long long )b$mem_tmp + (long long )y >= 0LL) && (long long )b$mem_tmp + (long long )z >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )x >= 0LL) && (long long )b$r_buff0_thd0 + (long long )y >= 0LL) && (long long )b$r_buff0_thd0 + (long long )z >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )x >= 0LL) && (long long )b$r_buff0_thd2 + (long long )y >= 0LL) && (long long )b$r_buff0_thd2 + (long long )z >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )x >= 0LL) && (long long )b$r_buff0_thd3 + (long long )y >= 0LL) && (long long )b$r_buff0_thd3 + (long long )z >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )x >= 0LL) && (long long )b$r_buff1_thd0 + (long long )y >= 0LL) && (long long )b$r_buff1_thd0 + (long long )z >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )x >= 0LL) && (long long )b$r_buff1_thd2 + (long long )y >= 0LL) && (long long )b$r_buff1_thd2 + (long long )z >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )x >= 0LL) && (long long )b$r_buff1_thd3 + (long long )y >= 0LL) && (long long )b$r_buff1_thd3 + (long long )z >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$read_delayed + (long long )x >= 0LL) && (long long )b$read_delayed + (long long )y >= 0LL) && (long long )b$read_delayed + (long long )z >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff1 + (long long )x >= 0LL) && (long long )b$w_buff1 + (long long )y >= 0LL) && (long long )b$w_buff1 + (long long )z >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$w_buff0) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$read_delayed >= 0LL) && (long long )a - (long long )b$r_buff0_thd0 >= 0LL) && (long long )a - (long long )b$r_buff0_thd2 >= 0LL) && (long long )a - (long long )b$r_buff0_thd3 >= 0LL) && (long long )a - (long long )b$r_buff1_thd0 >= 0LL) && (long long )a - (long long )b$r_buff1_thd2 >= 0LL) && (long long )a - (long long )b$r_buff1_thd3 >= 0LL) && (long long )a - (long long )b$read_delayed >= 0LL) && (long long )b - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b - (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= b$mem_tmp) && 0 <= b$w_buff0) && 0 <= b$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && b$mem_tmp <= 1) && b$w_buff0 <= 1) && b$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! 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 || ((0 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)
[2024-06-04 17:11:19,934 INFO  L97    edCorrectnessWitness]: Location invariant before [L860-L860] (((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )b$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff1) + (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_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 0LL) && (long long )__unbuffered_cnt + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )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_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )b$flush_delayed >= 0LL) && (long long )a + (long long )b$mem_tmp >= 0LL) && (long long )a + (long long )b$r_buff0_thd0 >= 0LL) && (long long )a + (long long )b$r_buff0_thd2 >= 0LL) && (long long )a + (long long )b$r_buff0_thd3 >= 0LL) && (long long )a + (long long )b$r_buff1_thd0 >= 0LL) && (long long )a + (long long )b$r_buff1_thd2 >= 0LL) && (long long )a + (long long )b$r_buff1_thd3 >= 0LL) && (long long )a + (long long )b$read_delayed >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )b$flush_delayed >= 0LL) && (long long )b + (long long )b$mem_tmp >= 0LL) && (long long )b + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b + (long long )b$read_delayed >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff1 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )b$flush_delayed + (long long )b$mem_tmp >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$flush_delayed + (long long )x >= 0LL) && (long long )b$flush_delayed + (long long )y >= 0LL) && (long long )b$flush_delayed + (long long )z >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff1 >= 0LL) && (long long )b$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )b$mem_tmp + (long long )x >= 0LL) && (long long )b$mem_tmp + (long long )y >= 0LL) && (long long )b$mem_tmp + (long long )z >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )x >= 0LL) && (long long )b$r_buff0_thd0 + (long long )y >= 0LL) && (long long )b$r_buff0_thd0 + (long long )z >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )x >= 0LL) && (long long )b$r_buff0_thd2 + (long long )y >= 0LL) && (long long )b$r_buff0_thd2 + (long long )z >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )x >= 0LL) && (long long )b$r_buff0_thd3 + (long long )y >= 0LL) && (long long )b$r_buff0_thd3 + (long long )z >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )x >= 0LL) && (long long )b$r_buff1_thd0 + (long long )y >= 0LL) && (long long )b$r_buff1_thd0 + (long long )z >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )x >= 0LL) && (long long )b$r_buff1_thd2 + (long long )y >= 0LL) && (long long )b$r_buff1_thd2 + (long long )z >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )x >= 0LL) && (long long )b$r_buff1_thd3 + (long long )y >= 0LL) && (long long )b$r_buff1_thd3 + (long long )z >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$read_delayed + (long long )x >= 0LL) && (long long )b$read_delayed + (long long )y >= 0LL) && (long long )b$read_delayed + (long long )z >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff1 + (long long )x >= 0LL) && (long long )b$w_buff1 + (long long )y >= 0LL) && (long long )b$w_buff1 + (long long )z >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$w_buff0) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$read_delayed >= 0LL) && (long long )a - (long long )b$r_buff0_thd0 >= 0LL) && (long long )a - (long long )b$r_buff0_thd2 >= 0LL) && (long long )a - (long long )b$r_buff0_thd3 >= 0LL) && (long long )a - (long long )b$r_buff1_thd0 >= 0LL) && (long long )a - (long long )b$r_buff1_thd2 >= 0LL) && (long long )a - (long long )b$r_buff1_thd3 >= 0LL) && (long long )a - (long long )b$read_delayed >= 0LL) && (long long )b - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b - (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= b$mem_tmp) && 0 <= b$w_buff0) && 0 <= b$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && b$mem_tmp <= 1) && b$w_buff0 <= 1) && b$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! 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 || ((0 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)
[2024-06-04 17:11:19,935 INFO  L97    edCorrectnessWitness]: Location invariant before [L858-L858] (((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )b$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff1) + (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_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 0LL) && (long long )__unbuffered_cnt + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )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_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )b$flush_delayed >= 0LL) && (long long )a + (long long )b$mem_tmp >= 0LL) && (long long )a + (long long )b$r_buff0_thd0 >= 0LL) && (long long )a + (long long )b$r_buff0_thd2 >= 0LL) && (long long )a + (long long )b$r_buff0_thd3 >= 0LL) && (long long )a + (long long )b$r_buff1_thd0 >= 0LL) && (long long )a + (long long )b$r_buff1_thd2 >= 0LL) && (long long )a + (long long )b$r_buff1_thd3 >= 0LL) && (long long )a + (long long )b$read_delayed >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )b$flush_delayed >= 0LL) && (long long )b + (long long )b$mem_tmp >= 0LL) && (long long )b + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b + (long long )b$read_delayed >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff1 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )b$flush_delayed + (long long )b$mem_tmp >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$flush_delayed + (long long )x >= 0LL) && (long long )b$flush_delayed + (long long )y >= 0LL) && (long long )b$flush_delayed + (long long )z >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff1 >= 0LL) && (long long )b$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )b$mem_tmp + (long long )x >= 0LL) && (long long )b$mem_tmp + (long long )y >= 0LL) && (long long )b$mem_tmp + (long long )z >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )x >= 0LL) && (long long )b$r_buff0_thd0 + (long long )y >= 0LL) && (long long )b$r_buff0_thd0 + (long long )z >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )x >= 0LL) && (long long )b$r_buff0_thd2 + (long long )y >= 0LL) && (long long )b$r_buff0_thd2 + (long long )z >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )x >= 0LL) && (long long )b$r_buff0_thd3 + (long long )y >= 0LL) && (long long )b$r_buff0_thd3 + (long long )z >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )x >= 0LL) && (long long )b$r_buff1_thd0 + (long long )y >= 0LL) && (long long )b$r_buff1_thd0 + (long long )z >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )x >= 0LL) && (long long )b$r_buff1_thd2 + (long long )y >= 0LL) && (long long )b$r_buff1_thd2 + (long long )z >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )x >= 0LL) && (long long )b$r_buff1_thd3 + (long long )y >= 0LL) && (long long )b$r_buff1_thd3 + (long long )z >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$read_delayed + (long long )x >= 0LL) && (long long )b$read_delayed + (long long )y >= 0LL) && (long long )b$read_delayed + (long long )z >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff1 + (long long )x >= 0LL) && (long long )b$w_buff1 + (long long )y >= 0LL) && (long long )b$w_buff1 + (long long )z >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$w_buff0) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$read_delayed >= 0LL) && (long long )a - (long long )b$r_buff0_thd0 >= 0LL) && (long long )a - (long long )b$r_buff0_thd2 >= 0LL) && (long long )a - (long long )b$r_buff0_thd3 >= 0LL) && (long long )a - (long long )b$r_buff1_thd0 >= 0LL) && (long long )a - (long long )b$r_buff1_thd2 >= 0LL) && (long long )a - (long long )b$r_buff1_thd3 >= 0LL) && (long long )a - (long long )b$read_delayed >= 0LL) && (long long )b - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b - (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= b$mem_tmp) && 0 <= b$w_buff0) && 0 <= b$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && b$mem_tmp <= 1) && b$w_buff0 <= 1) && b$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! 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 || ((0 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)
[2024-06-04 17:11:19,936 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 17:11:19,936 INFO  L106   edCorrectnessWitness]: ghost_update [L856-L856] multithreaded = 1;
[2024-06-04 17:11:19,972 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 17:11:20,240 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 17:11:20,249 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:11:20,668 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 17:11:20,702 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 17:11:20,704 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20 WrapperNode
[2024-06-04 17:11:20,704 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 17:11:20,705 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 17:11:20,705 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 17:11:20,705 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 17:11:20,710 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (1/1) ...
[2024-06-04 17:11:20,751 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (1/1) ...
[2024-06-04 17:11:20,869 INFO  L138                Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130
[2024-06-04 17:11:20,870 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 17:11:20,870 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 17:11:20,870 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 17:11:20,870 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 17:11:20,879 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (1/1) ...
[2024-06-04 17:11:20,879 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (1/1) ...
[2024-06-04 17:11:20,907 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (1/1) ...
[2024-06-04 17:11:20,971 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:11:20,972 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (1/1) ...
[2024-06-04 17:11:20,972 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (1/1) ...
[2024-06-04 17:11:21,021 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (1/1) ...
[2024-06-04 17:11:21,023 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (1/1) ...
[2024-06-04 17:11:21,048 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (1/1) ...
[2024-06-04 17:11:21,055 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (1/1) ...
[2024-06-04 17:11:21,096 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 17:11:21,097 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 17:11:21,098 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 17:11:21,098 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 17:11:21,098 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (1/1) ...
[2024-06-04 17:11:21,103 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 17:11:21,113 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 17:11:21,125 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:11:21,157 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 17:11:21,158 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 17:11:21,158 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 17:11:21,158 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 17:11:21,158 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 17:11:21,158 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 17:11:21,159 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 17:11:21,159 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 17:11:21,159 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 17:11:21,159 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 17:11:21,159 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 17:11:21,159 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 17:11:21,148 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:11:21,161 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:11:21,302 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 17:11:21,304 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 17:11:22,746 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 17:11:22,747 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 17:11:23,050 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 17:11:23,050 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 17:11:23,050 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:11:23 BoogieIcfgContainer
[2024-06-04 17:11:23,051 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 17:11:23,052 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 17:11:23,052 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 17:11:23,054 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 17:11:23,055 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:11:18" (1/4) ...
[2024-06-04 17:11:23,055 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad62b0a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:11:23, skipping insertion in model container
[2024-06-04 17:11:23,055 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:11:19" (2/4) ...
[2024-06-04 17:11:23,055 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad62b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:11:23, skipping insertion in model container
[2024-06-04 17:11:23,056 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:20" (3/4) ...
[2024-06-04 17:11:23,056 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad62b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:11:23, skipping insertion in model container
[2024-06-04 17:11:23,056 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:11:23" (4/4) ...
[2024-06-04 17:11:23,057 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix032.oepc.i
[2024-06-04 17:11:23,070 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 17:11:23,071 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 17:11:23,071 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 17:11:23,175 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 17:11:23,198 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 102 flow
[2024-06-04 17:11:23,329 INFO  L124   PetriNetUnfolderBase]: 0/42 cut-off events.
[2024-06-04 17:11:23,330 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 17:11:23,362 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-04 17:11:23,362 INFO  L82        GeneralOperation]: Start removeDead. Operand has 55 places, 45 transitions, 102 flow
[2024-06-04 17:11:23,364 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 81 flow
[2024-06-04 17:11:23,371 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 17:11:23,376 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;@3a1a313e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 17:11:23,392 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 17:11:23,401 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 17:11:23,401 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-04 17:11:23,401 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 17:11:23,402 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:11:23,402 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 17:11:23,403 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:11:23,406 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:11:23,410 INFO  L85        PathProgramCache]: Analyzing trace with hash -906167667, now seen corresponding path program 1 times
[2024-06-04 17:11:23,431 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:11:23,432 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681567453]
[2024-06-04 17:11:23,432 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:11:23,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:11:23,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:31,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:11:31,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:31,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681567453]
[2024-06-04 17:11:31,606 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681567453] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:31,606 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:31,606 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 17:11:31,607 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246969136]
[2024-06-04 17:11:31,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:31,614 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 17:11:31,617 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:31,639 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 17:11:31,640 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 17:11:31,734 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45
[2024-06-04 17:11:31,736 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 81 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:11:31,736 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:31,736 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45
[2024-06-04 17:11:31,737 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:11:33,035 INFO  L124   PetriNetUnfolderBase]: 1566/2427 cut-off events.
[2024-06-04 17:11:33,035 INFO  L125   PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES.
[2024-06-04 17:11:33,041 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4840 conditions, 2427 events. 1566/2427 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12245 event pairs, 1097 based on Foata normal form. 1/2350 useless extension candidates. Maximal degree in co-relation 4825. Up to 2326 conditions per place. 
[2024-06-04 17:11:33,051 INFO  L140   encePairwiseOnDemand]: 38/45 looper letters, 35 selfloop transitions, 4 changer transitions 0/46 dead transitions.
[2024-06-04 17:11:33,051 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 185 flow
[2024-06-04 17:11:33,052 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 17:11:33,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 17:11:33,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions.
[2024-06-04 17:11:33,060 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6
[2024-06-04 17:11:33,061 INFO  L175             Difference]: Start difference. First operand has 46 places, 36 transitions, 81 flow. Second operand 3 states and 81 transitions.
[2024-06-04 17:11:33,062 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 185 flow
[2024-06-04 17:11:33,064 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 17:11:33,065 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 108 flow
[2024-06-04 17:11:33,066 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-04 17:11:33,069 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places.
[2024-06-04 17:11:33,069 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 108 flow
[2024-06-04 17:11:33,069 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:11:33,069 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:11:33,069 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:11:33,070 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 17:11:33,070 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:11:33,070 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:11:33,070 INFO  L85        PathProgramCache]: Analyzing trace with hash 1051273132, now seen corresponding path program 1 times
[2024-06-04 17:11:33,070 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:11:33,071 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551972887]
[2024-06-04 17:11:33,071 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:11:33,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:11:33,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:40,213 INFO  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:11:40,214 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:40,214 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551972887]
[2024-06-04 17:11:40,214 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551972887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:40,214 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:40,214 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 17:11:40,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289888816]
[2024-06-04 17:11:40,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:40,216 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 17:11:40,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:40,218 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 17:11:40,218 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-04 17:11:40,318 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45
[2024-06-04 17:11:40,318 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 108 flow. Second operand  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:11:40,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:40,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45
[2024-06-04 17:11:40,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:11:41,522 INFO  L124   PetriNetUnfolderBase]: 1560/2434 cut-off events.
[2024-06-04 17:11:41,522 INFO  L125   PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES.
[2024-06-04 17:11:41,525 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5452 conditions, 2434 events. 1560/2434 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12365 event pairs, 930 based on Foata normal form. 3/2398 useless extension candidates. Maximal degree in co-relation 5437. Up to 2302 conditions per place. 
[2024-06-04 17:11:41,532 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 42 selfloop transitions, 7 changer transitions 0/56 dead transitions.
[2024-06-04 17:11:41,533 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 252 flow
[2024-06-04 17:11:41,533 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 17:11:41,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 17:11:41,534 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions.
[2024-06-04 17:11:41,534 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5777777777777777
[2024-06-04 17:11:41,534 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 108 flow. Second operand 4 states and 104 transitions.
[2024-06-04 17:11:41,535 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 252 flow
[2024-06-04 17:11:41,535 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 17:11:41,536 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 144 flow
[2024-06-04 17:11:41,536 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-04 17:11:41,537 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places.
[2024-06-04 17:11:41,537 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 144 flow
[2024-06-04 17:11:41,537 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have 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:11:41,538 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:11:41,538 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:11:41,538 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 17:11:41,538 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:11:41,538 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:11:41,539 INFO  L85        PathProgramCache]: Analyzing trace with hash 956207307, now seen corresponding path program 1 times
[2024-06-04 17:11:41,539 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:11:41,539 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028087164]
[2024-06-04 17:11:41,539 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:11:41,539 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:11:41,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:48,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:11:48,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:48,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028087164]
[2024-06-04 17:11:48,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028087164] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:48,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:48,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:11:48,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066280616]
[2024-06-04 17:11:48,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:48,687 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:11:48,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:48,688 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:11:48,688 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:11:48,871 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-04 17:11:48,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 144 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:11:48,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:48,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-04 17:11:48,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:11:50,439 INFO  L124   PetriNetUnfolderBase]: 1893/2923 cut-off events.
[2024-06-04 17:11:50,440 INFO  L125   PetriNetUnfolderBase]: For 1525/1525 co-relation queries the response was YES.
[2024-06-04 17:11:50,444 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7212 conditions, 2923 events. 1893/2923 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14739 event pairs, 878 based on Foata normal form. 3/2878 useless extension candidates. Maximal degree in co-relation 7195. Up to 2753 conditions per place. 
[2024-06-04 17:11:50,454 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 57 selfloop transitions, 13 changer transitions 0/76 dead transitions.
[2024-06-04 17:11:50,454 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 386 flow
[2024-06-04 17:11:50,455 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:11:50,456 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:11:50,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions.
[2024-06-04 17:11:50,457 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5370370370370371
[2024-06-04 17:11:50,457 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 144 flow. Second operand 6 states and 145 transitions.
[2024-06-04 17:11:50,457 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 386 flow
[2024-06-04 17:11:50,458 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 366 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-06-04 17:11:50,459 INFO  L231             Difference]: Finished difference. Result has 54 places, 48 transitions, 202 flow
[2024-06-04 17:11:50,460 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=54, PETRI_TRANSITIONS=48}
[2024-06-04 17:11:50,460 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places.
[2024-06-04 17:11:50,460 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 202 flow
[2024-06-04 17:11:50,461 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:11:50,461 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:11:50,461 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:11:50,461 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 17:11:50,461 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:11:50,462 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:11:50,462 INFO  L85        PathProgramCache]: Analyzing trace with hash -422343181, now seen corresponding path program 1 times
[2024-06-04 17:11:50,462 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:11:50,462 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049523751]
[2024-06-04 17:11:50,462 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:11:50,462 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:11:50,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:58,533 INFO  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:11:58,534 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:58,534 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049523751]
[2024-06-04 17:11:58,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049523751] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:58,534 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:58,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:11:58,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026740598]
[2024-06-04 17:11:58,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:58,535 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:11:58,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:58,536 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:11:58,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:11:58,817 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-04 17:11:58,817 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 202 flow. Second operand  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:11:58,817 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:58,817 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-04 17:11:58,817 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:12:00,414 INFO  L124   PetriNetUnfolderBase]: 1884/2904 cut-off events.
[2024-06-04 17:12:00,414 INFO  L125   PetriNetUnfolderBase]: For 3016/3016 co-relation queries the response was YES.
[2024-06-04 17:12:00,418 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7977 conditions, 2904 events. 1884/2904 cut-off events. For 3016/3016 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14545 event pairs, 690 based on Foata normal form. 6/2860 useless extension candidates. Maximal degree in co-relation 7958. Up to 2708 conditions per place. 
[2024-06-04 17:12:00,427 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 61 selfloop transitions, 15 changer transitions 0/82 dead transitions.
[2024-06-04 17:12:00,428 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 446 flow
[2024-06-04 17:12:00,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:12:00,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:12:00,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions.
[2024-06-04 17:12:00,430 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5174603174603175
[2024-06-04 17:12:00,430 INFO  L175             Difference]: Start difference. First operand has 54 places, 48 transitions, 202 flow. Second operand 7 states and 163 transitions.
[2024-06-04 17:12:00,430 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 446 flow
[2024-06-04 17:12:00,432 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 418 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 17:12:00,433 INFO  L231             Difference]: Finished difference. Result has 57 places, 49 transitions, 223 flow
[2024-06-04 17:12:00,434 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=57, PETRI_TRANSITIONS=49}
[2024-06-04 17:12:00,434 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places.
[2024-06-04 17:12:00,434 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 223 flow
[2024-06-04 17:12:00,435 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:12:00,435 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:12:00,435 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:12:00,435 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 17:12:00,435 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:12:00,436 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:12:00,436 INFO  L85        PathProgramCache]: Analyzing trace with hash -1201136532, now seen corresponding path program 1 times
[2024-06-04 17:12:00,436 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:12:00,436 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968953040]
[2024-06-04 17:12:00,436 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:12:00,436 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:12:00,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:12:16,102 INFO  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:12:16,102 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:12:16,102 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968953040]
[2024-06-04 17:12:16,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968953040] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:12:16,103 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:12:16,103 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:12:16,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574106085]
[2024-06-04 17:12:16,103 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:12:16,103 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:12:16,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:12:16,104 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:12:16,104 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:12:16,285 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:12:16,285 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 223 flow. Second operand  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:12:16,285 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:12:16,285 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:12:16,285 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:12:17,752 INFO  L124   PetriNetUnfolderBase]: 1879/2897 cut-off events.
[2024-06-04 17:12:17,753 INFO  L125   PetriNetUnfolderBase]: For 4612/4612 co-relation queries the response was YES.
[2024-06-04 17:12:17,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8454 conditions, 2897 events. 1879/2897 cut-off events. For 4612/4612 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14506 event pairs, 812 based on Foata normal form. 2/2849 useless extension candidates. Maximal degree in co-relation 8434. Up to 2767 conditions per place. 
[2024-06-04 17:12:17,771 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 49 selfloop transitions, 8 changer transitions 0/63 dead transitions.
[2024-06-04 17:12:17,771 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 381 flow
[2024-06-04 17:12:17,772 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:12:17,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:12:17,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions.
[2024-06-04 17:12:17,773 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4577777777777778
[2024-06-04 17:12:17,773 INFO  L175             Difference]: Start difference. First operand has 57 places, 49 transitions, 223 flow. Second operand 5 states and 103 transitions.
[2024-06-04 17:12:17,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 381 flow
[2024-06-04 17:12:17,779 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 342 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-06-04 17:12:17,781 INFO  L231             Difference]: Finished difference. Result has 57 places, 52 transitions, 230 flow
[2024-06-04 17:12:17,782 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=57, PETRI_TRANSITIONS=52}
[2024-06-04 17:12:17,784 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places.
[2024-06-04 17:12:17,784 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 230 flow
[2024-06-04 17:12:17,785 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:12:17,790 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:12:17,790 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:12:17,791 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 17:12:17,791 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:12:17,791 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:12:17,791 INFO  L85        PathProgramCache]: Analyzing trace with hash 1419474820, now seen corresponding path program 1 times
[2024-06-04 17:12:17,791 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:12:17,792 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937476496]
[2024-06-04 17:12:17,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:12:17,792 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:12:17,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:12:34,977 INFO  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:12:34,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:12:34,977 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937476496]
[2024-06-04 17:12:34,977 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937476496] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:12:34,978 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:12:34,978 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:12:34,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297730041]
[2024-06-04 17:12:34,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:12:34,978 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:12:34,979 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:12:34,979 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:12:34,979 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:12:35,152 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:12:35,152 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 230 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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:12:35,153 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:12:35,153 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:12:35,153 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:12:36,793 INFO  L124   PetriNetUnfolderBase]: 2215/3408 cut-off events.
[2024-06-04 17:12:36,793 INFO  L125   PetriNetUnfolderBase]: For 7255/7255 co-relation queries the response was YES.
[2024-06-04 17:12:36,798 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10470 conditions, 3408 events. 2215/3408 cut-off events. For 7255/7255 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 17088 event pairs, 972 based on Foata normal form. 2/3400 useless extension candidates. Maximal degree in co-relation 10448. Up to 3242 conditions per place. 
[2024-06-04 17:12:36,817 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 54 selfloop transitions, 11 changer transitions 0/70 dead transitions.
[2024-06-04 17:12:36,817 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 70 transitions, 418 flow
[2024-06-04 17:12:36,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:12:36,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:12:36,818 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions.
[2024-06-04 17:12:36,818 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42962962962962964
[2024-06-04 17:12:36,818 INFO  L175             Difference]: Start difference. First operand has 57 places, 52 transitions, 230 flow. Second operand 6 states and 116 transitions.
[2024-06-04 17:12:36,818 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 70 transitions, 418 flow
[2024-06-04 17:12:36,821 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 396 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-04 17:12:36,822 INFO  L231             Difference]: Finished difference. Result has 60 places, 55 transitions, 264 flow
[2024-06-04 17:12:36,822 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=60, PETRI_TRANSITIONS=55}
[2024-06-04 17:12:36,822 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places.
[2024-06-04 17:12:36,822 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 264 flow
[2024-06-04 17:12:36,823 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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:12:36,823 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:12:36,823 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:12:36,823 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 17:12:36,823 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:12:36,823 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:12:36,824 INFO  L85        PathProgramCache]: Analyzing trace with hash 2063699997, now seen corresponding path program 1 times
[2024-06-04 17:12:36,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:12:36,824 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556347720]
[2024-06-04 17:12:36,824 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:12:36,824 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:12:36,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:12:50,320 INFO  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:12:50,320 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:12:50,320 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556347720]
[2024-06-04 17:12:50,320 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556347720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:12:50,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:12:50,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:12:50,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883918799]
[2024-06-04 17:12:50,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:12:50,321 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:12:50,322 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:12:50,322 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:12:50,322 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:12:50,511 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:12:50,512 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 264 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:12:50,512 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:12:50,512 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:12:50,512 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:12:52,118 INFO  L124   PetriNetUnfolderBase]: 2094/3286 cut-off events.
[2024-06-04 17:12:52,118 INFO  L125   PetriNetUnfolderBase]: For 9839/9839 co-relation queries the response was YES.
[2024-06-04 17:12:52,123 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10817 conditions, 3286 events. 2094/3286 cut-off events. For 9839/9839 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16940 event pairs, 871 based on Foata normal form. 2/3277 useless extension candidates. Maximal degree in co-relation 10794. Up to 3040 conditions per place. 
[2024-06-04 17:12:52,131 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 61 selfloop transitions, 17 changer transitions 0/85 dead transitions.
[2024-06-04 17:12:52,132 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 85 transitions, 548 flow
[2024-06-04 17:12:52,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:12:52,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:12:52,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions.
[2024-06-04 17:12:52,133 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603174603174603
[2024-06-04 17:12:52,133 INFO  L175             Difference]: Start difference. First operand has 60 places, 55 transitions, 264 flow. Second operand 7 states and 145 transitions.
[2024-06-04 17:12:52,133 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 85 transitions, 548 flow
[2024-06-04 17:12:52,135 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 516 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-04 17:12:52,136 INFO  L231             Difference]: Finished difference. Result has 63 places, 61 transitions, 324 flow
[2024-06-04 17:12:52,137 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=324, PETRI_PLACES=63, PETRI_TRANSITIONS=61}
[2024-06-04 17:12:52,137 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places.
[2024-06-04 17:12:52,137 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 324 flow
[2024-06-04 17:12:52,138 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:12:52,138 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:12:52,138 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:12:52,138 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 17:12:52,138 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:12:52,138 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:12:52,139 INFO  L85        PathProgramCache]: Analyzing trace with hash -2021879373, now seen corresponding path program 2 times
[2024-06-04 17:12:52,139 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:12:52,139 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969299700]
[2024-06-04 17:12:52,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:12:52,139 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:12:52,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:13:06,002 INFO  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:13:06,002 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:13:06,003 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969299700]
[2024-06-04 17:13:06,003 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969299700] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:13:06,003 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:13:06,003 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:13:06,003 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471921043]
[2024-06-04 17:13:06,003 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:13:06,004 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:13:06,004 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:13:06,004 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:13:06,005 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:13:06,207 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:13:06,208 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 324 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:13:06,208 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:13:06,208 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:13:06,208 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:13:07,805 INFO  L124   PetriNetUnfolderBase]: 2089/3279 cut-off events.
[2024-06-04 17:13:07,805 INFO  L125   PetriNetUnfolderBase]: For 12804/12804 co-relation queries the response was YES.
[2024-06-04 17:13:07,811 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11515 conditions, 3279 events. 2089/3279 cut-off events. For 12804/12804 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16916 event pairs, 871 based on Foata normal form. 2/3270 useless extension candidates. Maximal degree in co-relation 11491. Up to 3059 conditions per place. 
[2024-06-04 17:13:07,820 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 58 selfloop transitions, 11 changer transitions 0/76 dead transitions.
[2024-06-04 17:13:07,821 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 76 transitions, 500 flow
[2024-06-04 17:13:07,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:13:07,823 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:13:07,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions.
[2024-06-04 17:13:07,823 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44814814814814813
[2024-06-04 17:13:07,823 INFO  L175             Difference]: Start difference. First operand has 63 places, 61 transitions, 324 flow. Second operand 6 states and 121 transitions.
[2024-06-04 17:13:07,824 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 76 transitions, 500 flow
[2024-06-04 17:13:07,829 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 460 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-04 17:13:07,830 INFO  L231             Difference]: Finished difference. Result has 66 places, 61 transitions, 314 flow
[2024-06-04 17:13:07,830 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=66, PETRI_TRANSITIONS=61}
[2024-06-04 17:13:07,831 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places.
[2024-06-04 17:13:07,831 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 314 flow
[2024-06-04 17:13:07,831 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:13:07,831 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:13:07,831 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:13:07,831 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 17:13:07,832 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:13:07,832 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:13:07,832 INFO  L85        PathProgramCache]: Analyzing trace with hash -2021871437, now seen corresponding path program 1 times
[2024-06-04 17:13:07,832 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:13:07,832 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863316908]
[2024-06-04 17:13:07,832 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:13:07,833 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:13:07,864 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:13:27,423 INFO  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:13:27,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:13:27,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863316908]
[2024-06-04 17:13:27,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863316908] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:13:27,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:13:27,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:13:27,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224858568]
[2024-06-04 17:13:27,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:13:27,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:13:27,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:13:27,425 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:13:27,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:13:27,669 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:13:27,669 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 314 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:13:27,670 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:13:27,670 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:13:27,670 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:13:29,366 INFO  L124   PetriNetUnfolderBase]: 2211/3383 cut-off events.
[2024-06-04 17:13:29,367 INFO  L125   PetriNetUnfolderBase]: For 14788/14788 co-relation queries the response was YES.
[2024-06-04 17:13:29,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12027 conditions, 3383 events. 2211/3383 cut-off events. For 14788/14788 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16814 event pairs, 909 based on Foata normal form. 4/3374 useless extension candidates. Maximal degree in co-relation 12001. Up to 3219 conditions per place. 
[2024-06-04 17:13:29,382 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 65 selfloop transitions, 14 changer transitions 0/84 dead transitions.
[2024-06-04 17:13:29,382 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 548 flow
[2024-06-04 17:13:29,382 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:13:29,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:13:29,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-04 17:13:29,383 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4253968253968254
[2024-06-04 17:13:29,384 INFO  L175             Difference]: Start difference. First operand has 66 places, 61 transitions, 314 flow. Second operand 7 states and 134 transitions.
[2024-06-04 17:13:29,384 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 548 flow
[2024-06-04 17:13:29,389 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 84 transitions, 514 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-04 17:13:29,393 INFO  L231             Difference]: Finished difference. Result has 67 places, 64 transitions, 348 flow
[2024-06-04 17:13:29,393 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=348, PETRI_PLACES=67, PETRI_TRANSITIONS=64}
[2024-06-04 17:13:29,394 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places.
[2024-06-04 17:13:29,394 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 348 flow
[2024-06-04 17:13:29,395 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:13:29,395 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:13:29,395 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:13:29,395 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 17:13:29,395 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:13:29,396 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:13:29,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -1861742103, now seen corresponding path program 1 times
[2024-06-04 17:13:29,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:13:29,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564997170]
[2024-06-04 17:13:29,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:13:29,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:13:29,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:13:43,147 INFO  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:13:43,147 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:13:43,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564997170]
[2024-06-04 17:13:43,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564997170] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:13:43,148 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:13:43,148 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:13:43,148 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673412346]
[2024-06-04 17:13:43,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:13:43,148 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:13:43,149 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:13:43,149 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:13:43,149 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:13:43,390 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:13:43,390 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 348 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:13:43,391 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:13:43,391 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:13:43,391 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:13:45,123 INFO  L124   PetriNetUnfolderBase]: 2090/3266 cut-off events.
[2024-06-04 17:13:45,123 INFO  L125   PetriNetUnfolderBase]: For 18151/18151 co-relation queries the response was YES.
[2024-06-04 17:13:45,129 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12350 conditions, 3266 events. 2090/3266 cut-off events. For 18151/18151 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16749 event pairs, 826 based on Foata normal form. 2/3254 useless extension candidates. Maximal degree in co-relation 12324. Up to 3040 conditions per place. 
[2024-06-04 17:13:45,148 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 71 selfloop transitions, 14 changer transitions 0/92 dead transitions.
[2024-06-04 17:13:45,148 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 610 flow
[2024-06-04 17:13:45,149 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:13:45,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:13:45,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions.
[2024-06-04 17:13:45,150 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603174603174603
[2024-06-04 17:13:45,150 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 348 flow. Second operand 7 states and 145 transitions.
[2024-06-04 17:13:45,150 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 92 transitions, 610 flow
[2024-06-04 17:13:45,155 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 92 transitions, 566 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-04 17:13:45,157 INFO  L231             Difference]: Finished difference. Result has 69 places, 67 transitions, 374 flow
[2024-06-04 17:13:45,157 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=374, PETRI_PLACES=69, PETRI_TRANSITIONS=67}
[2024-06-04 17:13:45,158 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places.
[2024-06-04 17:13:45,158 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 374 flow
[2024-06-04 17:13:45,159 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:13:45,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:13:45,159 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:13:45,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 17:13:45,159 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:13:45,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:13:45,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -449807885, now seen corresponding path program 1 times
[2024-06-04 17:13:45,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:13:45,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129332502]
[2024-06-04 17:13:45,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:13:45,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:13:45,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:13:59,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:13:59,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:13:59,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129332502]
[2024-06-04 17:13:59,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129332502] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:13:59,240 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:13:59,240 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:13:59,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619668132]
[2024-06-04 17:13:59,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:13:59,241 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:13:59,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:13:59,241 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:13:59,241 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:13:59,527 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:13:59,528 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 374 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:13:59,528 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:13:59,528 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:13:59,528 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:14:01,177 INFO  L124   PetriNetUnfolderBase]: 2233/3413 cut-off events.
[2024-06-04 17:14:01,178 INFO  L125   PetriNetUnfolderBase]: For 21974/21974 co-relation queries the response was YES.
[2024-06-04 17:14:01,183 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13520 conditions, 3413 events. 2233/3413 cut-off events. For 21974/21974 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16972 event pairs, 885 based on Foata normal form. 2/3400 useless extension candidates. Maximal degree in co-relation 13493. Up to 3211 conditions per place. 
[2024-06-04 17:14:01,192 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 72 selfloop transitions, 24 changer transitions 0/101 dead transitions.
[2024-06-04 17:14:01,192 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 101 transitions, 732 flow
[2024-06-04 17:14:01,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:14:01,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:14:01,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-04 17:14:01,193 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4388888888888889
[2024-06-04 17:14:01,193 INFO  L175             Difference]: Start difference. First operand has 69 places, 67 transitions, 374 flow. Second operand 8 states and 158 transitions.
[2024-06-04 17:14:01,193 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 101 transitions, 732 flow
[2024-06-04 17:14:01,199 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 101 transitions, 686 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-04 17:14:01,200 INFO  L231             Difference]: Finished difference. Result has 72 places, 73 transitions, 446 flow
[2024-06-04 17:14:01,200 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=446, PETRI_PLACES=72, PETRI_TRANSITIONS=73}
[2024-06-04 17:14:01,201 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places.
[2024-06-04 17:14:01,201 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 446 flow
[2024-06-04 17:14:01,201 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:01,201 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:14:01,201 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:14:01,201 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 17:14:01,202 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:14:01,202 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:14:01,202 INFO  L85        PathProgramCache]: Analyzing trace with hash -1861622133, now seen corresponding path program 2 times
[2024-06-04 17:14:01,202 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:14:01,202 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625410444]
[2024-06-04 17:14:01,202 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:14:01,203 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:14:01,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:14:16,090 INFO  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:16,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:14:16,091 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625410444]
[2024-06-04 17:14:16,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625410444] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:14:16,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:14:16,091 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:14:16,091 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598444073]
[2024-06-04 17:14:16,091 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:14:16,091 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:14:16,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:14:16,092 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:14:16,092 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:14:16,329 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:14:16,329 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 446 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:14:16,330 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:14:16,330 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:14:16,330 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:14:17,989 INFO  L124   PetriNetUnfolderBase]: 2119/3334 cut-off events.
[2024-06-04 17:14:17,990 INFO  L125   PetriNetUnfolderBase]: For 25866/25866 co-relation queries the response was YES.
[2024-06-04 17:14:17,996 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13834 conditions, 3334 events. 2119/3334 cut-off events. For 25866/25866 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17224 event pairs, 820 based on Foata normal form. 2/3321 useless extension candidates. Maximal degree in co-relation 13806. Up to 3025 conditions per place. 
[2024-06-04 17:14:18,004 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 71 selfloop transitions, 27 changer transitions 0/107 dead transitions.
[2024-06-04 17:14:18,004 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 107 transitions, 828 flow
[2024-06-04 17:14:18,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:14:18,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:14:18,005 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions.
[2024-06-04 17:14:18,005 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-04 17:14:18,005 INFO  L175             Difference]: Start difference. First operand has 72 places, 73 transitions, 446 flow. Second operand 8 states and 165 transitions.
[2024-06-04 17:14:18,005 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 107 transitions, 828 flow
[2024-06-04 17:14:18,015 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 107 transitions, 790 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-04 17:14:18,016 INFO  L231             Difference]: Finished difference. Result has 76 places, 79 transitions, 548 flow
[2024-06-04 17:14:18,016 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=548, PETRI_PLACES=76, PETRI_TRANSITIONS=79}
[2024-06-04 17:14:18,017 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places.
[2024-06-04 17:14:18,017 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 548 flow
[2024-06-04 17:14:18,017 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:14:18,017 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:14:18,017 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:14:18,017 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 17:14:18,017 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:14:18,018 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:14:18,018 INFO  L85        PathProgramCache]: Analyzing trace with hash -1684253277, now seen corresponding path program 2 times
[2024-06-04 17:14:18,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:14:18,018 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103416190]
[2024-06-04 17:14:18,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:14:18,018 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:14:18,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:14:31,611 INFO  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:31,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:14:31,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103416190]
[2024-06-04 17:14:31,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103416190] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:14:31,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:14:31,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:14:31,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383815468]
[2024-06-04 17:14:31,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:14:31,613 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:14:31,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:14:31,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:14:31,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:14:31,801 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:14:31,802 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 548 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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,802 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:14:31,802 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:14:31,802 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:14:33,451 INFO  L124   PetriNetUnfolderBase]: 2255/3475 cut-off events.
[2024-06-04 17:14:33,452 INFO  L125   PetriNetUnfolderBase]: For 31097/31097 co-relation queries the response was YES.
[2024-06-04 17:14:33,458 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15200 conditions, 3475 events. 2255/3475 cut-off events. For 31097/31097 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17487 event pairs, 885 based on Foata normal form. 2/3462 useless extension candidates. Maximal degree in co-relation 15170. Up to 3292 conditions per place. 
[2024-06-04 17:14:33,466 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 82 selfloop transitions, 14 changer transitions 0/101 dead transitions.
[2024-06-04 17:14:33,466 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 101 transitions, 822 flow
[2024-06-04 17:14:33,467 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:14:33,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:14:33,467 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-04 17:14:33,468 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4222222222222222
[2024-06-04 17:14:33,468 INFO  L175             Difference]: Start difference. First operand has 76 places, 79 transitions, 548 flow. Second operand 7 states and 133 transitions.
[2024-06-04 17:14:33,468 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 101 transitions, 822 flow
[2024-06-04 17:14:33,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 101 transitions, 774 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-04 17:14:33,481 INFO  L231             Difference]: Finished difference. Result has 79 places, 82 transitions, 576 flow
[2024-06-04 17:14:33,481 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=79, PETRI_TRANSITIONS=82}
[2024-06-04 17:14:33,482 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places.
[2024-06-04 17:14:33,482 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 576 flow
[2024-06-04 17:14:33,482 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:33,482 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:14:33,482 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:14:33,482 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 17:14:33,483 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:14:33,483 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:14:33,483 INFO  L85        PathProgramCache]: Analyzing trace with hash -445166441, now seen corresponding path program 3 times
[2024-06-04 17:14:33,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:14:33,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025863113]
[2024-06-04 17:14:33,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:14:33,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:14:33,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:14:48,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:14:48,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:14:48,516 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025863113]
[2024-06-04 17:14:48,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025863113] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:14:48,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:14:48,516 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:14:48,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132767214]
[2024-06-04 17:14:48,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:14:48,516 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:14:48,516 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:14:48,517 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:14:48,517 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:14:48,748 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:14:48,748 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 576 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:14:48,748 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:14:48,748 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:14:48,748 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:14:50,391 INFO  L124   PetriNetUnfolderBase]: 2125/3343 cut-off events.
[2024-06-04 17:14:50,392 INFO  L125   PetriNetUnfolderBase]: For 34651/34651 co-relation queries the response was YES.
[2024-06-04 17:14:50,399 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14945 conditions, 3343 events. 2125/3343 cut-off events. For 34651/34651 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17282 event pairs, 820 based on Foata normal form. 2/3330 useless extension candidates. Maximal degree in co-relation 14913. Up to 3088 conditions per place. 
[2024-06-04 17:14:50,408 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 77 selfloop transitions, 14 changer transitions 0/101 dead transitions.
[2024-06-04 17:14:50,408 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 101 transitions, 806 flow
[2024-06-04 17:14:50,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:14:50,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:14:50,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions.
[2024-06-04 17:14:50,409 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44126984126984126
[2024-06-04 17:14:50,409 INFO  L175             Difference]: Start difference. First operand has 79 places, 82 transitions, 576 flow. Second operand 7 states and 139 transitions.
[2024-06-04 17:14:50,409 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 101 transitions, 806 flow
[2024-06-04 17:14:50,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 740 flow, removed 21 selfloop flow, removed 5 redundant places.
[2024-06-04 17:14:50,427 INFO  L231             Difference]: Finished difference. Result has 81 places, 82 transitions, 546 flow
[2024-06-04 17:14:50,427 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=81, PETRI_TRANSITIONS=82}
[2024-06-04 17:14:50,427 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places.
[2024-06-04 17:14:50,427 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 546 flow
[2024-06-04 17:14:50,428 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:14:50,428 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:14:50,428 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:14:50,428 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 17:14:50,428 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:14:50,428 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:14:50,428 INFO  L85        PathProgramCache]: Analyzing trace with hash 773881465, now seen corresponding path program 3 times
[2024-06-04 17:14:50,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:14:50,428 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19006588]
[2024-06-04 17:14:50,428 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:14:50,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:14:50,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:15:05,625 INFO  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:05,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:15:05,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19006588]
[2024-06-04 17:15:05,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19006588] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:15:05,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:15:05,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:15:05,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956733095]
[2024-06-04 17:15:05,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:15:05,626 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:15:05,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:15:05,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:15:05,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:15:05,834 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:15:05,834 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 546 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:05,834 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:15:05,834 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:15:05,834 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:15:07,568 INFO  L124   PetriNetUnfolderBase]: 2245/3461 cut-off events.
[2024-06-04 17:15:07,568 INFO  L125   PetriNetUnfolderBase]: For 38416/38416 co-relation queries the response was YES.
[2024-06-04 17:15:07,575 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15679 conditions, 3461 events. 2245/3461 cut-off events. For 38416/38416 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17385 event pairs, 885 based on Foata normal form. 2/3448 useless extension candidates. Maximal degree in co-relation 15646. Up to 3260 conditions per place. 
[2024-06-04 17:15:07,584 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 77 selfloop transitions, 19 changer transitions 0/101 dead transitions.
[2024-06-04 17:15:07,585 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 101 transitions, 786 flow
[2024-06-04 17:15:07,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:15:07,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:15:07,585 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-04 17:15:07,586 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 17:15:07,586 INFO  L175             Difference]: Start difference. First operand has 81 places, 82 transitions, 546 flow. Second operand 7 states and 135 transitions.
[2024-06-04 17:15:07,586 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 101 transitions, 786 flow
[2024-06-04 17:15:07,602 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 101 transitions, 724 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-04 17:15:07,604 INFO  L231             Difference]: Finished difference. Result has 82 places, 82 transitions, 530 flow
[2024-06-04 17:15:07,604 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=530, PETRI_PLACES=82, PETRI_TRANSITIONS=82}
[2024-06-04 17:15:07,604 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 36 predicate places.
[2024-06-04 17:15:07,604 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 530 flow
[2024-06-04 17:15:07,605 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:07,605 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:15:07,605 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:15:07,605 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 17:15:07,605 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:15:07,605 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:15:07,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 1509384458, now seen corresponding path program 1 times
[2024-06-04 17:15:07,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:15:07,606 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800219472]
[2024-06-04 17:15:07,606 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:15:07,606 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:15:07,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:15:28,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:15:28,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:15:28,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800219472]
[2024-06-04 17:15:28,053 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800219472] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:15:28,053 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:15:28,053 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:15:28,053 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842236475]
[2024-06-04 17:15:28,053 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:15:28,053 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:15:28,054 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:15:28,054 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:15:28,054 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:15:28,200 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:15:28,200 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 530 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:28,200 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:15:28,200 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:15:28,200 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:15:29,989 INFO  L124   PetriNetUnfolderBase]: 2285/3635 cut-off events.
[2024-06-04 17:15:29,989 INFO  L125   PetriNetUnfolderBase]: For 48108/48108 co-relation queries the response was YES.
[2024-06-04 17:15:29,996 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16765 conditions, 3635 events. 2285/3635 cut-off events. For 48108/48108 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19000 event pairs, 997 based on Foata normal form. 1/3634 useless extension candidates. Maximal degree in co-relation 16731. Up to 3360 conditions per place. 
[2024-06-04 17:15:30,005 INFO  L140   encePairwiseOnDemand]: 38/45 looper letters, 69 selfloop transitions, 8 changer transitions 0/93 dead transitions.
[2024-06-04 17:15:30,005 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 93 transitions, 726 flow
[2024-06-04 17:15:30,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:15:30,006 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:15:30,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions.
[2024-06-04 17:15:30,006 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44
[2024-06-04 17:15:30,007 INFO  L175             Difference]: Start difference. First operand has 82 places, 82 transitions, 530 flow. Second operand 5 states and 99 transitions.
[2024-06-04 17:15:30,007 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 93 transitions, 726 flow
[2024-06-04 17:15:30,022 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 93 transitions, 666 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-04 17:15:30,024 INFO  L231             Difference]: Finished difference. Result has 81 places, 85 transitions, 520 flow
[2024-06-04 17:15:30,024 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=520, PETRI_PLACES=81, PETRI_TRANSITIONS=85}
[2024-06-04 17:15:30,024 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places.
[2024-06-04 17:15:30,024 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 520 flow
[2024-06-04 17:15:30,025 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:30,025 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:15:30,025 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:30,025 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 17:15:30,025 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:15:30,025 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:15:30,026 INFO  L85        PathProgramCache]: Analyzing trace with hash -1062956100, now seen corresponding path program 1 times
[2024-06-04 17:15:30,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:15:30,026 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827327105]
[2024-06-04 17:15:30,026 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:15:30,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:15:30,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:15:45,475 INFO  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:45,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:15:45,475 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827327105]
[2024-06-04 17:15:45,475 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827327105] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:15:45,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:15:45,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:15:45,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518230647]
[2024-06-04 17:15:45,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:15:45,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:15:45,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:15:45,476 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:15:45,476 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:15:45,690 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:15:45,690 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 85 transitions, 520 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:45,690 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:15:45,690 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:15:45,690 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:15:47,646 INFO  L124   PetriNetUnfolderBase]: 2191/3447 cut-off events.
[2024-06-04 17:15:47,646 INFO  L125   PetriNetUnfolderBase]: For 47494/47494 co-relation queries the response was YES.
[2024-06-04 17:15:47,654 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16491 conditions, 3447 events. 2191/3447 cut-off events. For 47494/47494 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17739 event pairs, 814 based on Foata normal form. 2/3447 useless extension candidates. Maximal degree in co-relation 16456. Up to 3153 conditions per place. 
[2024-06-04 17:15:47,664 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 101 selfloop transitions, 25 changer transitions 0/136 dead transitions.
[2024-06-04 17:15:47,664 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 136 transitions, 1068 flow
[2024-06-04 17:15:47,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:15:47,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:15:47,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-04 17:15:47,665 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4288888888888889
[2024-06-04 17:15:47,665 INFO  L175             Difference]: Start difference. First operand has 81 places, 85 transitions, 520 flow. Second operand 10 states and 193 transitions.
[2024-06-04 17:15:47,665 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 136 transitions, 1068 flow
[2024-06-04 17:15:47,685 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 136 transitions, 1038 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-04 17:15:47,686 INFO  L231             Difference]: Finished difference. Result has 93 places, 105 transitions, 755 flow
[2024-06-04 17:15:47,687 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=755, PETRI_PLACES=93, PETRI_TRANSITIONS=105}
[2024-06-04 17:15:47,687 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 47 predicate places.
[2024-06-04 17:15:47,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 105 transitions, 755 flow
[2024-06-04 17:15:47,687 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:47,687 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:15:47,687 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:47,688 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 17:15:47,688 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:15:47,688 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:15:47,688 INFO  L85        PathProgramCache]: Analyzing trace with hash 672202437, now seen corresponding path program 1 times
[2024-06-04 17:15:47,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:15:47,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219729009]
[2024-06-04 17:15:47,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:15:47,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:15:47,734 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:02,977 INFO  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:02,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:02,978 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219729009]
[2024-06-04 17:16:02,978 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219729009] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:02,978 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:02,978 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:16:02,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095072303]
[2024-06-04 17:16:02,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:02,978 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:16:02,978 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:02,978 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:16:02,979 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:16:03,229 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:16:03,230 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 105 transitions, 755 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:03,230 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:03,230 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:16:03,230 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:05,019 INFO  L124   PetriNetUnfolderBase]: 2327/3582 cut-off events.
[2024-06-04 17:16:05,020 INFO  L125   PetriNetUnfolderBase]: For 54195/54203 co-relation queries the response was YES.
[2024-06-04 17:16:05,029 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17999 conditions, 3582 events. 2327/3582 cut-off events. For 54195/54203 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17872 event pairs, 842 based on Foata normal form. 6/3586 useless extension candidates. Maximal degree in co-relation 17958. Up to 3348 conditions per place. 
[2024-06-04 17:16:05,041 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 104 selfloop transitions, 27 changer transitions 0/136 dead transitions.
[2024-06-04 17:16:05,041 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 136 transitions, 1133 flow
[2024-06-04 17:16:05,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:16:05,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:16:05,042 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-04 17:16:05,042 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-04 17:16:05,042 INFO  L175             Difference]: Start difference. First operand has 93 places, 105 transitions, 755 flow. Second operand 8 states and 156 transitions.
[2024-06-04 17:16:05,042 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 136 transitions, 1133 flow
[2024-06-04 17:16:05,069 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 136 transitions, 1084 flow, removed 21 selfloop flow, removed 2 redundant places.
[2024-06-04 17:16:05,071 INFO  L231             Difference]: Finished difference. Result has 99 places, 108 transitions, 815 flow
[2024-06-04 17:16:05,071 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=815, PETRI_PLACES=99, PETRI_TRANSITIONS=108}
[2024-06-04 17:16:05,071 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 53 predicate places.
[2024-06-04 17:16:05,071 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 815 flow
[2024-06-04 17:16:05,072 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:05,072 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:05,072 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:05,072 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 17:16:05,072 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:16:05,072 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:05,072 INFO  L85        PathProgramCache]: Analyzing trace with hash -1062865890, now seen corresponding path program 2 times
[2024-06-04 17:16:05,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:05,073 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027902145]
[2024-06-04 17:16:05,073 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:05,073 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:05,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:21,434 INFO  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:21,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:21,434 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027902145]
[2024-06-04 17:16:21,434 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027902145] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:21,434 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:21,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:16:21,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512234104]
[2024-06-04 17:16:21,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:21,435 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:16:21,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:21,436 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:16:21,436 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:16:21,788 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:16:21,788 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 815 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:21,788 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:21,788 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:16:21,788 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:23,651 INFO  L124   PetriNetUnfolderBase]: 2215/3473 cut-off events.
[2024-06-04 17:16:23,652 INFO  L125   PetriNetUnfolderBase]: For 60670/60676 co-relation queries the response was YES.
[2024-06-04 17:16:23,661 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18180 conditions, 3473 events. 2215/3473 cut-off events. For 60670/60676 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17838 event pairs, 792 based on Foata normal form. 8/3479 useless extension candidates. Maximal degree in co-relation 18137. Up to 3158 conditions per place. 
[2024-06-04 17:16:23,671 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 98 selfloop transitions, 30 changer transitions 0/139 dead transitions.
[2024-06-04 17:16:23,671 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 139 transitions, 1193 flow
[2024-06-04 17:16:23,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:16:23,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:16:23,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-04 17:16:23,673 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4527777777777778
[2024-06-04 17:16:23,673 INFO  L175             Difference]: Start difference. First operand has 99 places, 108 transitions, 815 flow. Second operand 8 states and 163 transitions.
[2024-06-04 17:16:23,673 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 139 transitions, 1193 flow
[2024-06-04 17:16:23,700 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 139 transitions, 1092 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-04 17:16:23,702 INFO  L231             Difference]: Finished difference. Result has 101 places, 111 transitions, 838 flow
[2024-06-04 17:16:23,702 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=838, PETRI_PLACES=101, PETRI_TRANSITIONS=111}
[2024-06-04 17:16:23,702 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 55 predicate places.
[2024-06-04 17:16:23,702 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 111 transitions, 838 flow
[2024-06-04 17:16:23,703 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:23,703 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:23,703 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:23,703 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 17:16:23,703 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:16:23,703 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:23,704 INFO  L85        PathProgramCache]: Analyzing trace with hash -1875709782, now seen corresponding path program 3 times
[2024-06-04 17:16:23,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:23,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705219773]
[2024-06-04 17:16:23,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:23,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:23,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:39,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:16:39,315 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:39,315 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705219773]
[2024-06-04 17:16:39,315 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705219773] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:39,315 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:39,315 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:16:39,315 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944387908]
[2024-06-04 17:16:39,315 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:39,316 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:16:39,316 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:39,316 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:16:39,316 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:16:39,593 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:16:39,593 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 111 transitions, 838 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,593 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:39,593 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:16:39,593 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:41,428 INFO  L124   PetriNetUnfolderBase]: 2226/3491 cut-off events.
[2024-06-04 17:16:41,428 INFO  L125   PetriNetUnfolderBase]: For 67951/67956 co-relation queries the response was YES.
[2024-06-04 17:16:41,438 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18951 conditions, 3491 events. 2226/3491 cut-off events. For 67951/67956 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17914 event pairs, 798 based on Foata normal form. 6/3495 useless extension candidates. Maximal degree in co-relation 18907. Up to 3133 conditions per place. 
[2024-06-04 17:16:41,448 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 93 selfloop transitions, 39 changer transitions 0/143 dead transitions.
[2024-06-04 17:16:41,448 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 143 transitions, 1230 flow
[2024-06-04 17:16:41,448 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:16:41,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:16:41,449 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-04 17:16:41,449 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4469135802469136
[2024-06-04 17:16:41,449 INFO  L175             Difference]: Start difference. First operand has 101 places, 111 transitions, 838 flow. Second operand 9 states and 181 transitions.
[2024-06-04 17:16:41,449 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 143 transitions, 1230 flow
[2024-06-04 17:16:41,472 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 143 transitions, 1140 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-04 17:16:41,474 INFO  L231             Difference]: Finished difference. Result has 104 places, 114 transitions, 892 flow
[2024-06-04 17:16:41,474 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=892, PETRI_PLACES=104, PETRI_TRANSITIONS=114}
[2024-06-04 17:16:41,474 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 58 predicate places.
[2024-06-04 17:16:41,474 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 114 transitions, 892 flow
[2024-06-04 17:16:41,475 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:41,475 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:41,475 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:41,475 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 17:16:41,475 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:16:41,475 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:41,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 672346587, now seen corresponding path program 2 times
[2024-06-04 17:16:41,476 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:41,476 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292603344]
[2024-06-04 17:16:41,476 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:41,476 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:41,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:56,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:16:56,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:56,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292603344]
[2024-06-04 17:16:56,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292603344] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:56,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:56,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:16:56,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085954239]
[2024-06-04 17:16:56,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:56,478 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:16:56,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:56,479 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:16:56,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:16:56,725 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:16:56,725 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 114 transitions, 892 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:56,725 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:56,725 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:16:56,725 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:58,566 INFO  L124   PetriNetUnfolderBase]: 2371/3651 cut-off events.
[2024-06-04 17:16:58,566 INFO  L125   PetriNetUnfolderBase]: For 76548/76553 co-relation queries the response was YES.
[2024-06-04 17:16:58,577 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20515 conditions, 3651 events. 2371/3651 cut-off events. For 76548/76553 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 18278 event pairs, 848 based on Foata normal form. 6/3655 useless extension candidates. Maximal degree in co-relation 20470. Up to 3285 conditions per place. 
[2024-06-04 17:16:58,590 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 99 selfloop transitions, 52 changer transitions 0/156 dead transitions.
[2024-06-04 17:16:58,590 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 156 transitions, 1584 flow
[2024-06-04 17:16:58,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:16:58,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:16:58,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-04 17:16:58,591 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4469135802469136
[2024-06-04 17:16:58,591 INFO  L175             Difference]: Start difference. First operand has 104 places, 114 transitions, 892 flow. Second operand 9 states and 181 transitions.
[2024-06-04 17:16:58,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 156 transitions, 1584 flow
[2024-06-04 17:16:58,621 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 156 transitions, 1464 flow, removed 23 selfloop flow, removed 7 redundant places.
[2024-06-04 17:16:58,624 INFO  L231             Difference]: Finished difference. Result has 106 places, 123 transitions, 1040 flow
[2024-06-04 17:16:58,624 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1040, PETRI_PLACES=106, PETRI_TRANSITIONS=123}
[2024-06-04 17:16:58,624 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 60 predicate places.
[2024-06-04 17:16:58,624 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 123 transitions, 1040 flow
[2024-06-04 17:16:58,625 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:58,625 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:58,625 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:58,625 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 17:16:58,625 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:16:58,625 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:58,626 INFO  L85        PathProgramCache]: Analyzing trace with hash -1875703830, now seen corresponding path program 1 times
[2024-06-04 17:16:58,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:58,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727390065]
[2024-06-04 17:16:58,626 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:58,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:58,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:14,558 INFO  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,559 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:14,559 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727390065]
[2024-06-04 17:17:14,559 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727390065] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:14,559 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:14,559 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:17:14,559 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297806769]
[2024-06-04 17:17:14,560 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:14,560 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:17:14,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:14,561 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:17:14,561 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:17:14,754 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:17:14,755 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 123 transitions, 1040 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:17:14,755 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:14,755 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:17:14,755 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:16,623 INFO  L124   PetriNetUnfolderBase]: 2409/3707 cut-off events.
[2024-06-04 17:17:16,624 INFO  L125   PetriNetUnfolderBase]: For 85840/85846 co-relation queries the response was YES.
[2024-06-04 17:17:16,634 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21508 conditions, 3707 events. 2409/3707 cut-off events. For 85840/85846 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 18545 event pairs, 784 based on Foata normal form. 8/3713 useless extension candidates. Maximal degree in co-relation 21462. Up to 3396 conditions per place. 
[2024-06-04 17:17:16,647 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 123 selfloop transitions, 37 changer transitions 0/165 dead transitions.
[2024-06-04 17:17:16,648 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 165 transitions, 1624 flow
[2024-06-04 17:17:16,648 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:17:16,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:17:16,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-04 17:17:16,649 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4419753086419753
[2024-06-04 17:17:16,649 INFO  L175             Difference]: Start difference. First operand has 106 places, 123 transitions, 1040 flow. Second operand 9 states and 179 transitions.
[2024-06-04 17:17:16,649 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 165 transitions, 1624 flow
[2024-06-04 17:17:16,686 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 165 transitions, 1543 flow, removed 26 selfloop flow, removed 4 redundant places.
[2024-06-04 17:17:16,688 INFO  L231             Difference]: Finished difference. Result has 112 places, 132 transitions, 1159 flow
[2024-06-04 17:17:16,688 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1159, PETRI_PLACES=112, PETRI_TRANSITIONS=132}
[2024-06-04 17:17:16,688 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 66 predicate places.
[2024-06-04 17:17:16,688 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 132 transitions, 1159 flow
[2024-06-04 17:17:16,688 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:17:16,688 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:16,688 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:16,688 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 17:17:16,689 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:16,689 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:16,689 INFO  L85        PathProgramCache]: Analyzing trace with hash -1059141085, now seen corresponding path program 3 times
[2024-06-04 17:17:16,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:16,689 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939965909]
[2024-06-04 17:17:16,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:16,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:16,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:30,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:17:30,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:30,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939965909]
[2024-06-04 17:17:30,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939965909] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:30,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:30,764 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:17:30,764 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218393999]
[2024-06-04 17:17:30,764 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:30,764 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:17:30,764 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:30,765 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:17:30,765 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:17:31,066 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:17:31,066 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 132 transitions, 1159 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:17:31,066 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:31,066 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:17:31,066 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:32,911 INFO  L124   PetriNetUnfolderBase]: 2475/3808 cut-off events.
[2024-06-04 17:17:32,911 INFO  L125   PetriNetUnfolderBase]: For 93828/93828 co-relation queries the response was YES.
[2024-06-04 17:17:32,921 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22928 conditions, 3808 events. 2475/3808 cut-off events. For 93828/93828 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19095 event pairs, 846 based on Foata normal form. 2/3808 useless extension candidates. Maximal degree in co-relation 22879. Up to 3481 conditions per place. 
[2024-06-04 17:17:32,933 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 127 selfloop transitions, 47 changer transitions 0/179 dead transitions.
[2024-06-04 17:17:32,933 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 179 transitions, 1825 flow
[2024-06-04 17:17:32,934 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:17:32,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:17:32,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-04 17:17:32,934 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41555555555555557
[2024-06-04 17:17:32,934 INFO  L175             Difference]: Start difference. First operand has 112 places, 132 transitions, 1159 flow. Second operand 10 states and 187 transitions.
[2024-06-04 17:17:32,934 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 179 transitions, 1825 flow
[2024-06-04 17:17:32,981 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 179 transitions, 1764 flow, removed 19 selfloop flow, removed 4 redundant places.
[2024-06-04 17:17:32,983 INFO  L231             Difference]: Finished difference. Result has 120 places, 149 transitions, 1404 flow
[2024-06-04 17:17:32,983 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1404, PETRI_PLACES=120, PETRI_TRANSITIONS=149}
[2024-06-04 17:17:32,983 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 74 predicate places.
[2024-06-04 17:17:32,984 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 149 transitions, 1404 flow
[2024-06-04 17:17:32,984 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:17:32,984 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:32,984 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:32,984 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 17:17:32,984 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:17:32,984 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:32,985 INFO  L85        PathProgramCache]: Analyzing trace with hash -915250338, now seen corresponding path program 2 times
[2024-06-04 17:17:32,985 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:32,985 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019458846]
[2024-06-04 17:17:32,985 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:32,985 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:33,047 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:45,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:17:45,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:45,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019458846]
[2024-06-04 17:17:45,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019458846] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:45,053 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:45,053 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:17:45,053 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273834504]
[2024-06-04 17:17:45,053 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:45,053 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:17:45,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:45,053 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:17:45,054 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:17:45,331 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:17:45,331 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 149 transitions, 1404 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:17:45,331 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:45,331 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:17:45,331 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:47,272 INFO  L124   PetriNetUnfolderBase]: 2497/3843 cut-off events.
[2024-06-04 17:17:47,272 INFO  L125   PetriNetUnfolderBase]: For 101962/101962 co-relation queries the response was YES.
[2024-06-04 17:17:47,284 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23645 conditions, 3843 events. 2497/3843 cut-off events. For 101962/101962 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19267 event pairs, 846 based on Foata normal form. 4/3845 useless extension candidates. Maximal degree in co-relation 23592. Up to 3572 conditions per place. 
[2024-06-04 17:17:47,297 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 146 selfloop transitions, 27 changer transitions 0/178 dead transitions.
[2024-06-04 17:17:47,297 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 178 transitions, 1958 flow
[2024-06-04 17:17:47,298 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:17:47,298 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:17:47,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-04 17:17:47,298 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4388888888888889
[2024-06-04 17:17:47,298 INFO  L175             Difference]: Start difference. First operand has 120 places, 149 transitions, 1404 flow. Second operand 8 states and 158 transitions.
[2024-06-04 17:17:47,298 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 178 transitions, 1958 flow
[2024-06-04 17:17:47,358 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 178 transitions, 1848 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-04 17:17:47,361 INFO  L231             Difference]: Finished difference. Result has 122 places, 152 transitions, 1406 flow
[2024-06-04 17:17:47,361 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1406, PETRI_PLACES=122, PETRI_TRANSITIONS=152}
[2024-06-04 17:17:47,361 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 76 predicate places.
[2024-06-04 17:17:47,361 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 152 transitions, 1406 flow
[2024-06-04 17:17:47,361 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:17:47,362 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:47,362 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:47,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 17:17:47,362 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:17:47,362 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:47,362 INFO  L85        PathProgramCache]: Analyzing trace with hash -1700807111, now seen corresponding path program 4 times
[2024-06-04 17:17:47,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:47,363 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768495264]
[2024-06-04 17:17:47,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:47,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:47,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:02,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:18:02,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:02,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768495264]
[2024-06-04 17:18:02,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768495264] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:02,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:02,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:18:02,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476492502]
[2024-06-04 17:18:02,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:02,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:18:02,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:02,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:18:02,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:18:02,296 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:18:02,296 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 152 transitions, 1406 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:18:02,297 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:02,297 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:18:02,297 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:04,195 INFO  L124   PetriNetUnfolderBase]: 2524/3882 cut-off events.
[2024-06-04 17:18:04,195 INFO  L125   PetriNetUnfolderBase]: For 109553/109553 co-relation queries the response was YES.
[2024-06-04 17:18:04,208 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24213 conditions, 3882 events. 2524/3882 cut-off events. For 109553/109553 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19502 event pairs, 846 based on Foata normal form. 2/3882 useless extension candidates. Maximal degree in co-relation 24159. Up to 3627 conditions per place. 
[2024-06-04 17:18:04,222 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 149 selfloop transitions, 30 changer transitions 0/184 dead transitions.
[2024-06-04 17:18:04,223 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 184 transitions, 2128 flow
[2024-06-04 17:18:04,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:18:04,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:18:04,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-04 17:18:04,224 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4388888888888889
[2024-06-04 17:18:04,224 INFO  L175             Difference]: Start difference. First operand has 122 places, 152 transitions, 1406 flow. Second operand 8 states and 158 transitions.
[2024-06-04 17:18:04,224 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 184 transitions, 2128 flow
[2024-06-04 17:18:04,285 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 184 transitions, 2026 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-04 17:18:04,287 INFO  L231             Difference]: Finished difference. Result has 124 places, 158 transitions, 1484 flow
[2024-06-04 17:18:04,287 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1484, PETRI_PLACES=124, PETRI_TRANSITIONS=158}
[2024-06-04 17:18:04,287 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 78 predicate places.
[2024-06-04 17:18:04,288 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 158 transitions, 1484 flow
[2024-06-04 17:18:04,288 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:18:04,288 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:04,288 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:04,288 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 17:18:04,288 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:04,288 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:04,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -679599803, now seen corresponding path program 5 times
[2024-06-04 17:18:04,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:04,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736631452]
[2024-06-04 17:18:04,289 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:04,289 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:04,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:18,935 INFO  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:18,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:18,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736631452]
[2024-06-04 17:18:18,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736631452] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:18,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:18,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:18:18,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724030091]
[2024-06-04 17:18:18,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:18,936 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:18:18,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:18,936 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:18:18,936 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:18:19,180 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:18:19,181 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 158 transitions, 1484 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:18:19,181 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:19,181 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:18:19,181 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:21,172 INFO  L124   PetriNetUnfolderBase]: 2519/3870 cut-off events.
[2024-06-04 17:18:21,172 INFO  L125   PetriNetUnfolderBase]: For 115596/115596 co-relation queries the response was YES.
[2024-06-04 17:18:21,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24336 conditions, 3870 events. 2519/3870 cut-off events. For 115596/115596 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19372 event pairs, 846 based on Foata normal form. 2/3870 useless extension candidates. Maximal degree in co-relation 24281. Up to 3622 conditions per place. 
[2024-06-04 17:18:21,198 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 146 selfloop transitions, 31 changer transitions 0/182 dead transitions.
[2024-06-04 17:18:21,198 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 182 transitions, 1996 flow
[2024-06-04 17:18:21,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:18:21,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:18:21,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-04 17:18:21,199 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4305555555555556
[2024-06-04 17:18:21,199 INFO  L175             Difference]: Start difference. First operand has 124 places, 158 transitions, 1484 flow. Second operand 8 states and 155 transitions.
[2024-06-04 17:18:21,199 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 182 transitions, 1996 flow
[2024-06-04 17:18:21,249 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 182 transitions, 1850 flow, removed 43 selfloop flow, removed 5 redundant places.
[2024-06-04 17:18:21,252 INFO  L231             Difference]: Finished difference. Result has 127 places, 158 transitions, 1408 flow
[2024-06-04 17:18:21,252 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1408, PETRI_PLACES=127, PETRI_TRANSITIONS=158}
[2024-06-04 17:18:21,252 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 81 predicate places.
[2024-06-04 17:18:21,252 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 158 transitions, 1408 flow
[2024-06-04 17:18:21,253 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:18:21,253 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:21,253 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:21,253 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 17:18:21,253 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:21,253 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:21,254 INFO  L85        PathProgramCache]: Analyzing trace with hash -679599958, now seen corresponding path program 4 times
[2024-06-04 17:18:21,254 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:21,254 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386292343]
[2024-06-04 17:18:21,254 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:21,254 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:21,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:36,606 INFO  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:36,607 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:36,607 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386292343]
[2024-06-04 17:18:36,607 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386292343] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:36,607 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:36,607 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:18:36,607 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599735291]
[2024-06-04 17:18:36,607 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:36,607 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:18:36,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:36,608 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:18:36,608 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:18:36,957 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:18:36,958 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 158 transitions, 1408 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:36,958 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:36,958 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:18:36,958 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:38,929 INFO  L124   PetriNetUnfolderBase]: 2403/3765 cut-off events.
[2024-06-04 17:18:38,929 INFO  L125   PetriNetUnfolderBase]: For 122649/122649 co-relation queries the response was YES.
[2024-06-04 17:18:38,943 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23930 conditions, 3765 events. 2403/3765 cut-off events. For 122649/122649 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19364 event pairs, 800 based on Foata normal form. 2/3765 useless extension candidates. Maximal degree in co-relation 23874. Up to 3440 conditions per place. 
[2024-06-04 17:18:38,955 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 145 selfloop transitions, 18 changer transitions 0/183 dead transitions.
[2024-06-04 17:18:38,956 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 183 transitions, 1852 flow
[2024-06-04 17:18:38,956 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:18:38,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:18:38,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-04 17:18:38,957 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4361111111111111
[2024-06-04 17:18:38,957 INFO  L175             Difference]: Start difference. First operand has 127 places, 158 transitions, 1408 flow. Second operand 8 states and 157 transitions.
[2024-06-04 17:18:38,957 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 183 transitions, 1852 flow
[2024-06-04 17:18:39,011 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 183 transitions, 1788 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-04 17:18:39,013 INFO  L231             Difference]: Finished difference. Result has 129 places, 161 transitions, 1456 flow
[2024-06-04 17:18:39,013 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1456, PETRI_PLACES=129, PETRI_TRANSITIONS=161}
[2024-06-04 17:18:39,014 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 83 predicate places.
[2024-06-04 17:18:39,014 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 161 transitions, 1456 flow
[2024-06-04 17:18:39,014 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:39,014 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:39,014 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:39,014 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 17:18:39,014 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:39,014 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:39,015 INFO  L85        PathProgramCache]: Analyzing trace with hash -679392196, now seen corresponding path program 3 times
[2024-06-04 17:18:39,015 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:39,015 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325814445]
[2024-06-04 17:18:39,015 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:39,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:39,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:53,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:18:53,847 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:53,847 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325814445]
[2024-06-04 17:18:53,847 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325814445] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:53,847 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:53,847 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:18:53,847 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070361249]
[2024-06-04 17:18:53,847 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:53,848 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:18:53,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:53,848 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:18:53,848 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:18:54,053 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:18:54,054 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 161 transitions, 1456 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:18:54,054 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:54,054 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:18:54,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:56,087 INFO  L124   PetriNetUnfolderBase]: 2552/3924 cut-off events.
[2024-06-04 17:18:56,087 INFO  L125   PetriNetUnfolderBase]: For 134357/134357 co-relation queries the response was YES.
[2024-06-04 17:18:56,099 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25495 conditions, 3924 events. 2552/3924 cut-off events. For 134357/134357 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19724 event pairs, 850 based on Foata normal form. 4/3926 useless extension candidates. Maximal degree in co-relation 25438. Up to 3675 conditions per place. 
[2024-06-04 17:18:56,113 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 162 selfloop transitions, 23 changer transitions 0/190 dead transitions.
[2024-06-04 17:18:56,113 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 190 transitions, 2048 flow
[2024-06-04 17:18:56,113 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:18:56,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:18:56,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-04 17:18:56,114 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-04 17:18:56,114 INFO  L175             Difference]: Start difference. First operand has 129 places, 161 transitions, 1456 flow. Second operand 8 states and 156 transitions.
[2024-06-04 17:18:56,114 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 190 transitions, 2048 flow
[2024-06-04 17:18:56,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 190 transitions, 1960 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-04 17:18:56,178 INFO  L231             Difference]: Finished difference. Result has 131 places, 164 transitions, 1470 flow
[2024-06-04 17:18:56,178 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1470, PETRI_PLACES=131, PETRI_TRANSITIONS=164}
[2024-06-04 17:18:56,178 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 85 predicate places.
[2024-06-04 17:18:56,178 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 164 transitions, 1470 flow
[2024-06-04 17:18:56,179 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:18:56,179 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:56,179 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:56,179 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 17:18:56,179 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:18:56,180 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:56,180 INFO  L85        PathProgramCache]: Analyzing trace with hash -1693455461, now seen corresponding path program 6 times
[2024-06-04 17:18:56,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:56,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664064492]
[2024-06-04 17:18:56,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:56,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:56,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:19:10,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:19:10,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:19:10,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664064492]
[2024-06-04 17:19:10,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664064492] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:19:10,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:19:10,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:19:10,472 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712491973]
[2024-06-04 17:19:10,472 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:19:10,472 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:19:10,472 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:19:10,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:19:10,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:19:10,716 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:19:10,716 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 164 transitions, 1470 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:19:10,716 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:19:10,716 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:19:10,717 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:19:12,720 INFO  L124   PetriNetUnfolderBase]: 2547/3917 cut-off events.
[2024-06-04 17:19:12,720 INFO  L125   PetriNetUnfolderBase]: For 141055/141055 co-relation queries the response was YES.
[2024-06-04 17:19:12,733 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25687 conditions, 3917 events. 2547/3917 cut-off events. For 141055/141055 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19654 event pairs, 850 based on Foata normal form. 2/3917 useless extension candidates. Maximal degree in co-relation 25629. Up to 3710 conditions per place. 
[2024-06-04 17:19:12,747 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 163 selfloop transitions, 18 changer transitions 0/186 dead transitions.
[2024-06-04 17:19:12,747 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 186 transitions, 1888 flow
[2024-06-04 17:19:12,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:19:12,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:19:12,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-04 17:19:12,748 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-04 17:19:12,748 INFO  L175             Difference]: Start difference. First operand has 131 places, 164 transitions, 1470 flow. Second operand 8 states and 150 transitions.
[2024-06-04 17:19:12,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 186 transitions, 1888 flow
[2024-06-04 17:19:12,812 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 186 transitions, 1764 flow, removed 37 selfloop flow, removed 6 redundant places.
[2024-06-04 17:19:12,814 INFO  L231             Difference]: Finished difference. Result has 133 places, 164 transitions, 1390 flow
[2024-06-04 17:19:12,815 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1390, PETRI_PLACES=133, PETRI_TRANSITIONS=164}
[2024-06-04 17:19:12,815 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 87 predicate places.
[2024-06-04 17:19:12,816 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 164 transitions, 1390 flow
[2024-06-04 17:19:12,816 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:19:12,816 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:19:12,816 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:19:12,816 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 17:19:12,816 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:12,817 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:19:12,817 INFO  L85        PathProgramCache]: Analyzing trace with hash -671975446, now seen corresponding path program 4 times
[2024-06-04 17:19:12,817 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:19:12,817 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904550642]
[2024-06-04 17:19:12,817 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:19:12,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:19:12,864 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:19:27,156 INFO  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:27,157 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:19:27,157 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904550642]
[2024-06-04 17:19:27,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904550642] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:19:27,157 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:19:27,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:19:27,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102036803]
[2024-06-04 17:19:27,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:19:27,157 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:19:27,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:19:27,158 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:19:27,158 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:19:27,385 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:19:27,386 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 164 transitions, 1390 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:19:27,386 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:19:27,386 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:19:27,386 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:19:29,360 INFO  L124   PetriNetUnfolderBase]: 2537/3903 cut-off events.
[2024-06-04 17:19:29,361 INFO  L125   PetriNetUnfolderBase]: For 147736/147736 co-relation queries the response was YES.
[2024-06-04 17:19:29,374 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25628 conditions, 3903 events. 2537/3903 cut-off events. For 147736/147736 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19565 event pairs, 848 based on Foata normal form. 4/3905 useless extension candidates. Maximal degree in co-relation 25569. Up to 3687 conditions per place. 
[2024-06-04 17:19:29,387 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 164 selfloop transitions, 18 changer transitions 0/187 dead transitions.
[2024-06-04 17:19:29,388 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 187 transitions, 1814 flow
[2024-06-04 17:19:29,388 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:19:29,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:19:29,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-04 17:19:29,388 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41944444444444445
[2024-06-04 17:19:29,389 INFO  L175             Difference]: Start difference. First operand has 133 places, 164 transitions, 1390 flow. Second operand 8 states and 151 transitions.
[2024-06-04 17:19:29,389 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 187 transitions, 1814 flow
[2024-06-04 17:19:29,462 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 187 transitions, 1730 flow, removed 14 selfloop flow, removed 8 redundant places.
[2024-06-04 17:19:29,464 INFO  L231             Difference]: Finished difference. Result has 133 places, 164 transitions, 1350 flow
[2024-06-04 17:19:29,464 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1350, PETRI_PLACES=133, PETRI_TRANSITIONS=164}
[2024-06-04 17:19:29,464 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 87 predicate places.
[2024-06-04 17:19:29,464 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 164 transitions, 1350 flow
[2024-06-04 17:19:29,465 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:19:29,465 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:19:29,465 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:19:29,465 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 17:19:29,465 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:29,466 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:19:29,466 INFO  L85        PathProgramCache]: Analyzing trace with hash -1344681486, now seen corresponding path program 5 times
[2024-06-04 17:19:29,466 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:19:29,466 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303185645]
[2024-06-04 17:19:29,466 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:19:29,466 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:19:29,507 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:19:47,220 INFO  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:47,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:19:47,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303185645]
[2024-06-04 17:19:47,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303185645] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:19:47,221 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:19:47,221 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:19:47,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389861964]
[2024-06-04 17:19:47,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:19:47,221 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:19:47,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:19:47,221 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:19:47,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:19:47,464 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:19:47,464 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 164 transitions, 1350 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:19:47,464 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:19:47,464 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:19:47,464 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:19:49,530 INFO  L124   PetriNetUnfolderBase]: 2503/3907 cut-off events.
[2024-06-04 17:19:49,530 INFO  L125   PetriNetUnfolderBase]: For 155411/155422 co-relation queries the response was YES.
[2024-06-04 17:19:49,545 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25855 conditions, 3907 events. 2503/3907 cut-off events. For 155411/155422 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 20149 event pairs, 750 based on Foata normal form. 10/3915 useless extension candidates. Maximal degree in co-relation 25795. Up to 3512 conditions per place. 
[2024-06-04 17:19:49,558 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 162 selfloop transitions, 50 changer transitions 0/232 dead transitions.
[2024-06-04 17:19:49,559 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 232 transitions, 2169 flow
[2024-06-04 17:19:49,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:19:49,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:19:49,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-04 17:19:49,560 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4488888888888889
[2024-06-04 17:19:49,560 INFO  L175             Difference]: Start difference. First operand has 133 places, 164 transitions, 1350 flow. Second operand 10 states and 202 transitions.
[2024-06-04 17:19:49,560 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 232 transitions, 2169 flow
[2024-06-04 17:19:49,620 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 232 transitions, 2121 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-04 17:19:49,623 INFO  L231             Difference]: Finished difference. Result has 139 places, 196 transitions, 1797 flow
[2024-06-04 17:19:49,623 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1797, PETRI_PLACES=139, PETRI_TRANSITIONS=196}
[2024-06-04 17:19:49,623 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 93 predicate places.
[2024-06-04 17:19:49,623 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 196 transitions, 1797 flow
[2024-06-04 17:19:49,624 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:19:49,624 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:19:49,624 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:19:49,624 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 17:19:49,624 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:49,624 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:19:49,624 INFO  L85        PathProgramCache]: Analyzing trace with hash -1718293940, now seen corresponding path program 6 times
[2024-06-04 17:19:49,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:19:49,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288591826]
[2024-06-04 17:19:49,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:19:49,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:19:49,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:20:06,452 INFO  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:06,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:20:06,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288591826]
[2024-06-04 17:20:06,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288591826] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:20:06,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:20:06,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:20:06,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210665465]
[2024-06-04 17:20:06,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:20:06,453 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:20:06,453 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:20:06,453 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:20:06,453 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:20:06,789 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:20:06,790 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 196 transitions, 1797 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:20:06,790 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:20:06,790 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:20:06,790 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:20:08,871 INFO  L124   PetriNetUnfolderBase]: 2603/4056 cut-off events.
[2024-06-04 17:20:08,871 INFO  L125   PetriNetUnfolderBase]: For 168518/168528 co-relation queries the response was YES.
[2024-06-04 17:20:08,887 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27894 conditions, 4056 events. 2603/4056 cut-off events. For 168518/168528 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 20936 event pairs, 754 based on Foata normal form. 10/4064 useless extension candidates. Maximal degree in co-relation 27830. Up to 3627 conditions per place. 
[2024-06-04 17:20:08,902 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 180 selfloop transitions, 73 changer transitions 0/273 dead transitions.
[2024-06-04 17:20:08,902 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 273 transitions, 2954 flow
[2024-06-04 17:20:08,902 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:20:08,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:20:08,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-04 17:20:08,903 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4488888888888889
[2024-06-04 17:20:08,903 INFO  L175             Difference]: Start difference. First operand has 139 places, 196 transitions, 1797 flow. Second operand 10 states and 202 transitions.
[2024-06-04 17:20:08,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 273 transitions, 2954 flow
[2024-06-04 17:20:09,015 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 273 transitions, 2746 flow, removed 57 selfloop flow, removed 5 redundant places.
[2024-06-04 17:20:09,018 INFO  L231             Difference]: Finished difference. Result has 148 places, 240 transitions, 2436 flow
[2024-06-04 17:20:09,018 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2436, PETRI_PLACES=148, PETRI_TRANSITIONS=240}
[2024-06-04 17:20:09,019 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 102 predicate places.
[2024-06-04 17:20:09,019 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 240 transitions, 2436 flow
[2024-06-04 17:20:09,019 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:20:09,019 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:20:09,019 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:20:09,019 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 17:20:09,019 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:20:09,019 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:20:09,020 INFO  L85        PathProgramCache]: Analyzing trace with hash -489374832, now seen corresponding path program 7 times
[2024-06-04 17:20:09,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:20:09,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697290333]
[2024-06-04 17:20:09,020 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:20:09,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:20:09,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:20:25,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:20:25,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:20:25,832 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697290333]
[2024-06-04 17:20:25,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697290333] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:20:25,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:20:25,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:20:25,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162801013]
[2024-06-04 17:20:25,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:20:25,833 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:20:25,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:20:25,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:20:25,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:20:26,065 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:20:26,066 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 240 transitions, 2436 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:20:26,066 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:20:26,066 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:20:26,066 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:20:28,180 INFO  L124   PetriNetUnfolderBase]: 2639/4116 cut-off events.
[2024-06-04 17:20:28,180 INFO  L125   PetriNetUnfolderBase]: For 180172/180182 co-relation queries the response was YES.
[2024-06-04 17:20:28,196 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29123 conditions, 4116 events. 2639/4116 cut-off events. For 180172/180182 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 21357 event pairs, 762 based on Foata normal form. 10/4124 useless extension candidates. Maximal degree in co-relation 29054. Up to 3671 conditions per place. 
[2024-06-04 17:20:28,212 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 196 selfloop transitions, 80 changer transitions 0/296 dead transitions.
[2024-06-04 17:20:28,212 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 296 transitions, 3440 flow
[2024-06-04 17:20:28,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:20:28,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:20:28,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions.
[2024-06-04 17:20:28,213 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4567901234567901
[2024-06-04 17:20:28,213 INFO  L175             Difference]: Start difference. First operand has 148 places, 240 transitions, 2436 flow. Second operand 9 states and 185 transitions.
[2024-06-04 17:20:28,213 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 296 transitions, 3440 flow
[2024-06-04 17:20:28,311 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 296 transitions, 3238 flow, removed 57 selfloop flow, removed 4 redundant places.
[2024-06-04 17:20:28,314 INFO  L231             Difference]: Finished difference. Result has 154 places, 264 transitions, 2816 flow
[2024-06-04 17:20:28,314 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2295, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2816, PETRI_PLACES=154, PETRI_TRANSITIONS=264}
[2024-06-04 17:20:28,314 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 108 predicate places.
[2024-06-04 17:20:28,314 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 264 transitions, 2816 flow
[2024-06-04 17:20:28,315 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:20:28,315 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:20:28,315 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:20:28,315 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 17:20:28,315 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:20:28,315 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:20:28,315 INFO  L85        PathProgramCache]: Analyzing trace with hash -1714478925, now seen corresponding path program 7 times
[2024-06-04 17:20:28,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:20:28,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555446604]
[2024-06-04 17:20:28,315 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:20:28,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:20:28,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:20:48,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:20:48,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:20:48,256 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555446604]
[2024-06-04 17:20:48,257 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555446604] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:20:48,257 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:20:48,257 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:20:48,257 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794719742]
[2024-06-04 17:20:48,257 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:20:48,257 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:20:48,257 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:20:48,258 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:20:48,258 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:20:48,476 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:20:48,477 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 264 transitions, 2816 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:20:48,477 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:20:48,477 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:20:48,477 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:20:50,603 INFO  L124   PetriNetUnfolderBase]: 2803/4292 cut-off events.
[2024-06-04 17:20:50,603 INFO  L125   PetriNetUnfolderBase]: For 191944/191954 co-relation queries the response was YES.
[2024-06-04 17:20:50,619 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30900 conditions, 4292 events. 2803/4292 cut-off events. For 191944/191954 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 21644 event pairs, 816 based on Foata normal form. 10/4300 useless extension candidates. Maximal degree in co-relation 30829. Up to 3926 conditions per place. 
[2024-06-04 17:20:50,634 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 221 selfloop transitions, 84 changer transitions 0/310 dead transitions.
[2024-06-04 17:20:50,634 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 310 transitions, 3685 flow
[2024-06-04 17:20:50,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:20:50,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:20:50,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-04 17:20:50,635 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43209876543209874
[2024-06-04 17:20:50,635 INFO  L175             Difference]: Start difference. First operand has 154 places, 264 transitions, 2816 flow. Second operand 9 states and 175 transitions.
[2024-06-04 17:20:50,635 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 310 transitions, 3685 flow
[2024-06-04 17:20:50,753 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 310 transitions, 3447 flow, removed 49 selfloop flow, removed 6 redundant places.
[2024-06-04 17:20:50,756 INFO  L231             Difference]: Finished difference. Result has 159 places, 281 transitions, 2996 flow
[2024-06-04 17:20:50,757 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2578, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2996, PETRI_PLACES=159, PETRI_TRANSITIONS=281}
[2024-06-04 17:20:50,757 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 113 predicate places.
[2024-06-04 17:20:50,757 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 281 transitions, 2996 flow
[2024-06-04 17:20:50,757 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:20:50,757 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:20:50,757 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:20:50,757 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 17:20:50,757 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:50,758 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:20:50,758 INFO  L85        PathProgramCache]: Analyzing trace with hash -453721062, now seen corresponding path program 1 times
[2024-06-04 17:20:50,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:20:50,758 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30218434]
[2024-06-04 17:20:50,758 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:20:50,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:20:50,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:21:12,808 INFO  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:12,808 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:21:12,808 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30218434]
[2024-06-04 17:21:12,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30218434] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:21:12,808 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:21:12,808 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:21:12,808 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638566322]
[2024-06-04 17:21:12,808 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:21:12,809 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:21:12,809 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:21:12,809 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:21:12,809 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:21:12,927 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:21:12,928 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 281 transitions, 2996 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:21:12,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:21:12,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:21:12,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:21:15,466 INFO  L124   PetriNetUnfolderBase]: 3108/4749 cut-off events.
[2024-06-04 17:21:15,466 INFO  L125   PetriNetUnfolderBase]: For 258453/258468 co-relation queries the response was YES.
[2024-06-04 17:21:15,486 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35784 conditions, 4749 events. 3108/4749 cut-off events. For 258453/258468 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 24182 event pairs, 1160 based on Foata normal form. 10/4750 useless extension candidates. Maximal degree in co-relation 35710. Up to 4496 conditions per place. 
[2024-06-04 17:21:15,505 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 242 selfloop transitions, 12 changer transitions 0/292 dead transitions.
[2024-06-04 17:21:15,506 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 292 transitions, 3556 flow
[2024-06-04 17:21:15,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:21:15,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:21:15,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-04 17:21:15,506 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40370370370370373
[2024-06-04 17:21:15,507 INFO  L175             Difference]: Start difference. First operand has 159 places, 281 transitions, 2996 flow. Second operand 6 states and 109 transitions.
[2024-06-04 17:21:15,507 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 292 transitions, 3556 flow
[2024-06-04 17:21:15,631 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 292 transitions, 3429 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-04 17:21:15,634 INFO  L231             Difference]: Finished difference. Result has 159 places, 284 transitions, 2931 flow
[2024-06-04 17:21:15,634 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2869, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2931, PETRI_PLACES=159, PETRI_TRANSITIONS=284}
[2024-06-04 17:21:15,635 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 113 predicate places.
[2024-06-04 17:21:15,635 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 284 transitions, 2931 flow
[2024-06-04 17:21:15,635 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:21:15,635 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:21:15,635 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:21:15,635 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 17:21:15,635 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:21:15,635 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:21:15,635 INFO  L85        PathProgramCache]: Analyzing trace with hash 1864392296, now seen corresponding path program 1 times
[2024-06-04 17:21:15,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:21:15,635 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721354836]
[2024-06-04 17:21:15,635 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:21:15,636 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:21:15,693 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:21:33,054 INFO  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,054 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:21:33,054 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721354836]
[2024-06-04 17:21:33,054 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721354836] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:21:33,054 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:21:33,054 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:21:33,054 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376722664]
[2024-06-04 17:21:33,054 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:21:33,055 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:21:33,055 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:21:33,055 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:21:33,055 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:21:33,469 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:21:33,470 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 284 transitions, 2931 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:33,470 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:21:33,470 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:21:33,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:21:35,963 INFO  L124   PetriNetUnfolderBase]: 2788/4318 cut-off events.
[2024-06-04 17:21:35,963 INFO  L125   PetriNetUnfolderBase]: For 242930/242938 co-relation queries the response was YES.
[2024-06-04 17:21:35,981 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33509 conditions, 4318 events. 2788/4318 cut-off events. For 242930/242938 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 22481 event pairs, 600 based on Foata normal form. 10/4326 useless extension candidates. Maximal degree in co-relation 33434. Up to 3562 conditions per place. 
[2024-06-04 17:21:35,998 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 175 selfloop transitions, 128 changer transitions 0/328 dead transitions.
[2024-06-04 17:21:35,999 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 328 transitions, 3953 flow
[2024-06-04 17:21:36,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:21:36,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:21:36,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 206 transitions.
[2024-06-04 17:21:36,002 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4577777777777778
[2024-06-04 17:21:36,002 INFO  L175             Difference]: Start difference. First operand has 159 places, 284 transitions, 2931 flow. Second operand 10 states and 206 transitions.
[2024-06-04 17:21:36,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 328 transitions, 3953 flow
[2024-06-04 17:21:36,138 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 328 transitions, 3913 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-04 17:21:36,142 INFO  L231             Difference]: Finished difference. Result has 165 places, 288 transitions, 3294 flow
[2024-06-04 17:21:36,142 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2891, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3294, PETRI_PLACES=165, PETRI_TRANSITIONS=288}
[2024-06-04 17:21:36,143 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 119 predicate places.
[2024-06-04 17:21:36,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 288 transitions, 3294 flow
[2024-06-04 17:21:36,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:36,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:21:36,143 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:21:36,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 17:21:36,143 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:21:36,143 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:21:36,144 INFO  L85        PathProgramCache]: Analyzing trace with hash 1864452870, now seen corresponding path program 1 times
[2024-06-04 17:21:36,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:21:36,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220080993]
[2024-06-04 17:21:36,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:21:36,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:21:36,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:21:54,050 INFO  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:54,050 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:21:54,051 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220080993]
[2024-06-04 17:21:54,051 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220080993] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:21:54,051 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:21:54,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:21:54,051 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116116600]
[2024-06-04 17:21:54,051 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:21:54,051 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:21:54,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:21:54,052 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:21:54,052 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:21:54,378 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:21:54,378 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 288 transitions, 3294 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:21:54,378 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:21:54,378 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:21:54,378 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:21:56,938 INFO  L124   PetriNetUnfolderBase]: 2934/4466 cut-off events.
[2024-06-04 17:21:56,938 INFO  L125   PetriNetUnfolderBase]: For 257912/257918 co-relation queries the response was YES.
[2024-06-04 17:21:56,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35449 conditions, 4466 events. 2934/4466 cut-off events. For 257912/257918 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 22663 event pairs, 780 based on Foata normal form. 6/4470 useless extension candidates. Maximal degree in co-relation 35373. Up to 3888 conditions per place. 
[2024-06-04 17:21:56,975 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 181 selfloop transitions, 144 changer transitions 0/331 dead transitions.
[2024-06-04 17:21:56,975 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 331 transitions, 4170 flow
[2024-06-04 17:21:56,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 17:21:56,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 17:21:56,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions.
[2024-06-04 17:21:56,978 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42424242424242425
[2024-06-04 17:21:56,978 INFO  L175             Difference]: Start difference. First operand has 165 places, 288 transitions, 3294 flow. Second operand 11 states and 210 transitions.
[2024-06-04 17:21:56,979 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 331 transitions, 4170 flow
[2024-06-04 17:21:57,142 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 331 transitions, 3940 flow, removed 41 selfloop flow, removed 6 redundant places.
[2024-06-04 17:21:57,146 INFO  L231             Difference]: Finished difference. Result has 170 places, 291 transitions, 3458 flow
[2024-06-04 17:21:57,146 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3064, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3458, PETRI_PLACES=170, PETRI_TRANSITIONS=291}
[2024-06-04 17:21:57,146 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 124 predicate places.
[2024-06-04 17:21:57,146 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 291 transitions, 3458 flow
[2024-06-04 17:21:57,147 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:21:57,147 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:21:57,147 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:21:57,147 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 17:21:57,147 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:57,147 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:21:57,147 INFO  L85        PathProgramCache]: Analyzing trace with hash -447356308, now seen corresponding path program 2 times
[2024-06-04 17:21:57,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:21:57,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580822931]
[2024-06-04 17:21:57,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:21:57,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:21:57,196 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:22:13,753 INFO  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:13,754 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:22:13,754 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580822931]
[2024-06-04 17:22:13,754 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580822931] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:22:13,754 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:22:13,754 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:22:13,754 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830384166]
[2024-06-04 17:22:13,754 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:22:13,754 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:22:13,755 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:22:13,755 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:22:13,755 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:22:13,966 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:22:13,966 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 291 transitions, 3458 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:13,966 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:22:13,966 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:22:13,966 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:22:16,480 INFO  L124   PetriNetUnfolderBase]: 2822/4366 cut-off events.
[2024-06-04 17:22:16,480 INFO  L125   PetriNetUnfolderBase]: For 274876/274882 co-relation queries the response was YES.
[2024-06-04 17:22:16,501 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35621 conditions, 4366 events. 2822/4366 cut-off events. For 274876/274882 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 22706 event pairs, 745 based on Foata normal form. 8/4372 useless extension candidates. Maximal degree in co-relation 35543. Up to 3724 conditions per place. 
[2024-06-04 17:22:16,520 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 170 selfloop transitions, 134 changer transitions 0/330 dead transitions.
[2024-06-04 17:22:16,520 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 330 transitions, 4258 flow
[2024-06-04 17:22:16,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:22:16,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:22:16,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions.
[2024-06-04 17:22:16,521 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45111111111111113
[2024-06-04 17:22:16,521 INFO  L175             Difference]: Start difference. First operand has 170 places, 291 transitions, 3458 flow. Second operand 10 states and 203 transitions.
[2024-06-04 17:22:16,521 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 330 transitions, 4258 flow
[2024-06-04 17:22:16,680 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 330 transitions, 3924 flow, removed 34 selfloop flow, removed 9 redundant places.
[2024-06-04 17:22:16,684 INFO  L231             Difference]: Finished difference. Result has 171 places, 293 transitions, 3466 flow
[2024-06-04 17:22:16,684 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3124, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3466, PETRI_PLACES=171, PETRI_TRANSITIONS=293}
[2024-06-04 17:22:16,684 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 125 predicate places.
[2024-06-04 17:22:16,684 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 293 transitions, 3466 flow
[2024-06-04 17:22:16,685 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:16,685 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:22:16,685 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:22:16,685 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 17:22:16,685 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:22:16,685 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:22:16,685 INFO  L85        PathProgramCache]: Analyzing trace with hash 1867254216, now seen corresponding path program 1 times
[2024-06-04 17:22:16,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:22:16,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893509086]
[2024-06-04 17:22:16,686 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:22:16,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:22:16,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:22:32,456 INFO  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:32,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:22:32,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893509086]
[2024-06-04 17:22:32,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893509086] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:22:32,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:22:32,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:22:32,457 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807104675]
[2024-06-04 17:22:32,457 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:22:32,457 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:22:32,457 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:22:32,457 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:22:32,458 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:22:32,721 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:22:32,722 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 293 transitions, 3466 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:22:32,722 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:22:32,722 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:22:32,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:22:35,163 INFO  L124   PetriNetUnfolderBase]: 2976/4537 cut-off events.
[2024-06-04 17:22:35,163 INFO  L125   PetriNetUnfolderBase]: For 292468/292471 co-relation queries the response was YES.
[2024-06-04 17:22:35,184 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37077 conditions, 4537 events. 2976/4537 cut-off events. For 292468/292471 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 23130 event pairs, 784 based on Foata normal form. 6/4539 useless extension candidates. Maximal degree in co-relation 36998. Up to 4176 conditions per place. 
[2024-06-04 17:22:35,203 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 256 selfloop transitions, 65 changer transitions 0/327 dead transitions.
[2024-06-04 17:22:35,203 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 327 transitions, 4292 flow
[2024-06-04 17:22:35,206 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:22:35,206 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:22:35,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-04 17:22:35,206 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42962962962962964
[2024-06-04 17:22:35,206 INFO  L175             Difference]: Start difference. First operand has 171 places, 293 transitions, 3466 flow. Second operand 9 states and 174 transitions.
[2024-06-04 17:22:35,206 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 327 transitions, 4292 flow
[2024-06-04 17:22:35,355 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 327 transitions, 3990 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-04 17:22:35,359 INFO  L231             Difference]: Finished difference. Result has 172 places, 296 transitions, 3376 flow
[2024-06-04 17:22:35,359 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3164, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3376, PETRI_PLACES=172, PETRI_TRANSITIONS=296}
[2024-06-04 17:22:35,360 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 126 predicate places.
[2024-06-04 17:22:35,360 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 296 transitions, 3376 flow
[2024-06-04 17:22:35,360 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:22:35,360 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:22:35,360 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:22:35,360 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 17:22:35,360 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:22:35,361 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:22:35,361 INFO  L85        PathProgramCache]: Analyzing trace with hash -636564214, now seen corresponding path program 3 times
[2024-06-04 17:22:35,361 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:22:35,361 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224161500]
[2024-06-04 17:22:35,361 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:22:35,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:22:35,407 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:22:51,081 INFO  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:51,082 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:22:51,082 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224161500]
[2024-06-04 17:22:51,082 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224161500] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:22:51,082 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:22:51,082 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:22:51,082 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679248045]
[2024-06-04 17:22:51,082 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:22:51,082 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:22:51,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:22:51,082 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:22:51,083 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:22:51,536 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:22:51,537 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 296 transitions, 3376 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:51,537 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:22:51,537 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:22:51,537 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:22:53,892 INFO  L124   PetriNetUnfolderBase]: 2835/4391 cut-off events.
[2024-06-04 17:22:53,892 INFO  L125   PetriNetUnfolderBase]: For 301460/301463 co-relation queries the response was YES.
[2024-06-04 17:22:53,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36353 conditions, 4391 events. 2835/4391 cut-off events. For 301460/301463 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 22899 event pairs, 749 based on Foata normal form. 6/4393 useless extension candidates. Maximal degree in co-relation 36273. Up to 3888 conditions per place. 
[2024-06-04 17:22:53,932 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 228 selfloop transitions, 73 changer transitions 0/327 dead transitions.
[2024-06-04 17:22:53,932 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 327 transitions, 4094 flow
[2024-06-04 17:22:53,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:22:53,935 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:22:53,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-04 17:22:53,935 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4469135802469136
[2024-06-04 17:22:53,935 INFO  L175             Difference]: Start difference. First operand has 172 places, 296 transitions, 3376 flow. Second operand 9 states and 181 transitions.
[2024-06-04 17:22:53,935 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 327 transitions, 4094 flow
[2024-06-04 17:22:54,138 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 327 transitions, 3866 flow, removed 52 selfloop flow, removed 7 redundant places.
[2024-06-04 17:22:54,142 INFO  L231             Difference]: Finished difference. Result has 174 places, 296 transitions, 3306 flow
[2024-06-04 17:22:54,142 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3148, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3306, PETRI_PLACES=174, PETRI_TRANSITIONS=296}
[2024-06-04 17:22:54,142 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 128 predicate places.
[2024-06-04 17:22:54,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 296 transitions, 3306 flow
[2024-06-04 17:22:54,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:54,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:22:54,143 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:22:54,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 17:22:54,143 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:22:54,144 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:22:54,144 INFO  L85        PathProgramCache]: Analyzing trace with hash 1982545200, now seen corresponding path program 2 times
[2024-06-04 17:22:54,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:22:54,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081047624]
[2024-06-04 17:22:54,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:22:54,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:22:54,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:23:11,459 INFO  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,460 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:23:11,460 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081047624]
[2024-06-04 17:23:11,460 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081047624] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:23:11,460 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:23:11,460 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:23:11,460 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798731025]
[2024-06-04 17:23:11,460 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:23:11,460 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:23:11,460 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:23:11,460 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:23:11,461 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:23:11,770 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:23:11,771 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 296 transitions, 3306 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:23:11,771 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:23:11,771 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:23:11,771 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:23:14,094 INFO  L124   PetriNetUnfolderBase]: 2979/4535 cut-off events.
[2024-06-04 17:23:14,094 INFO  L125   PetriNetUnfolderBase]: For 313773/313779 co-relation queries the response was YES.
[2024-06-04 17:23:14,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37505 conditions, 4535 events. 2979/4535 cut-off events. For 313773/313779 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23073 event pairs, 785 based on Foata normal form. 6/4537 useless extension candidates. Maximal degree in co-relation 37424. Up to 3993 conditions per place. 
[2024-06-04 17:23:14,136 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 209 selfloop transitions, 116 changer transitions 0/331 dead transitions.
[2024-06-04 17:23:14,136 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 331 transitions, 4162 flow
[2024-06-04 17:23:14,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:23:14,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:23:14,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions.
[2024-06-04 17:23:14,139 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4311111111111111
[2024-06-04 17:23:14,139 INFO  L175             Difference]: Start difference. First operand has 174 places, 296 transitions, 3306 flow. Second operand 10 states and 194 transitions.
[2024-06-04 17:23:14,139 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 331 transitions, 4162 flow
[2024-06-04 17:23:14,331 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 331 transitions, 3985 flow, removed 3 selfloop flow, removed 8 redundant places.
[2024-06-04 17:23:14,334 INFO  L231             Difference]: Finished difference. Result has 176 places, 299 transitions, 3459 flow
[2024-06-04 17:23:14,335 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3129, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3459, PETRI_PLACES=176, PETRI_TRANSITIONS=299}
[2024-06-04 17:23:14,335 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 130 predicate places.
[2024-06-04 17:23:14,335 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 299 transitions, 3459 flow
[2024-06-04 17:23:14,335 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:23:14,335 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:23:14,335 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:23:14,335 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 17:23:14,335 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:23:14,336 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:23:14,336 INFO  L85        PathProgramCache]: Analyzing trace with hash 1526193432, now seen corresponding path program 2 times
[2024-06-04 17:23:14,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:23:14,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346891733]
[2024-06-04 17:23:14,336 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:23:14,336 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:23:14,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:23:26,447 INFO  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,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:23:26,448 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346891733]
[2024-06-04 17:23:26,448 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346891733] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:23:26,448 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:23:26,448 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:23:26,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527493607]
[2024-06-04 17:23:26,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:23:26,448 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:23:26,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:23:26,449 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:23:26,449 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:23:26,665 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:23:26,665 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 299 transitions, 3459 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:23:26,665 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:23:26,665 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:23:26,666 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:23:28,987 INFO  L124   PetriNetUnfolderBase]: 3049/4636 cut-off events.
[2024-06-04 17:23:28,987 INFO  L125   PetriNetUnfolderBase]: For 340162/340168 co-relation queries the response was YES.
[2024-06-04 17:23:29,008 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39331 conditions, 4636 events. 3049/4636 cut-off events. For 340162/340168 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 23640 event pairs, 756 based on Foata normal form. 8/4640 useless extension candidates. Maximal degree in co-relation 39249. Up to 3864 conditions per place. 
[2024-06-04 17:23:29,026 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 220 selfloop transitions, 122 changer transitions 0/348 dead transitions.
[2024-06-04 17:23:29,026 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 348 transitions, 4833 flow
[2024-06-04 17:23:29,029 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:23:29,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:23:29,029 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions.
[2024-06-04 17:23:29,029 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48
[2024-06-04 17:23:29,030 INFO  L175             Difference]: Start difference. First operand has 176 places, 299 transitions, 3459 flow. Second operand 10 states and 216 transitions.
[2024-06-04 17:23:29,030 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 348 transitions, 4833 flow
[2024-06-04 17:23:29,262 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 348 transitions, 4531 flow, removed 38 selfloop flow, removed 8 redundant places.
[2024-06-04 17:23:29,266 INFO  L231             Difference]: Finished difference. Result has 178 places, 308 transitions, 3639 flow
[2024-06-04 17:23:29,266 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3157, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3639, PETRI_PLACES=178, PETRI_TRANSITIONS=308}
[2024-06-04 17:23:29,267 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 132 predicate places.
[2024-06-04 17:23:29,267 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 308 transitions, 3639 flow
[2024-06-04 17:23:29,267 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:23:29,267 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:23:29,267 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:23:29,267 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 17:23:29,267 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:23:29,268 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:23:29,268 INFO  L85        PathProgramCache]: Analyzing trace with hash 1982540550, now seen corresponding path program 3 times
[2024-06-04 17:23:29,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:23:29,268 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126312875]
[2024-06-04 17:23:29,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:23:29,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:23:29,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:23:45,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:23:45,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:23:45,333 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126312875]
[2024-06-04 17:23:45,334 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126312875] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:23:45,334 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:23:45,334 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:23:45,334 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557897480]
[2024-06-04 17:23:45,334 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:23:45,334 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:23:45,335 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:23:45,335 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:23:45,335 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:23:45,723 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:23:45,724 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 308 transitions, 3639 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:23:45,724 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:23:45,724 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:23:45,724 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:23:48,187 INFO  L124   PetriNetUnfolderBase]: 3076/4675 cut-off events.
[2024-06-04 17:23:48,188 INFO  L125   PetriNetUnfolderBase]: For 358304/358310 co-relation queries the response was YES.
[2024-06-04 17:23:48,210 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40524 conditions, 4675 events. 3076/4675 cut-off events. For 358304/358310 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 23836 event pairs, 799 based on Foata normal form. 6/4677 useless extension candidates. Maximal degree in co-relation 40441. Up to 4088 conditions per place. 
[2024-06-04 17:23:48,232 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 220 selfloop transitions, 122 changer transitions 0/348 dead transitions.
[2024-06-04 17:23:48,232 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 348 transitions, 4795 flow
[2024-06-04 17:23:48,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:23:48,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:23:48,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions.
[2024-06-04 17:23:48,235 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43777777777777777
[2024-06-04 17:23:48,235 INFO  L175             Difference]: Start difference. First operand has 178 places, 308 transitions, 3639 flow. Second operand 10 states and 197 transitions.
[2024-06-04 17:23:48,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 348 transitions, 4795 flow
[2024-06-04 17:23:48,529 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 348 transitions, 4645 flow, removed 40 selfloop flow, removed 5 redundant places.
[2024-06-04 17:23:48,534 INFO  L231             Difference]: Finished difference. Result has 183 places, 314 transitions, 3927 flow
[2024-06-04 17:23:48,534 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3489, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3927, PETRI_PLACES=183, PETRI_TRANSITIONS=314}
[2024-06-04 17:23:48,534 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 137 predicate places.
[2024-06-04 17:23:48,535 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 314 transitions, 3927 flow
[2024-06-04 17:23:48,535 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:23:48,535 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:23:48,535 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:23:48,535 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 17:23:48,535 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:23:48,536 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:23:48,536 INFO  L85        PathProgramCache]: Analyzing trace with hash 1982540426, now seen corresponding path program 4 times
[2024-06-04 17:23:48,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:23:48,536 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487894742]
[2024-06-04 17:23:48,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:23:48,536 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:23:48,585 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:24:04,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:24:04,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:24:04,832 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487894742]
[2024-06-04 17:24:04,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487894742] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:24:04,832 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:24:04,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:24:04,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426402446]
[2024-06-04 17:24:04,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:24:04,832 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:24:04,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:24:04,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:24:04,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:24:05,186 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:24:05,187 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 314 transitions, 3927 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:05,187 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:24:05,187 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:24:05,187 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:24:07,653 INFO  L124   PetriNetUnfolderBase]: 2966/4575 cut-off events.
[2024-06-04 17:24:07,653 INFO  L125   PetriNetUnfolderBase]: For 377288/377294 co-relation queries the response was YES.
[2024-06-04 17:24:07,674 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40664 conditions, 4575 events. 2966/4575 cut-off events. For 377288/377294 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 23889 event pairs, 764 based on Foata normal form. 8/4579 useless extension candidates. Maximal degree in co-relation 40579. Up to 4025 conditions per place. 
[2024-06-04 17:24:07,695 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 242 selfloop transitions, 78 changer transitions 0/349 dead transitions.
[2024-06-04 17:24:07,695 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 349 transitions, 4775 flow
[2024-06-04 17:24:07,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:24:07,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:24:07,698 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions.
[2024-06-04 17:24:07,698 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44222222222222224
[2024-06-04 17:24:07,698 INFO  L175             Difference]: Start difference. First operand has 183 places, 314 transitions, 3927 flow. Second operand 10 states and 199 transitions.
[2024-06-04 17:24:07,698 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 349 transitions, 4775 flow
[2024-06-04 17:24:07,982 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 349 transitions, 4540 flow, removed 53 selfloop flow, removed 6 redundant places.
[2024-06-04 17:24:07,990 INFO  L231             Difference]: Finished difference. Result has 187 places, 316 transitions, 3941 flow
[2024-06-04 17:24:07,990 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3692, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3941, PETRI_PLACES=187, PETRI_TRANSITIONS=316}
[2024-06-04 17:24:07,990 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 141 predicate places.
[2024-06-04 17:24:07,991 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 316 transitions, 3941 flow
[2024-06-04 17:24:07,991 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:07,991 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:24:07,991 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:24:07,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 17:24:07,991 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:24:07,991 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:24:07,991 INFO  L85        PathProgramCache]: Analyzing trace with hash 1526372922, now seen corresponding path program 3 times
[2024-06-04 17:24:07,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:24:07,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19815941]
[2024-06-04 17:24:07,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:24:07,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:24:08,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:24:20,112 INFO  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,112 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:24:20,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19815941]
[2024-06-04 17:24:20,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19815941] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:24:20,112 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:24:20,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:24:20,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692298314]
[2024-06-04 17:24:20,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:24:20,113 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:24:20,113 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:24:20,113 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:24:20,113 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:24:20,372 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:24:20,372 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 316 transitions, 3941 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:24:20,372 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:24:20,372 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:24:20,372 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:24:22,826 INFO  L124   PetriNetUnfolderBase]: 3213/4905 cut-off events.
[2024-06-04 17:24:22,826 INFO  L125   PetriNetUnfolderBase]: For 402198/402198 co-relation queries the response was YES.
[2024-06-04 17:24:22,852 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43467 conditions, 4905 events. 3213/4905 cut-off events. For 402198/402198 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 25544 event pairs, 861 based on Foata normal form. 4/4905 useless extension candidates. Maximal degree in co-relation 43380. Up to 4227 conditions per place. 
[2024-06-04 17:24:22,877 INFO  L140   encePairwiseOnDemand]: 31/45 looper letters, 261 selfloop transitions, 103 changer transitions 0/370 dead transitions.
[2024-06-04 17:24:22,877 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 370 transitions, 5351 flow
[2024-06-04 17:24:22,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 17:24:22,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 17:24:22,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions.
[2024-06-04 17:24:22,880 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42828282828282827
[2024-06-04 17:24:22,880 INFO  L175             Difference]: Start difference. First operand has 187 places, 316 transitions, 3941 flow. Second operand 11 states and 212 transitions.
[2024-06-04 17:24:22,880 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 370 transitions, 5351 flow
[2024-06-04 17:24:23,161 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 370 transitions, 5118 flow, removed 39 selfloop flow, removed 8 redundant places.
[2024-06-04 17:24:23,165 INFO  L231             Difference]: Finished difference. Result has 191 places, 331 transitions, 4152 flow
[2024-06-04 17:24:23,166 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3710, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4152, PETRI_PLACES=191, PETRI_TRANSITIONS=331}
[2024-06-04 17:24:23,166 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 145 predicate places.
[2024-06-04 17:24:23,166 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 331 transitions, 4152 flow
[2024-06-04 17:24:23,166 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:24:23,166 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:24:23,167 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:24:23,167 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 17:24:23,167 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:24:23,167 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:24:23,167 INFO  L85        PathProgramCache]: Analyzing trace with hash 1526366412, now seen corresponding path program 4 times
[2024-06-04 17:24:23,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:24:23,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362352553]
[2024-06-04 17:24:23,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:24:23,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:24:23,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:24:35,756 INFO  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:35,756 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:24:35,756 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362352553]
[2024-06-04 17:24:35,756 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362352553] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:24:35,756 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:24:35,756 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:24:35,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948378294]
[2024-06-04 17:24:35,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:24:35,757 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:24:35,757 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:24:35,757 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:24:35,757 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:24:35,971 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:24:35,972 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 331 transitions, 4152 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:35,972 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:24:35,972 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:24:35,972 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:24:38,458 INFO  L124   PetriNetUnfolderBase]: 3225/4919 cut-off events.
[2024-06-04 17:24:38,458 INFO  L125   PetriNetUnfolderBase]: For 416460/416466 co-relation queries the response was YES.
[2024-06-04 17:24:38,481 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43880 conditions, 4919 events. 3225/4919 cut-off events. For 416460/416466 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 25505 event pairs, 756 based on Foata normal form. 12/4927 useless extension candidates. Maximal degree in co-relation 43791. Up to 4034 conditions per place. 
[2024-06-04 17:24:38,503 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 220 selfloop transitions, 148 changer transitions 0/374 dead transitions.
[2024-06-04 17:24:38,503 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 374 transitions, 5462 flow
[2024-06-04 17:24:38,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:24:38,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:24:38,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions.
[2024-06-04 17:24:38,506 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4777777777777778
[2024-06-04 17:24:38,506 INFO  L175             Difference]: Start difference. First operand has 191 places, 331 transitions, 4152 flow. Second operand 10 states and 215 transitions.
[2024-06-04 17:24:38,507 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 374 transitions, 5462 flow
[2024-06-04 17:24:38,804 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 374 transitions, 5236 flow, removed 53 selfloop flow, removed 7 redundant places.
[2024-06-04 17:24:38,809 INFO  L231             Difference]: Finished difference. Result has 194 places, 334 transitions, 4309 flow
[2024-06-04 17:24:38,809 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3926, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4309, PETRI_PLACES=194, PETRI_TRANSITIONS=334}
[2024-06-04 17:24:38,810 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 148 predicate places.
[2024-06-04 17:24:38,810 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 334 transitions, 4309 flow
[2024-06-04 17:24:38,810 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:38,810 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:24:38,810 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:24:38,810 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 17:24:38,811 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:24:38,811 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:24:38,811 INFO  L85        PathProgramCache]: Analyzing trace with hash 1526366226, now seen corresponding path program 4 times
[2024-06-04 17:24:38,811 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:24:38,811 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985727225]
[2024-06-04 17:24:38,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:24:38,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:24:38,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:24:55,411 INFO  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:55,411 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:24:55,411 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985727225]
[2024-06-04 17:24:55,411 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985727225] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:24:55,411 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:24:55,411 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:24:55,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534071134]
[2024-06-04 17:24:55,411 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:24:55,411 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:24:55,412 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:24:55,412 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:24:55,412 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:24:55,672 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-04 17:24:55,673 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 334 transitions, 4309 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:24:55,673 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:24:55,673 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-04 17:24:55,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:24:58,182 INFO  L124   PetriNetUnfolderBase]: 3220/4912 cut-off events.
[2024-06-04 17:24:58,182 INFO  L125   PetriNetUnfolderBase]: For 422869/422875 co-relation queries the response was YES.
[2024-06-04 17:24:58,209 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44374 conditions, 4912 events. 3220/4912 cut-off events. For 422869/422875 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 25484 event pairs, 804 based on Foata normal form. 6/4914 useless extension candidates. Maximal degree in co-relation 44283. Up to 4345 conditions per place. 
[2024-06-04 17:24:58,233 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 236 selfloop transitions, 124 changer transitions 0/366 dead transitions.
[2024-06-04 17:24:58,233 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 366 transitions, 5153 flow
[2024-06-04 17:24:58,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:24:58,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:24:58,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-04 17:24:58,237 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4288888888888889
[2024-06-04 17:24:58,237 INFO  L175             Difference]: Start difference. First operand has 194 places, 334 transitions, 4309 flow. Second operand 10 states and 193 transitions.
[2024-06-04 17:24:58,237 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 366 transitions, 5153 flow
[2024-06-04 17:24:58,623 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 366 transitions, 4735 flow, removed 59 selfloop flow, removed 8 redundant places.
[2024-06-04 17:24:58,628 INFO  L231             Difference]: Finished difference. Result has 196 places, 334 transitions, 4149 flow
[2024-06-04 17:24:58,628 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3891, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4149, PETRI_PLACES=196, PETRI_TRANSITIONS=334}
[2024-06-04 17:24:58,628 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 150 predicate places.
[2024-06-04 17:24:58,628 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 334 transitions, 4149 flow
[2024-06-04 17:24:58,629 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:24:58,629 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:24:58,629 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:24:58,629 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 17:24:58,629 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:24:58,629 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:24:58,629 INFO  L85        PathProgramCache]: Analyzing trace with hash 315192671, now seen corresponding path program 1 times
[2024-06-04 17:24:58,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:24:58,629 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699516654]
[2024-06-04 17:24:58,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:24:58,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:24:58,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:25:18,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:25:18,089 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:25:18,089 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699516654]
[2024-06-04 17:25:18,089 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699516654] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:25:18,089 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:25:18,089 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:25:18,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617754289]
[2024-06-04 17:25:18,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:25:18,089 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:25:18,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:25:18,089 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:25:18,090 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:25:18,238 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-04 17:25:18,239 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 334 transitions, 4149 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:25:18,239 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:25:18,239 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-04 17:25:18,239 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15