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


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


Checking for ERROR reachability
Using default analysis
Version 76401ed0
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix033_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m
[2024-06-20 18:59:19,670 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 18:59:19,737 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 18:59:19,742 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 18:59:19,742 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 18:59:19,766 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 18:59:19,767 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 18:59:19,767 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 18:59:19,767 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 18:59:19,770 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 18:59:19,771 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 18:59:19,771 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 18:59:19,771 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 18:59:19,772 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 18:59:19,773 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 18:59:19,773 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 18:59:19,773 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 18:59:19,773 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 18:59:19,773 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 18:59:19,773 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 18:59:19,774 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 18:59:19,774 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 18:59:19,774 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 18:59:19,774 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 18:59:19,774 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 18:59:19,775 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 18:59:19,775 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 18:59:19,775 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 18:59:19,775 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 18:59:19,776 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 18:59:19,776 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 18:59:19,776 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 18:59:19,777 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 18:59:19,777 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 18:59:19,777 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 18:59:19,777 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 18:59:19,777 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 18:59:19,777 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 18:59:19,777 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 18:59:19,778 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 18:59:19,778 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 18:59:19,778 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 18:59:19,778 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 18:59:19,778 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-20 18:59:19,981 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 18:59:20,000 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 18:59:20,002 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 18:59:20,003 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 18:59:20,003 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 18:59:20,004 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/mix033_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml
[2024-06-20 18:59:20,249 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 18:59:20,249 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 18:59:20,250 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 18:59:21,172 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 18:59:21,418 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 18:59:21,419 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 18:59:21,430 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044ae27f4/e6d8a85f0fdb4d04a31069ffc980d37c/FLAG60357343f
[2024-06-20 18:59:21,439 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044ae27f4/e6d8a85f0fdb4d04a31069ffc980d37c
[2024-06-20 18:59:21,439 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 18:59:21,440 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 18:59:21,440 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 18:59:21,441 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 18:59:21,444 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 18:59:21,445 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:59:20" (1/2) ...
[2024-06-20 18:59:21,445 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9870cc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:21, skipping insertion in model container
[2024-06-20 18:59:21,445 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:59:20" (1/2) ...
[2024-06-20 18:59:21,446 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@55a74e72 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:21, skipping insertion in model container
[2024-06-20 18:59:21,446 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:59:21" (2/2) ...
[2024-06-20 18:59:21,447 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9870cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:21, skipping insertion in model container
[2024-06-20 18:59:21,447 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:59:21" (2/2) ...
[2024-06-20 18:59:21,447 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 18:59:21,522 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 18:59:21,523 INFO  L97    edCorrectnessWitness]: Location invariant before [L856-L856] ((((((((((((((((((((((! multithreaded || b$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 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_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_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_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_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_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_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) && 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_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)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || b$read_delayed == (_Bool)0)
[2024-06-20 18:59:21,524 INFO  L97    edCorrectnessWitness]: Location invariant before [L859-L859] ((((((((((((((((((((((! multithreaded || b$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 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_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_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_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_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_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_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) && 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_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)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || b$read_delayed == (_Bool)0)
[2024-06-20 18:59:21,525 INFO  L97    edCorrectnessWitness]: Location invariant before [L858-L858] ((((((((((((((((((((((! multithreaded || b$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 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_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_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_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_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_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_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) && 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_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)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || b$read_delayed == (_Bool)0)
[2024-06-20 18:59:21,525 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 18:59:21,526 INFO  L106   edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1;
[2024-06-20 18:59:21,561 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 18:59:21,835 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 18:59:21,848 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 18:59:22,171 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 18:59:22,207 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 18:59:22,208 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22 WrapperNode
[2024-06-20 18:59:22,208 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 18:59:22,209 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 18:59:22,209 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 18:59:22,209 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 18:59:22,214 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (1/1) ...
[2024-06-20 18:59:22,251 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (1/1) ...
[2024-06-20 18:59:22,351 INFO  L138                Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 129
[2024-06-20 18:59:22,352 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 18:59:22,353 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 18:59:22,353 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 18:59:22,353 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 18:59:22,362 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (1/1) ...
[2024-06-20 18:59:22,362 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (1/1) ...
[2024-06-20 18:59:22,390 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (1/1) ...
[2024-06-20 18:59:22,451 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-20 18:59:22,452 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (1/1) ...
[2024-06-20 18:59:22,452 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (1/1) ...
[2024-06-20 18:59:22,487 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (1/1) ...
[2024-06-20 18:59:22,489 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (1/1) ...
[2024-06-20 18:59:22,502 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (1/1) ...
[2024-06-20 18:59:22,506 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (1/1) ...
[2024-06-20 18:59:22,525 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 18:59:22,526 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 18:59:22,526 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 18:59:22,526 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 18:59:22,527 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (1/1) ...
[2024-06-20 18:59:22,530 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 18:59:22,537 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 18:59:22,549 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-20 18:59:22,553 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-20 18:59:22,577 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 18:59:22,577 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 18:59:22,577 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 18:59:22,578 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 18:59:22,578 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 18:59:22,578 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 18:59:22,578 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 18:59:22,578 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 18:59:22,578 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 18:59:22,578 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 18:59:22,579 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 18:59:22,579 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 18:59:22,580 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 18:59:22,687 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 18:59:22,689 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 18:59:24,088 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 18:59:24,089 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 18:59:24,390 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 18:59:24,390 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 18:59:24,391 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:59:24 BoogieIcfgContainer
[2024-06-20 18:59:24,392 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 18:59:24,393 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 18:59:24,393 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 18:59:24,396 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 18:59:24,396 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:59:20" (1/4) ...
[2024-06-20 18:59:24,397 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b82d6d0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:59:24, skipping insertion in model container
[2024-06-20 18:59:24,397 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:59:21" (2/4) ...
[2024-06-20 18:59:24,397 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b82d6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:59:24, skipping insertion in model container
[2024-06-20 18:59:24,397 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:22" (3/4) ...
[2024-06-20 18:59:24,398 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b82d6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:59:24, skipping insertion in model container
[2024-06-20 18:59:24,398 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:59:24" (4/4) ...
[2024-06-20 18:59:24,399 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 18:59:24,411 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 18:59:24,411 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 18:59:24,411 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 18:59:24,506 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 18:59:24,532 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 100 flow
[2024-06-20 18:59:24,682 INFO  L124   PetriNetUnfolderBase]: 0/41 cut-off events.
[2024-06-20 18:59:24,682 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 18:59:24,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 18:59:24,685 INFO  L82        GeneralOperation]: Start removeDead. Operand has 54 places, 44 transitions, 100 flow
[2024-06-20 18:59:24,702 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 45 places, 35 transitions, 79 flow
[2024-06-20 18:59:24,715 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 18:59:24,747 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;@591973a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 18:59:24,747 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 18:59:24,755 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 18:59:24,755 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 18:59:24,755 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 18:59:24,755 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:59:24,756 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 18:59:24,756 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:59:24,771 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:59:24,771 INFO  L85        PathProgramCache]: Analyzing trace with hash 386398261, now seen corresponding path program 1 times
[2024-06-20 18:59:24,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:59:24,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366660762]
[2024-06-20 18:59:24,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:59:24,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:59:25,116 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:31,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:59:31,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:31,934 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366660762]
[2024-06-20 18:59:31,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366660762] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:31,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:31,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 18:59:31,936 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394053225]
[2024-06-20 18:59:31,936 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:31,942 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 18:59:31,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:31,962 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 18:59:31,962 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 18:59:32,075 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-20 18:59:32,077 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 79 flow. Second operand  has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:32,077 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:32,077 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-20 18:59:32,078 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:59:33,484 INFO  L124   PetriNetUnfolderBase]: 1911/2945 cut-off events.
[2024-06-20 18:59:33,485 INFO  L125   PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES.
[2024-06-20 18:59:33,493 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5869 conditions, 2945 events. 1911/2945 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14834 event pairs, 1379 based on Foata normal form. 1/2857 useless extension candidates. Maximal degree in co-relation 5857. Up to 2825 conditions per place. 
[2024-06-20 18:59:33,545 INFO  L140   encePairwiseOnDemand]: 37/44 looper letters, 34 selfloop transitions, 4 changer transitions 0/45 dead transitions.
[2024-06-20 18:59:33,545 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 181 flow
[2024-06-20 18:59:33,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 18:59:33,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 18:59:33,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions.
[2024-06-20 18:59:33,555 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6060606060606061
[2024-06-20 18:59:33,557 INFO  L175             Difference]: Start difference. First operand has 45 places, 35 transitions, 79 flow. Second operand 3 states and 80 transitions.
[2024-06-20 18:59:33,558 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 181 flow
[2024-06-20 18:59:33,560 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 18:59:33,564 INFO  L231             Difference]: Finished difference. Result has 45 places, 38 transitions, 106 flow
[2024-06-20 18:59:33,566 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=38}
[2024-06-20 18:59:33,570 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places.
[2024-06-20 18:59:33,570 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 106 flow
[2024-06-20 18:59:33,571 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:33,571 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:59:33,571 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:59:33,571 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 18:59:33,571 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:59:33,572 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:59:33,572 INFO  L85        PathProgramCache]: Analyzing trace with hash 1962653832, now seen corresponding path program 1 times
[2024-06-20 18:59:33,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:59:33,573 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52656555]
[2024-06-20 18:59:33,573 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:59:33,573 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:59:33,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:39,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:59:39,392 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:39,392 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52656555]
[2024-06-20 18:59:39,392 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52656555] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:39,392 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:39,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 18:59:39,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988289373]
[2024-06-20 18:59:39,393 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:39,394 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 18:59:39,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:39,394 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 18:59:39,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-20 18:59:39,524 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-20 18:59:39,525 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 106 flow. Second operand  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:39,525 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:39,525 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-20 18:59:39,525 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:59:40,761 INFO  L124   PetriNetUnfolderBase]: 1905/2936 cut-off events.
[2024-06-20 18:59:40,761 INFO  L125   PetriNetUnfolderBase]: For 545/545 co-relation queries the response was YES.
[2024-06-20 18:59:40,765 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6557 conditions, 2936 events. 1905/2936 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14810 event pairs, 1212 based on Foata normal form. 3/2890 useless extension candidates. Maximal degree in co-relation 6545. Up to 2801 conditions per place. 
[2024-06-20 18:59:40,775 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 41 selfloop transitions, 7 changer transitions 0/55 dead transitions.
[2024-06-20 18:59:40,776 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 248 flow
[2024-06-20 18:59:40,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 18:59:40,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 18:59:40,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions.
[2024-06-20 18:59:40,779 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5852272727272727
[2024-06-20 18:59:40,779 INFO  L175             Difference]: Start difference. First operand has 45 places, 38 transitions, 106 flow. Second operand 4 states and 103 transitions.
[2024-06-20 18:59:40,779 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 248 flow
[2024-06-20 18:59:40,780 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 18:59:40,782 INFO  L231             Difference]: Finished difference. Result has 48 places, 41 transitions, 142 flow
[2024-06-20 18:59:40,782 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=41}
[2024-06-20 18:59:40,783 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2024-06-20 18:59:40,783 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 142 flow
[2024-06-20 18:59:40,783 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:40,784 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:59:40,784 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:59:40,786 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 18:59:40,786 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-20 18:59:40,787 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:59:40,787 INFO  L85        PathProgramCache]: Analyzing trace with hash 712727238, now seen corresponding path program 1 times
[2024-06-20 18:59:40,787 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:59:40,792 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875778538]
[2024-06-20 18:59:40,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:59:40,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:59:40,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:46,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:59:46,344 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:46,345 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875778538]
[2024-06-20 18:59:46,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875778538] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:46,345 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:46,345 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 18:59:46,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159220144]
[2024-06-20 18:59:46,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:46,346 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 18:59:46,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:46,346 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 18:59:46,346 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-20 18:59:46,482 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-20 18:59:46,482 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 142 flow. Second operand  has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:46,482 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:46,483 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-20 18:59:46,483 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:59:47,844 INFO  L124   PetriNetUnfolderBase]: 1913/2962 cut-off events.
[2024-06-20 18:59:47,844 INFO  L125   PetriNetUnfolderBase]: For 1563/1563 co-relation queries the response was YES.
[2024-06-20 18:59:47,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7292 conditions, 2962 events. 1913/2962 cut-off events. For 1563/1563 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15055 event pairs, 951 based on Foata normal form. 5/2925 useless extension candidates. Maximal degree in co-relation 7278. Up to 2747 conditions per place. 
[2024-06-20 18:59:47,857 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 54 selfloop transitions, 16 changer transitions 0/77 dead transitions.
[2024-06-20 18:59:47,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 402 flow
[2024-06-20 18:59:47,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 18:59:47,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 18:59:47,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions.
[2024-06-20 18:59:47,859 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6090909090909091
[2024-06-20 18:59:47,859 INFO  L175             Difference]: Start difference. First operand has 48 places, 41 transitions, 142 flow. Second operand 5 states and 134 transitions.
[2024-06-20 18:59:47,859 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 402 flow
[2024-06-20 18:59:47,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 388 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-20 18:59:47,861 INFO  L231             Difference]: Finished difference. Result has 53 places, 52 transitions, 241 flow
[2024-06-20 18:59:47,862 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=53, PETRI_TRANSITIONS=52}
[2024-06-20 18:59:47,862 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places.
[2024-06-20 18:59:47,862 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 241 flow
[2024-06-20 18:59:47,862 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:47,863 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:59:47,863 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:59:47,863 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 18:59:47,863 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:59:47,863 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:59:47,864 INFO  L85        PathProgramCache]: Analyzing trace with hash -433105421, now seen corresponding path program 1 times
[2024-06-20 18:59:47,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:59:47,864 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122550173]
[2024-06-20 18:59:47,864 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:59:47,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:59:47,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:54,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:59:54,715 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:54,716 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122550173]
[2024-06-20 18:59:54,716 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122550173] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:54,716 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:54,716 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 18:59:54,716 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618361694]
[2024-06-20 18:59:54,716 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:54,717 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 18:59:54,717 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:54,717 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 18:59:54,717 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-20 18:59:54,936 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-20 18:59:54,936 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 241 flow. Second operand  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:54,936 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:54,936 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-20 18:59:54,936 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:59:56,407 INFO  L124   PetriNetUnfolderBase]: 1921/2974 cut-off events.
[2024-06-20 18:59:56,407 INFO  L125   PetriNetUnfolderBase]: For 3601/3603 co-relation queries the response was YES.
[2024-06-20 18:59:56,414 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8537 conditions, 2974 events. 1921/2974 cut-off events. For 3601/3603 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15086 event pairs, 784 based on Foata normal form. 7/2939 useless extension candidates. Maximal degree in co-relation 8520. Up to 2733 conditions per place. 
[2024-06-20 18:59:56,425 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 61 selfloop transitions, 20 changer transitions 0/88 dead transitions.
[2024-06-20 18:59:56,425 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 88 transitions, 529 flow
[2024-06-20 18:59:56,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:59:56,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:59:56,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions.
[2024-06-20 18:59:56,430 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5984848484848485
[2024-06-20 18:59:56,430 INFO  L175             Difference]: Start difference. First operand has 53 places, 52 transitions, 241 flow. Second operand 6 states and 158 transitions.
[2024-06-20 18:59:56,430 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 88 transitions, 529 flow
[2024-06-20 18:59:56,437 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 521 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-06-20 18:59:56,438 INFO  L231             Difference]: Finished difference. Result has 59 places, 56 transitions, 314 flow
[2024-06-20 18:59:56,438 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=59, PETRI_TRANSITIONS=56}
[2024-06-20 18:59:56,439 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places.
[2024-06-20 18:59:56,440 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 314 flow
[2024-06-20 18:59:56,440 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:56,440 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:59:56,440 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:59:56,440 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 18:59:56,441 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:59:56,441 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:59:56,441 INFO  L85        PathProgramCache]: Analyzing trace with hash 2031095557, now seen corresponding path program 1 times
[2024-06-20 18:59:56,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:59:56,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842113443]
[2024-06-20 18:59:56,442 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:59:56,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:59:56,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:00:03,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:00:03,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:00:03,828 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842113443]
[2024-06-20 19:00:03,828 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842113443] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:00:03,828 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:00:03,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:00:03,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954980810]
[2024-06-20 19:00:03,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:00:03,829 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:00:03,829 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:00:03,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:00:03,830 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:00:04,043 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-20 19:00:04,044 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 314 flow. Second operand  has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:04,044 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:00:04,044 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-20 19:00:04,044 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:05,680 INFO  L124   PetriNetUnfolderBase]: 1933/2994 cut-off events.
[2024-06-20 19:00:05,680 INFO  L125   PetriNetUnfolderBase]: For 5677/5679 co-relation queries the response was YES.
[2024-06-20 19:00:05,686 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9498 conditions, 2994 events. 1933/2994 cut-off events. For 5677/5679 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15232 event pairs, 596 based on Foata normal form. 12/2964 useless extension candidates. Maximal degree in co-relation 9478. Up to 2701 conditions per place. 
[2024-06-20 19:00:05,701 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 65 selfloop transitions, 23 changer transitions 0/95 dead transitions.
[2024-06-20 19:00:05,701 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 630 flow
[2024-06-20 19:00:05,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:00:05,702 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:00:05,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions.
[2024-06-20 19:00:05,703 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.577922077922078
[2024-06-20 19:00:05,703 INFO  L175             Difference]: Start difference. First operand has 59 places, 56 transitions, 314 flow. Second operand 7 states and 178 transitions.
[2024-06-20 19:00:05,703 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 630 flow
[2024-06-20 19:00:05,706 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 95 transitions, 581 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-20 19:00:05,708 INFO  L231             Difference]: Finished difference. Result has 61 places, 58 transitions, 341 flow
[2024-06-20 19:00:05,708 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=61, PETRI_TRANSITIONS=58}
[2024-06-20 19:00:05,709 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places.
[2024-06-20 19:00:05,709 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 341 flow
[2024-06-20 19:00:05,709 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:05,709 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:05,709 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:05,709 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 19:00:05,709 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:00:05,710 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:05,710 INFO  L85        PathProgramCache]: Analyzing trace with hash -631748548, now seen corresponding path program 1 times
[2024-06-20 19:00:05,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:05,710 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675116765]
[2024-06-20 19:00:05,710 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:05,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:05,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:00:20,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:00:20,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:00:20,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675116765]
[2024-06-20 19:00:20,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675116765] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:00:20,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:00:20,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:00:20,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736745498]
[2024-06-20 19:00:20,402 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:00:20,402 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:00:20,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:00:20,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:00:20,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:00:20,581 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:00:20,581 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 341 flow. Second operand  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:20,582 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:00:20,582 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:00:20,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:21,862 INFO  L124   PetriNetUnfolderBase]: 1928/2981 cut-off events.
[2024-06-20 19:00:21,862 INFO  L125   PetriNetUnfolderBase]: For 7782/7782 co-relation queries the response was YES.
[2024-06-20 19:00:21,867 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10091 conditions, 2981 events. 1928/2981 cut-off events. For 7782/7782 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15122 event pairs, 776 based on Foata normal form. 2/2939 useless extension candidates. Maximal degree in co-relation 10069. Up to 2844 conditions per place. 
[2024-06-20 19:00:21,880 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 55 selfloop transitions, 8 changer transitions 0/69 dead transitions.
[2024-06-20 19:00:21,880 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 495 flow
[2024-06-20 19:00:21,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:00:21,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:00:21,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions.
[2024-06-20 19:00:21,882 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4636363636363636
[2024-06-20 19:00:21,882 INFO  L175             Difference]: Start difference. First operand has 61 places, 58 transitions, 341 flow. Second operand 5 states and 102 transitions.
[2024-06-20 19:00:21,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 495 flow
[2024-06-20 19:00:21,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 69 transitions, 431 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-20 19:00:21,887 INFO  L231             Difference]: Finished difference. Result has 61 places, 58 transitions, 301 flow
[2024-06-20 19:00:21,887 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=61, PETRI_TRANSITIONS=58}
[2024-06-20 19:00:21,890 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places.
[2024-06-20 19:00:21,890 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 301 flow
[2024-06-20 19:00:21,890 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:21,890 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:21,890 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:21,890 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 19:00:21,890 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-20 19:00:21,891 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:21,891 INFO  L85        PathProgramCache]: Analyzing trace with hash 1860159738, now seen corresponding path program 1 times
[2024-06-20 19:00:21,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:21,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435726864]
[2024-06-20 19:00:21,893 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:21,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:21,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:00:37,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:00:37,579 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:00:37,579 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435726864]
[2024-06-20 19:00:37,579 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435726864] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:00:37,579 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:00:37,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:00:37,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811725925]
[2024-06-20 19:00:37,580 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:00:37,580 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:00:37,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:00:37,580 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:00:37,581 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:00:37,711 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:00:37,711 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 301 flow. Second operand  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:37,711 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:00:37,712 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:00:37,712 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:39,409 INFO  L124   PetriNetUnfolderBase]: 2264/3484 cut-off events.
[2024-06-20 19:00:39,410 INFO  L125   PetriNetUnfolderBase]: For 10324/10324 co-relation queries the response was YES.
[2024-06-20 19:00:39,415 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11653 conditions, 3484 events. 2264/3484 cut-off events. For 10324/10324 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 17571 event pairs, 936 based on Foata normal form. 2/3477 useless extension candidates. Maximal degree in co-relation 11629. Up to 3319 conditions per place. 
[2024-06-20 19:00:39,425 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 60 selfloop transitions, 11 changer transitions 0/76 dead transitions.
[2024-06-20 19:00:39,425 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 76 transitions, 501 flow
[2024-06-20 19:00:39,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:00:39,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:00:39,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions.
[2024-06-20 19:00:39,426 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4356060606060606
[2024-06-20 19:00:39,426 INFO  L175             Difference]: Start difference. First operand has 61 places, 58 transitions, 301 flow. Second operand 6 states and 115 transitions.
[2024-06-20 19:00:39,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 76 transitions, 501 flow
[2024-06-20 19:00:39,430 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 479 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-20 19:00:39,431 INFO  L231             Difference]: Finished difference. Result has 63 places, 61 transitions, 335 flow
[2024-06-20 19:00:39,431 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=63, PETRI_TRANSITIONS=61}
[2024-06-20 19:00:39,431 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places.
[2024-06-20 19:00:39,431 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 335 flow
[2024-06-20 19:00:39,432 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:39,432 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:39,432 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:39,432 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:00:39,432 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:00:39,432 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:39,432 INFO  L85        PathProgramCache]: Analyzing trace with hash -1781883887, now seen corresponding path program 1 times
[2024-06-20 19:00:39,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:39,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031014109]
[2024-06-20 19:00:39,433 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:39,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:39,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:00:52,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-20 19:00:52,764 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:00:52,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031014109]
[2024-06-20 19:00:52,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031014109] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:00:52,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:00:52,764 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:00:52,764 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840533502]
[2024-06-20 19:00:52,764 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:00:52,765 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:00:52,765 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:00:52,765 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:00:52,765 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:00:52,901 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:00:52,901 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 335 flow. Second operand  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:52,901 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:00:52,901 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:00:52,901 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:54,392 INFO  L124   PetriNetUnfolderBase]: 2136/3356 cut-off events.
[2024-06-20 19:00:54,393 INFO  L125   PetriNetUnfolderBase]: For 13134/13138 co-relation queries the response was YES.
[2024-06-20 19:00:54,398 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11963 conditions, 3356 events. 2136/3356 cut-off events. For 13134/13138 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 17417 event pairs, 853 based on Foata normal form. 8/3353 useless extension candidates. Maximal degree in co-relation 11939. Up to 3068 conditions per place. 
[2024-06-20 19:00:54,410 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 58 selfloop transitions, 19 changer transitions 0/84 dead transitions.
[2024-06-20 19:00:54,410 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 589 flow
[2024-06-20 19:00:54,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:00:54,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:00:54,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions.
[2024-06-20 19:00:54,412 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48863636363636365
[2024-06-20 19:00:54,412 INFO  L175             Difference]: Start difference. First operand has 63 places, 61 transitions, 335 flow. Second operand 6 states and 129 transitions.
[2024-06-20 19:00:54,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 589 flow
[2024-06-20 19:00:54,417 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 84 transitions, 557 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-20 19:00:54,419 INFO  L231             Difference]: Finished difference. Result has 65 places, 64 transitions, 375 flow
[2024-06-20 19:00:54,419 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=65, PETRI_TRANSITIONS=64}
[2024-06-20 19:00:54,419 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places.
[2024-06-20 19:00:54,420 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 375 flow
[2024-06-20 19:00:54,420 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:54,420 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:54,420 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:54,420 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:00:54,420 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:00:54,421 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:54,421 INFO  L85        PathProgramCache]: Analyzing trace with hash -1751260847, now seen corresponding path program 2 times
[2024-06-20 19:00:54,421 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:54,421 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468107296]
[2024-06-20 19:00:54,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:54,421 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:54,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:06,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:01:06,360 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:06,360 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468107296]
[2024-06-20 19:01:06,360 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468107296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:06,360 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:06,360 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:01:06,360 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602754988]
[2024-06-20 19:01:06,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:06,361 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:01:06,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:06,361 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:01:06,361 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:01:06,484 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:01:06,485 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 375 flow. Second operand  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:06,485 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:06,485 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:01:06,485 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:01:07,999 INFO  L124   PetriNetUnfolderBase]: 2121/3330 cut-off events.
[2024-06-20 19:01:07,999 INFO  L125   PetriNetUnfolderBase]: For 15350/15350 co-relation queries the response was YES.
[2024-06-20 19:01:08,005 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12238 conditions, 3330 events. 2121/3330 cut-off events. For 15350/15350 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 17281 event pairs, 849 based on Foata normal form. 2/3321 useless extension candidates. Maximal degree in co-relation 12213. Up to 3109 conditions per place. 
[2024-06-20 19:01:08,014 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 61 selfloop transitions, 11 changer transitions 0/79 dead transitions.
[2024-06-20 19:01:08,014 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 79 transitions, 557 flow
[2024-06-20 19:01:08,014 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:01:08,015 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:01:08,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions.
[2024-06-20 19:01:08,015 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45454545454545453
[2024-06-20 19:01:08,015 INFO  L175             Difference]: Start difference. First operand has 65 places, 64 transitions, 375 flow. Second operand 6 states and 120 transitions.
[2024-06-20 19:01:08,015 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 79 transitions, 557 flow
[2024-06-20 19:01:08,021 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 79 transitions, 528 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-20 19:01:08,022 INFO  L231             Difference]: Finished difference. Result has 68 places, 64 transitions, 376 flow
[2024-06-20 19:01:08,022 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=346, 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=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=68, PETRI_TRANSITIONS=64}
[2024-06-20 19:01:08,023 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places.
[2024-06-20 19:01:08,023 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 376 flow
[2024-06-20 19:01:08,023 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:08,023 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:01:08,023 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:01:08,023 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:01:08,024 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:01:08,024 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:01:08,024 INFO  L85        PathProgramCache]: Analyzing trace with hash 1830378617, now seen corresponding path program 1 times
[2024-06-20 19:01:08,024 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:01:08,024 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735918329]
[2024-06-20 19:01:08,024 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:01:08,025 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:01:08,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:24,880 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:01:24,880 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:24,881 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735918329]
[2024-06-20 19:01:24,881 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735918329] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:24,881 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:24,881 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:01:24,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545905465]
[2024-06-20 19:01:24,881 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:24,882 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:01:24,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:24,882 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:01:24,883 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:01:25,058 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:01:25,058 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 376 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:25,058 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:25,058 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:01:25,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:01:26,722 INFO  L124   PetriNetUnfolderBase]: 2245/3433 cut-off events.
[2024-06-20 19:01:26,722 INFO  L125   PetriNetUnfolderBase]: For 17996/17996 co-relation queries the response was YES.
[2024-06-20 19:01:26,728 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12876 conditions, 3433 events. 2245/3433 cut-off events. For 17996/17996 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17138 event pairs, 888 based on Foata normal form. 4/3424 useless extension candidates. Maximal degree in co-relation 12850. Up to 3271 conditions per place. 
[2024-06-20 19:01:26,738 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 68 selfloop transitions, 14 changer transitions 0/87 dead transitions.
[2024-06-20 19:01:26,738 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 614 flow
[2024-06-20 19:01:26,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:01:26,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:01:26,739 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-20 19:01:26,739 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4318181818181818
[2024-06-20 19:01:26,739 INFO  L175             Difference]: Start difference. First operand has 68 places, 64 transitions, 376 flow. Second operand 7 states and 133 transitions.
[2024-06-20 19:01:26,739 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 614 flow
[2024-06-20 19:01:26,745 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 567 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-20 19:01:26,746 INFO  L231             Difference]: Finished difference. Result has 69 places, 67 transitions, 395 flow
[2024-06-20 19:01:26,747 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=329, 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=395, PETRI_PLACES=69, PETRI_TRANSITIONS=67}
[2024-06-20 19:01:26,748 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places.
[2024-06-20 19:01:26,748 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 395 flow
[2024-06-20 19:01:26,748 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:26,748 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:01:26,748 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:01:26,748 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:01:26,748 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:01:26,749 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:01:26,749 INFO  L85        PathProgramCache]: Analyzing trace with hash 900488729, now seen corresponding path program 1 times
[2024-06-20 19:01:26,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:01:26,749 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608692785]
[2024-06-20 19:01:26,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:01:26,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:01:26,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:38,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:01:38,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:38,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608692785]
[2024-06-20 19:01:38,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608692785] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:38,850 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:38,850 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:01:38,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408981865]
[2024-06-20 19:01:38,850 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:38,851 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:01:38,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:38,851 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:01:38,851 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:01:39,018 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:01:39,018 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 395 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:39,018 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:39,018 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:01:39,018 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:01:40,621 INFO  L124   PetriNetUnfolderBase]: 2267/3500 cut-off events.
[2024-06-20 19:01:40,621 INFO  L125   PetriNetUnfolderBase]: For 21426/21430 co-relation queries the response was YES.
[2024-06-20 19:01:40,627 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13713 conditions, 3500 events. 2267/3500 cut-off events. For 21426/21430 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17741 event pairs, 872 based on Foata normal form. 5/3490 useless extension candidates. Maximal degree in co-relation 13686. Up to 3193 conditions per place. 
[2024-06-20 19:01:40,634 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 68 selfloop transitions, 26 changer transitions 0/99 dead transitions.
[2024-06-20 19:01:40,635 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 99 transitions, 743 flow
[2024-06-20 19:01:40,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:01:40,635 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:01:40,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions.
[2024-06-20 19:01:40,636 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4675324675324675
[2024-06-20 19:01:40,636 INFO  L175             Difference]: Start difference. First operand has 69 places, 67 transitions, 395 flow. Second operand 7 states and 144 transitions.
[2024-06-20 19:01:40,636 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 99 transitions, 743 flow
[2024-06-20 19:01:40,644 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 701 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-06-20 19:01:40,646 INFO  L231             Difference]: Finished difference. Result has 71 places, 74 transitions, 476 flow
[2024-06-20 19:01:40,646 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=71, PETRI_TRANSITIONS=74}
[2024-06-20 19:01:40,646 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places.
[2024-06-20 19:01:40,646 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 476 flow
[2024-06-20 19:01:40,647 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:40,647 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:01:40,647 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:01:40,647 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:01:40,647 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-20 19:01:40,647 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:01:40,647 INFO  L85        PathProgramCache]: Analyzing trace with hash 127234807, now seen corresponding path program 2 times
[2024-06-20 19:01:40,648 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:01:40,648 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789731264]
[2024-06-20 19:01:40,648 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:01:40,648 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:01:40,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:54,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-20 19:01:54,103 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:54,103 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789731264]
[2024-06-20 19:01:54,103 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789731264] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:54,103 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:54,103 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:01:54,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077235589]
[2024-06-20 19:01:54,103 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:54,103 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:01:54,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:54,104 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:01:54,104 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:01:54,230 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:01:54,231 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 476 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:54,231 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:54,231 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:01:54,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:01:55,815 INFO  L124   PetriNetUnfolderBase]: 2278/3515 cut-off events.
[2024-06-20 19:01:55,815 INFO  L125   PetriNetUnfolderBase]: For 25786/25786 co-relation queries the response was YES.
[2024-06-20 19:01:55,821 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14680 conditions, 3515 events. 2278/3515 cut-off events. For 25786/25786 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17785 event pairs, 864 based on Foata normal form. 2/3502 useless extension candidates. Maximal degree in co-relation 14652. Up to 3328 conditions per place. 
[2024-06-20 19:01:55,829 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 77 selfloop transitions, 14 changer transitions 0/96 dead transitions.
[2024-06-20 19:01:55,829 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 96 transitions, 738 flow
[2024-06-20 19:01:55,830 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:01:55,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:01:55,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-20 19:01:55,830 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-20 19:01:55,830 INFO  L175             Difference]: Start difference. First operand has 71 places, 74 transitions, 476 flow. Second operand 7 states and 132 transitions.
[2024-06-20 19:01:55,831 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 96 transitions, 738 flow
[2024-06-20 19:01:55,841 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 700 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-06-20 19:01:55,842 INFO  L231             Difference]: Finished difference. Result has 75 places, 77 transitions, 512 flow
[2024-06-20 19:01:55,842 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=512, PETRI_PLACES=75, PETRI_TRANSITIONS=77}
[2024-06-20 19:01:55,842 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places.
[2024-06-20 19:01:55,842 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 512 flow
[2024-06-20 19:01:55,842 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:55,843 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:01:55,843 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:01:55,843 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:01:55,843 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-20 19:01:55,843 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:01:55,843 INFO  L85        PathProgramCache]: Analyzing trace with hash 906917819, now seen corresponding path program 3 times
[2024-06-20 19:01:55,843 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:01:55,843 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830956126]
[2024-06-20 19:01:55,843 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:01:55,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:01:55,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:02:09,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:02:09,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:02:09,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830956126]
[2024-06-20 19:02:09,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830956126] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:02:09,096 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:02:09,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:02:09,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677840728]
[2024-06-20 19:02:09,096 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:02:09,096 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:02:09,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:02:09,097 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:02:09,097 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:02:09,285 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:02:09,286 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 512 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:09,286 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:02:09,286 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:02:09,286 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:02:10,892 INFO  L124   PetriNetUnfolderBase]: 2273/3508 cut-off events.
[2024-06-20 19:02:10,893 INFO  L125   PetriNetUnfolderBase]: For 29902/29902 co-relation queries the response was YES.
[2024-06-20 19:02:10,901 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15114 conditions, 3508 events. 2273/3508 cut-off events. For 29902/29902 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17715 event pairs, 864 based on Foata normal form. 2/3495 useless extension candidates. Maximal degree in co-relation 15084. Up to 3303 conditions per place. 
[2024-06-20 19:02:10,914 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 75 selfloop transitions, 19 changer transitions 0/99 dead transitions.
[2024-06-20 19:02:10,914 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 99 transitions, 786 flow
[2024-06-20 19:02:10,914 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:02:10,914 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:02:10,915 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-20 19:02:10,915 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43506493506493504
[2024-06-20 19:02:10,915 INFO  L175             Difference]: Start difference. First operand has 75 places, 77 transitions, 512 flow. Second operand 7 states and 134 transitions.
[2024-06-20 19:02:10,915 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 99 transitions, 786 flow
[2024-06-20 19:02:10,931 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 99 transitions, 740 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-20 19:02:10,932 INFO  L231             Difference]: Finished difference. Result has 77 places, 80 transitions, 556 flow
[2024-06-20 19:02:10,933 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=556, PETRI_PLACES=77, PETRI_TRANSITIONS=80}
[2024-06-20 19:02:10,933 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places.
[2024-06-20 19:02:10,933 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 556 flow
[2024-06-20 19:02:10,933 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:10,934 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:02:10,934 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:02:10,934 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:02:10,934 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:02:10,934 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:02:10,934 INFO  L85        PathProgramCache]: Analyzing trace with hash -108138202, now seen corresponding path program 1 times
[2024-06-20 19:02:10,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:02:10,935 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886129571]
[2024-06-20 19:02:10,935 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:02:10,935 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:02:10,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:02:28,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:02:28,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:02:28,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886129571]
[2024-06-20 19:02:28,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886129571] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:02:28,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:02:28,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:02:28,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660624067]
[2024-06-20 19:02:28,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:02:28,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:02:28,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:02:28,985 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:02:28,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:02:29,118 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:02:29,118 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 556 flow. Second operand  has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:29,118 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:02:29,118 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:02:29,119 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:02:30,700 INFO  L124   PetriNetUnfolderBase]: 2486/3849 cut-off events.
[2024-06-20 19:02:30,700 INFO  L125   PetriNetUnfolderBase]: For 38890/38890 co-relation queries the response was YES.
[2024-06-20 19:02:30,708 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17016 conditions, 3849 events. 2486/3849 cut-off events. For 38890/38890 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 19505 event pairs, 990 based on Foata normal form. 1/3849 useless extension candidates. Maximal degree in co-relation 16985. Up to 3628 conditions per place. 
[2024-06-20 19:02:30,720 INFO  L140   encePairwiseOnDemand]: 37/44 looper letters, 73 selfloop transitions, 8 changer transitions 0/91 dead transitions.
[2024-06-20 19:02:30,720 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 762 flow
[2024-06-20 19:02:30,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:02:30,720 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:02:30,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions.
[2024-06-20 19:02:30,721 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42727272727272725
[2024-06-20 19:02:30,721 INFO  L175             Difference]: Start difference. First operand has 77 places, 80 transitions, 556 flow. Second operand 5 states and 94 transitions.
[2024-06-20 19:02:30,721 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 762 flow
[2024-06-20 19:02:30,738 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 700 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-20 19:02:30,739 INFO  L231             Difference]: Finished difference. Result has 77 places, 83 transitions, 546 flow
[2024-06-20 19:02:30,739 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=546, PETRI_PLACES=77, PETRI_TRANSITIONS=83}
[2024-06-20 19:02:30,740 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places.
[2024-06-20 19:02:30,741 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 83 transitions, 546 flow
[2024-06-20 19:02:30,741 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:30,741 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:02:30,741 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:02:30,742 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:02:30,742 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-20 19:02:30,742 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:02:30,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 1144725144, now seen corresponding path program 1 times
[2024-06-20 19:02:30,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:02:30,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144134032]
[2024-06-20 19:02:30,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:02:30,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:02:30,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:02:44,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:02:44,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:02:44,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144134032]
[2024-06-20 19:02:44,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144134032] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:02:44,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:02:44,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:02:44,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903962830]
[2024-06-20 19:02:44,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:02:44,291 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:02:44,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:02:44,291 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:02:44,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:02:44,527 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:02:44,527 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 83 transitions, 546 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-20 19:02:44,527 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:02:44,527 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:02:44,527 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:02:46,075 INFO  L124   PetriNetUnfolderBase]: 2163/3396 cut-off events.
[2024-06-20 19:02:46,075 INFO  L125   PetriNetUnfolderBase]: For 38200/38202 co-relation queries the response was YES.
[2024-06-20 19:02:46,082 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15689 conditions, 3396 events. 2163/3396 cut-off events. For 38200/38202 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17577 event pairs, 796 based on Foata normal form. 4/3399 useless extension candidates. Maximal degree in co-relation 15657. Up to 3041 conditions per place. 
[2024-06-20 19:02:46,090 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 79 selfloop transitions, 26 changer transitions 0/116 dead transitions.
[2024-06-20 19:02:46,090 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 938 flow
[2024-06-20 19:02:46,091 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:02:46,091 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:02:46,091 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions.
[2024-06-20 19:02:46,091 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.487012987012987
[2024-06-20 19:02:46,091 INFO  L175             Difference]: Start difference. First operand has 77 places, 83 transitions, 546 flow. Second operand 7 states and 150 transitions.
[2024-06-20 19:02:46,091 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 938 flow
[2024-06-20 19:02:46,102 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 116 transitions, 908 flow, removed 9 selfloop flow, removed 3 redundant places.
[2024-06-20 19:02:46,103 INFO  L231             Difference]: Finished difference. Result has 81 places, 89 transitions, 642 flow
[2024-06-20 19:02:46,104 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=642, PETRI_PLACES=81, PETRI_TRANSITIONS=89}
[2024-06-20 19:02:46,104 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places.
[2024-06-20 19:02:46,104 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 89 transitions, 642 flow
[2024-06-20 19:02:46,104 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-20 19:02:46,104 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:02:46,105 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:02:46,105 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:02:46,105 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:02:46,105 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:02:46,105 INFO  L85        PathProgramCache]: Analyzing trace with hash 1297860498, now seen corresponding path program 2 times
[2024-06-20 19:02:46,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:02:46,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814421622]
[2024-06-20 19:02:46,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:02:46,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:02:46,162 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:02:59,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:02:59,939 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:02:59,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814421622]
[2024-06-20 19:02:59,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814421622] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:02:59,940 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:02:59,940 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:02:59,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715758846]
[2024-06-20 19:02:59,940 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:02:59,941 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:02:59,941 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:02:59,941 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:02:59,941 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:03:00,207 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:03:00,208 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 89 transitions, 642 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-20 19:03:00,208 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:03:00,208 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:03:00,208 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:03:01,751 INFO  L124   PetriNetUnfolderBase]: 2158/3389 cut-off events.
[2024-06-20 19:03:01,751 INFO  L125   PetriNetUnfolderBase]: For 43578/43580 co-relation queries the response was YES.
[2024-06-20 19:03:01,759 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16397 conditions, 3389 events. 2158/3389 cut-off events. For 43578/43580 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17509 event pairs, 796 based on Foata normal form. 4/3392 useless extension candidates. Maximal degree in co-relation 16364. Up to 3069 conditions per place. 
[2024-06-20 19:03:01,768 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 78 selfloop transitions, 22 changer transitions 0/111 dead transitions.
[2024-06-20 19:03:01,768 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 898 flow
[2024-06-20 19:03:01,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:03:01,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:03:01,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions.
[2024-06-20 19:03:01,769 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4707792207792208
[2024-06-20 19:03:01,770 INFO  L175             Difference]: Start difference. First operand has 81 places, 89 transitions, 642 flow. Second operand 7 states and 145 transitions.
[2024-06-20 19:03:01,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 898 flow
[2024-06-20 19:03:01,786 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 111 transitions, 837 flow, removed 21 selfloop flow, removed 3 redundant places.
[2024-06-20 19:03:01,788 INFO  L231             Difference]: Finished difference. Result has 85 places, 89 transitions, 633 flow
[2024-06-20 19:03:01,788 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=633, PETRI_PLACES=85, PETRI_TRANSITIONS=89}
[2024-06-20 19:03:01,788 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places.
[2024-06-20 19:03:01,788 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 633 flow
[2024-06-20 19:03:01,788 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-20 19:03:01,788 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:03:01,789 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:03:01,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:03:01,789 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-20 19:03:01,789 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:03:01,789 INFO  L85        PathProgramCache]: Analyzing trace with hash 1301579723, now seen corresponding path program 1 times
[2024-06-20 19:03:01,789 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:03:01,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289454683]
[2024-06-20 19:03:01,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:03:01,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:03:01,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:03:15,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-20 19:03:15,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:03:15,475 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289454683]
[2024-06-20 19:03:15,476 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289454683] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:03:15,476 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:03:15,476 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:03:15,476 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468845157]
[2024-06-20 19:03:15,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:03:15,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:03:15,477 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:03:15,477 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:03:15,477 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:03:15,705 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:03:15,706 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 633 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-20 19:03:15,706 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:03:15,706 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:03:15,706 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:03:17,246 INFO  L124   PetriNetUnfolderBase]: 2287/3523 cut-off events.
[2024-06-20 19:03:17,246 INFO  L125   PetriNetUnfolderBase]: For 48417/48419 co-relation queries the response was YES.
[2024-06-20 19:03:17,254 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17331 conditions, 3523 events. 2287/3523 cut-off events. For 48417/48419 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17709 event pairs, 850 based on Foata normal form. 2/3524 useless extension candidates. Maximal degree in co-relation 17296. Up to 3214 conditions per place. 
[2024-06-20 19:03:17,264 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 78 selfloop transitions, 36 changer transitions 0/119 dead transitions.
[2024-06-20 19:03:17,264 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 119 transitions, 1029 flow
[2024-06-20 19:03:17,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:03:17,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:03:17,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions.
[2024-06-20 19:03:17,265 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4772727272727273
[2024-06-20 19:03:17,265 INFO  L175             Difference]: Start difference. First operand has 85 places, 89 transitions, 633 flow. Second operand 7 states and 147 transitions.
[2024-06-20 19:03:17,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 119 transitions, 1029 flow
[2024-06-20 19:03:17,290 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 119 transitions, 974 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-20 19:03:17,291 INFO  L231             Difference]: Finished difference. Result has 86 places, 92 transitions, 696 flow
[2024-06-20 19:03:17,292 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=696, PETRI_PLACES=86, PETRI_TRANSITIONS=92}
[2024-06-20 19:03:17,292 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places.
[2024-06-20 19:03:17,292 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 696 flow
[2024-06-20 19:03:17,292 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-20 19:03:17,292 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:03:17,293 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:03:17,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:03:17,293 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-20 19:03:17,293 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:03:17,293 INFO  L85        PathProgramCache]: Analyzing trace with hash 1301585520, now seen corresponding path program 1 times
[2024-06-20 19:03:17,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:03:17,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759855252]
[2024-06-20 19:03:17,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:03:17,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:03:17,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:03:30,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:03:30,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:03:30,628 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759855252]
[2024-06-20 19:03:30,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759855252] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:03:30,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:03:30,629 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:03:30,629 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927130498]
[2024-06-20 19:03:30,629 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:03:30,629 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:03:30,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:03:30,630 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:03:30,630 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:03:30,846 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:03:30,846 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 696 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:03:30,846 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:03:30,846 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:03:30,846 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:03:32,357 INFO  L124   PetriNetUnfolderBase]: 2363/3639 cut-off events.
[2024-06-20 19:03:32,357 INFO  L125   PetriNetUnfolderBase]: For 55071/55073 co-relation queries the response was YES.
[2024-06-20 19:03:32,366 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18264 conditions, 3639 events. 2363/3639 cut-off events. For 55071/55073 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18326 event pairs, 758 based on Foata normal form. 8/3646 useless extension candidates. Maximal degree in co-relation 18228. Up to 3190 conditions per place. 
[2024-06-20 19:03:32,375 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 90 selfloop transitions, 38 changer transitions 0/133 dead transitions.
[2024-06-20 19:03:32,376 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 133 transitions, 1186 flow
[2024-06-20 19:03:32,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:03:32,376 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:03:32,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions.
[2024-06-20 19:03:32,377 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4715909090909091
[2024-06-20 19:03:32,377 INFO  L175             Difference]: Start difference. First operand has 86 places, 92 transitions, 696 flow. Second operand 8 states and 166 transitions.
[2024-06-20 19:03:32,377 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 133 transitions, 1186 flow
[2024-06-20 19:03:32,402 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 133 transitions, 1084 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-20 19:03:32,404 INFO  L231             Difference]: Finished difference. Result has 90 places, 102 transitions, 785 flow
[2024-06-20 19:03:32,404 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=785, PETRI_PLACES=90, PETRI_TRANSITIONS=102}
[2024-06-20 19:03:32,404 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 45 predicate places.
[2024-06-20 19:03:32,404 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 102 transitions, 785 flow
[2024-06-20 19:03:32,404 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:03:32,405 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:03:32,405 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:03:32,405 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:03:32,405 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:03:32,405 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:03:32,405 INFO  L85        PathProgramCache]: Analyzing trace with hash 1301585303, now seen corresponding path program 2 times
[2024-06-20 19:03:32,405 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:03:32,405 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597187236]
[2024-06-20 19:03:32,405 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:03:32,405 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:03:32,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:03:44,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:03:44,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:03:44,876 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597187236]
[2024-06-20 19:03:44,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597187236] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:03:44,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:03:44,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:03:44,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720999893]
[2024-06-20 19:03:44,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:03:44,876 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:03:44,876 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:03:44,877 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:03:44,877 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:03:45,115 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:03:45,116 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 102 transitions, 785 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-20 19:03:45,116 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:03:45,116 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:03:45,116 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:03:46,658 INFO  L124   PetriNetUnfolderBase]: 2374/3655 cut-off events.
[2024-06-20 19:03:46,658 INFO  L125   PetriNetUnfolderBase]: For 61728/61730 co-relation queries the response was YES.
[2024-06-20 19:03:46,668 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19450 conditions, 3655 events. 2374/3655 cut-off events. For 61728/61730 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18408 event pairs, 790 based on Foata normal form. 2/3656 useless extension candidates. Maximal degree in co-relation 19412. Up to 3336 conditions per place. 
[2024-06-20 19:03:46,680 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 88 selfloop transitions, 36 changer transitions 0/129 dead transitions.
[2024-06-20 19:03:46,680 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 129 transitions, 1205 flow
[2024-06-20 19:03:46,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:03:46,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:03:46,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-20 19:03:46,682 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-20 19:03:46,682 INFO  L175             Difference]: Start difference. First operand has 90 places, 102 transitions, 785 flow. Second operand 7 states and 143 transitions.
[2024-06-20 19:03:46,682 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 129 transitions, 1205 flow
[2024-06-20 19:03:46,711 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 129 transitions, 1158 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-20 19:03:46,713 INFO  L231             Difference]: Finished difference. Result has 94 places, 105 transitions, 861 flow
[2024-06-20 19:03:46,713 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=861, PETRI_PLACES=94, PETRI_TRANSITIONS=105}
[2024-06-20 19:03:46,713 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 49 predicate places.
[2024-06-20 19:03:46,714 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 105 transitions, 861 flow
[2024-06-20 19:03:46,714 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-20 19:03:46,714 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:03:46,714 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:03:46,714 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:03:46,714 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:03:46,715 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:03:46,715 INFO  L85        PathProgramCache]: Analyzing trace with hash -350686909, now seen corresponding path program 3 times
[2024-06-20 19:03:46,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:03:46,715 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320535577]
[2024-06-20 19:03:46,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:03:46,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:03:46,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:03:59,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:03:59,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:03:59,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320535577]
[2024-06-20 19:03:59,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320535577] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:03:59,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:03:59,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:03:59,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036178721]
[2024-06-20 19:03:59,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:03:59,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:03:59,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:03:59,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:03:59,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:03:59,187 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:03:59,187 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 105 transitions, 861 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-20 19:03:59,187 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:03:59,187 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:03:59,187 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:04:00,841 INFO  L124   PetriNetUnfolderBase]: 2369/3648 cut-off events.
[2024-06-20 19:04:00,841 INFO  L125   PetriNetUnfolderBase]: For 67197/67199 co-relation queries the response was YES.
[2024-06-20 19:04:00,853 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19686 conditions, 3648 events. 2369/3648 cut-off events. For 67197/67199 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18388 event pairs, 786 based on Foata normal form. 4/3651 useless extension candidates. Maximal degree in co-relation 19645. Up to 3452 conditions per place. 
[2024-06-20 19:04:00,863 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 103 selfloop transitions, 16 changer transitions 0/124 dead transitions.
[2024-06-20 19:04:00,863 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 124 transitions, 1147 flow
[2024-06-20 19:04:00,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:04:00,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:04:00,864 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-20 19:04:00,864 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4318181818181818
[2024-06-20 19:04:00,864 INFO  L175             Difference]: Start difference. First operand has 94 places, 105 transitions, 861 flow. Second operand 7 states and 133 transitions.
[2024-06-20 19:04:00,864 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 124 transitions, 1147 flow
[2024-06-20 19:04:00,895 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 124 transitions, 1049 flow, removed 24 selfloop flow, removed 4 redundant places.
[2024-06-20 19:04:00,897 INFO  L231             Difference]: Finished difference. Result has 97 places, 105 transitions, 803 flow
[2024-06-20 19:04:00,897 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=803, PETRI_PLACES=97, PETRI_TRANSITIONS=105}
[2024-06-20 19:04:00,897 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 52 predicate places.
[2024-06-20 19:04:00,897 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 105 transitions, 803 flow
[2024-06-20 19:04:00,898 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-20 19:04:00,898 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:04:00,898 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:04:00,898 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:04:00,898 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:04:00,898 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:04:00,899 INFO  L85        PathProgramCache]: Analyzing trace with hash 665757698, now seen corresponding path program 2 times
[2024-06-20 19:04:00,899 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:04:00,899 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630741432]
[2024-06-20 19:04:00,899 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:04:00,899 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:04:00,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:04:14,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:04:14,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:04:14,072 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630741432]
[2024-06-20 19:04:14,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630741432] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:04:14,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:04:14,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:04:14,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385003988]
[2024-06-20 19:04:14,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:04:14,073 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:04:14,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:04:14,073 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:04:14,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:04:14,295 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:04:14,295 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 105 transitions, 803 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:04:14,295 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:04:14,296 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:04:14,296 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:04:16,002 INFO  L124   PetriNetUnfolderBase]: 2423/3730 cut-off events.
[2024-06-20 19:04:16,002 INFO  L125   PetriNetUnfolderBase]: For 74782/74782 co-relation queries the response was YES.
[2024-06-20 19:04:16,012 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20393 conditions, 3730 events. 2423/3730 cut-off events. For 74782/74782 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18855 event pairs, 784 based on Foata normal form. 4/3733 useless extension candidates. Maximal degree in co-relation 20351. Up to 3488 conditions per place. 
[2024-06-20 19:04:16,023 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 111 selfloop transitions, 22 changer transitions 0/138 dead transitions.
[2024-06-20 19:04:16,023 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 138 transitions, 1301 flow
[2024-06-20 19:04:16,024 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:04:16,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:04:16,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-20 19:04:16,024 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4403409090909091
[2024-06-20 19:04:16,025 INFO  L175             Difference]: Start difference. First operand has 97 places, 105 transitions, 803 flow. Second operand 8 states and 155 transitions.
[2024-06-20 19:04:16,025 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 138 transitions, 1301 flow
[2024-06-20 19:04:16,057 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 138 transitions, 1236 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-20 19:04:16,059 INFO  L231             Difference]: Finished difference. Result has 98 places, 111 transitions, 880 flow
[2024-06-20 19:04:16,059 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=880, PETRI_PLACES=98, PETRI_TRANSITIONS=111}
[2024-06-20 19:04:16,060 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places.
[2024-06-20 19:04:16,060 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 111 transitions, 880 flow
[2024-06-20 19:04:16,060 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:04:16,060 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:04:16,060 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:04:16,060 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 19:04:16,060 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:04:16,061 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:04:16,061 INFO  L85        PathProgramCache]: Analyzing trace with hash -1950317096, now seen corresponding path program 3 times
[2024-06-20 19:04:16,061 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:04:16,061 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37188813]
[2024-06-20 19:04:16,061 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:04:16,061 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:04:16,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:04:30,004 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:04:30,004 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:04:30,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37188813]
[2024-06-20 19:04:30,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37188813] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:04:30,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:04:30,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:04:30,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639253169]
[2024-06-20 19:04:30,005 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:04:30,005 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:04:30,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:04:30,005 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:04:30,005 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:04:30,234 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:04:30,234 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 111 transitions, 880 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:04:30,235 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:04:30,235 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:04:30,235 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:04:31,923 INFO  L124   PetriNetUnfolderBase]: 2413/3716 cut-off events.
[2024-06-20 19:04:31,923 INFO  L125   PetriNetUnfolderBase]: For 81419/81419 co-relation queries the response was YES.
[2024-06-20 19:04:31,933 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20738 conditions, 3716 events. 2413/3716 cut-off events. For 81419/81419 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18757 event pairs, 782 based on Foata normal form. 4/3719 useless extension candidates. Maximal degree in co-relation 20695. Up to 3438 conditions per place. 
[2024-06-20 19:04:31,944 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 107 selfloop transitions, 29 changer transitions 0/141 dead transitions.
[2024-06-20 19:04:31,944 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 141 transitions, 1352 flow
[2024-06-20 19:04:31,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:04:31,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:04:31,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-20 19:04:31,945 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4460227272727273
[2024-06-20 19:04:31,946 INFO  L175             Difference]: Start difference. First operand has 98 places, 111 transitions, 880 flow. Second operand 8 states and 157 transitions.
[2024-06-20 19:04:31,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 141 transitions, 1352 flow
[2024-06-20 19:04:31,978 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 141 transitions, 1294 flow, removed 19 selfloop flow, removed 4 redundant places.
[2024-06-20 19:04:31,979 INFO  L231             Difference]: Finished difference. Result has 102 places, 114 transitions, 942 flow
[2024-06-20 19:04:31,980 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=942, PETRI_PLACES=102, PETRI_TRANSITIONS=114}
[2024-06-20 19:04:31,980 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 57 predicate places.
[2024-06-20 19:04:31,980 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 114 transitions, 942 flow
[2024-06-20 19:04:31,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:04:31,980 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:04:31,980 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:04:31,980 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 19:04:31,981 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:04:31,981 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:04:31,981 INFO  L85        PathProgramCache]: Analyzing trace with hash -1942698536, now seen corresponding path program 4 times
[2024-06-20 19:04:31,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:04:31,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81725979]
[2024-06-20 19:04:31,981 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:04:31,981 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:04:32,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:04:44,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:04:44,800 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:04:44,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81725979]
[2024-06-20 19:04:44,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81725979] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:04:44,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:04:44,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:04:44,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962570818]
[2024-06-20 19:04:44,801 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:04:44,801 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:04:44,801 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:04:44,802 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:04:44,802 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:04:44,990 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:04:44,990 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 114 transitions, 942 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:04:44,991 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:04:44,991 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:04:44,991 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:04:46,737 INFO  L124   PetriNetUnfolderBase]: 2403/3702 cut-off events.
[2024-06-20 19:04:46,737 INFO  L125   PetriNetUnfolderBase]: For 87620/87620 co-relation queries the response was YES.
[2024-06-20 19:04:46,748 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21060 conditions, 3702 events. 2403/3702 cut-off events. For 87620/87620 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18694 event pairs, 780 based on Foata normal form. 4/3705 useless extension candidates. Maximal degree in co-relation 21016. Up to 3493 conditions per place. 
[2024-06-20 19:04:46,760 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 116 selfloop transitions, 17 changer transitions 0/138 dead transitions.
[2024-06-20 19:04:46,761 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 138 transitions, 1270 flow
[2024-06-20 19:04:46,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:04:46,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:04:46,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-20 19:04:46,762 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42613636363636365
[2024-06-20 19:04:46,762 INFO  L175             Difference]: Start difference. First operand has 102 places, 114 transitions, 942 flow. Second operand 8 states and 150 transitions.
[2024-06-20 19:04:46,762 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 138 transitions, 1270 flow
[2024-06-20 19:04:46,810 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 138 transitions, 1156 flow, removed 30 selfloop flow, removed 6 redundant places.
[2024-06-20 19:04:46,811 INFO  L231             Difference]: Finished difference. Result has 104 places, 114 transitions, 870 flow
[2024-06-20 19:04:46,811 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=870, PETRI_PLACES=104, PETRI_TRANSITIONS=114}
[2024-06-20 19:04:46,812 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 59 predicate places.
[2024-06-20 19:04:46,812 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 114 transitions, 870 flow
[2024-06-20 19:04:46,812 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:04:46,812 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:04:46,812 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:04:46,812 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 19:04:46,813 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:04:46,813 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:04:46,813 INFO  L85        PathProgramCache]: Analyzing trace with hash 942684478, now seen corresponding path program 1 times
[2024-06-20 19:04:46,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:04:46,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49768116]
[2024-06-20 19:04:46,813 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:04:46,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:04:46,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:05:07,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:05:07,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:05:07,566 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49768116]
[2024-06-20 19:05:07,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49768116] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:05:07,566 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:05:07,566 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:05:07,566 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358283438]
[2024-06-20 19:05:07,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:05:07,567 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:05:07,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:05:07,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:05:07,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:05:07,720 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44
[2024-06-20 19:05:07,720 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 114 transitions, 870 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:05:07,720 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:05:07,720 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44
[2024-06-20 19:05:07,720 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:05:09,561 INFO  L124   PetriNetUnfolderBase]: 2966/4422 cut-off events.
[2024-06-20 19:05:09,562 INFO  L125   PetriNetUnfolderBase]: For 121087/121087 co-relation queries the response was YES.
[2024-06-20 19:05:09,573 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25835 conditions, 4422 events. 2966/4422 cut-off events. For 121087/121087 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 21507 event pairs, 1046 based on Foata normal form. 1/4422 useless extension candidates. Maximal degree in co-relation 25790. Up to 4322 conditions per place. 
[2024-06-20 19:05:09,586 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 104 selfloop transitions, 11 changer transitions 0/126 dead transitions.
[2024-06-20 19:05:09,586 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 126 transitions, 1150 flow
[2024-06-20 19:05:09,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:05:09,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:05:09,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-20 19:05:09,587 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39015151515151514
[2024-06-20 19:05:09,587 INFO  L175             Difference]: Start difference. First operand has 104 places, 114 transitions, 870 flow. Second operand 6 states and 103 transitions.
[2024-06-20 19:05:09,587 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 126 transitions, 1150 flow
[2024-06-20 19:05:09,637 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 126 transitions, 1106 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-20 19:05:09,639 INFO  L231             Difference]: Finished difference. Result has 103 places, 117 transitions, 888 flow
[2024-06-20 19:05:09,639 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=888, PETRI_PLACES=103, PETRI_TRANSITIONS=117}
[2024-06-20 19:05:09,639 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 58 predicate places.
[2024-06-20 19:05:09,639 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 117 transitions, 888 flow
[2024-06-20 19:05:09,639 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:05:09,639 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:05:09,639 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:05:09,640 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 19:05:09,640 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:05:09,640 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:05:09,640 INFO  L85        PathProgramCache]: Analyzing trace with hash 1126682078, now seen corresponding path program 1 times
[2024-06-20 19:05:09,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:05:09,640 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103660274]
[2024-06-20 19:05:09,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:05:09,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:05:09,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:05:24,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:05:24,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:05:24,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103660274]
[2024-06-20 19:05:24,369 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103660274] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:05:24,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:05:24,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:05:24,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647513824]
[2024-06-20 19:05:24,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:05:24,370 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:05:24,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:05:24,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:05:24,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:05:24,647 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:05:24,648 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 117 transitions, 888 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-20 19:05:24,648 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:05:24,648 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:05:24,648 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:05:26,472 INFO  L124   PetriNetUnfolderBase]: 2365/3693 cut-off events.
[2024-06-20 19:05:26,472 INFO  L125   PetriNetUnfolderBase]: For 115011/115013 co-relation queries the response was YES.
[2024-06-20 19:05:26,482 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22712 conditions, 3693 events. 2365/3693 cut-off events. For 115011/115013 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19297 event pairs, 572 based on Foata normal form. 6/3698 useless extension candidates. Maximal degree in co-relation 22666. Up to 3206 conditions per place. 
[2024-06-20 19:05:26,495 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 108 selfloop transitions, 32 changer transitions 0/154 dead transitions.
[2024-06-20 19:05:26,495 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 154 transitions, 1406 flow
[2024-06-20 19:05:26,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:05:26,497 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:05:26,498 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions.
[2024-06-20 19:05:26,498 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48011363636363635
[2024-06-20 19:05:26,498 INFO  L175             Difference]: Start difference. First operand has 103 places, 117 transitions, 888 flow. Second operand 8 states and 169 transitions.
[2024-06-20 19:05:26,498 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 154 transitions, 1406 flow
[2024-06-20 19:05:26,557 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 154 transitions, 1366 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-20 19:05:26,559 INFO  L231             Difference]: Finished difference. Result has 107 places, 121 transitions, 987 flow
[2024-06-20 19:05:26,559 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=987, PETRI_PLACES=107, PETRI_TRANSITIONS=121}
[2024-06-20 19:05:26,559 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 62 predicate places.
[2024-06-20 19:05:26,559 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 121 transitions, 987 flow
[2024-06-20 19:05:26,560 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-20 19:05:26,560 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:05:26,560 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:05:26,560 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 19:05:26,560 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-20 19:05:26,560 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:05:26,560 INFO  L85        PathProgramCache]: Analyzing trace with hash 1126742528, now seen corresponding path program 2 times
[2024-06-20 19:05:26,560 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:05:26,560 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725622698]
[2024-06-20 19:05:26,560 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:05:26,561 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:05:26,613 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:05:41,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:05:41,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:05:41,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725622698]
[2024-06-20 19:05:41,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725622698] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:05:41,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:05:41,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:05:41,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523558095]
[2024-06-20 19:05:41,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:05:41,116 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:05:41,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:05:41,117 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:05:41,117 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:05:41,343 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:05:41,344 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 121 transitions, 987 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-20 19:05:41,344 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:05:41,344 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:05:41,344 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:05:43,222 INFO  L124   PetriNetUnfolderBase]: 2382/3720 cut-off events.
[2024-06-20 19:05:43,222 INFO  L125   PetriNetUnfolderBase]: For 124882/124884 co-relation queries the response was YES.
[2024-06-20 19:05:43,233 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23535 conditions, 3720 events. 2382/3720 cut-off events. For 124882/124884 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19436 event pairs, 733 based on Foata normal form. 6/3725 useless extension candidates. Maximal degree in co-relation 23488. Up to 3315 conditions per place. 
[2024-06-20 19:05:43,246 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 111 selfloop transitions, 28 changer transitions 0/153 dead transitions.
[2024-06-20 19:05:43,247 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 153 transitions, 1377 flow
[2024-06-20 19:05:43,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:05:43,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:05:43,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions.
[2024-06-20 19:05:43,250 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4715909090909091
[2024-06-20 19:05:43,250 INFO  L175             Difference]: Start difference. First operand has 107 places, 121 transitions, 987 flow. Second operand 8 states and 166 transitions.
[2024-06-20 19:05:43,250 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 153 transitions, 1377 flow
[2024-06-20 19:05:43,319 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 153 transitions, 1295 flow, removed 26 selfloop flow, removed 4 redundant places.
[2024-06-20 19:05:43,321 INFO  L231             Difference]: Finished difference. Result has 111 places, 123 transitions, 1008 flow
[2024-06-20 19:05:43,321 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1008, PETRI_PLACES=111, PETRI_TRANSITIONS=123}
[2024-06-20 19:05:43,322 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 66 predicate places.
[2024-06-20 19:05:43,322 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 123 transitions, 1008 flow
[2024-06-20 19:05:43,322 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-20 19:05:43,322 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:05:43,322 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:05:43,322 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 19:05:43,322 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-20 19:05:43,323 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:05:43,323 INFO  L85        PathProgramCache]: Analyzing trace with hash 1126742652, now seen corresponding path program 1 times
[2024-06-20 19:05:43,323 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:05:43,323 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493680773]
[2024-06-20 19:05:43,323 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:05:43,323 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:05:43,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:05:57,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:05:57,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:05:57,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493680773]
[2024-06-20 19:05:57,706 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493680773] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:05:57,706 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:05:57,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:05:57,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046025168]
[2024-06-20 19:05:57,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:05:57,707 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:05:57,707 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:05:57,707 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:05:57,708 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:05:57,945 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:05:57,945 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 123 transitions, 1008 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-20 19:05:57,945 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:05:57,945 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:05:57,945 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:05:59,833 INFO  L124   PetriNetUnfolderBase]: 2526/3869 cut-off events.
[2024-06-20 19:05:59,833 INFO  L125   PetriNetUnfolderBase]: For 133174/133176 co-relation queries the response was YES.
[2024-06-20 19:05:59,845 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24481 conditions, 3869 events. 2526/3869 cut-off events. For 133174/133176 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19711 event pairs, 766 based on Foata normal form. 2/3870 useless extension candidates. Maximal degree in co-relation 24432. Up to 3442 conditions per place. 
[2024-06-20 19:05:59,858 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 109 selfloop transitions, 45 changer transitions 0/160 dead transitions.
[2024-06-20 19:05:59,859 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 160 transitions, 1566 flow
[2024-06-20 19:05:59,861 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:05:59,861 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:05:59,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-20 19:05:59,862 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4659090909090909
[2024-06-20 19:05:59,862 INFO  L175             Difference]: Start difference. First operand has 111 places, 123 transitions, 1008 flow. Second operand 8 states and 164 transitions.
[2024-06-20 19:05:59,862 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 160 transitions, 1566 flow
[2024-06-20 19:05:59,928 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 160 transitions, 1497 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-20 19:05:59,930 INFO  L231             Difference]: Finished difference. Result has 113 places, 129 transitions, 1115 flow
[2024-06-20 19:05:59,930 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1115, PETRI_PLACES=113, PETRI_TRANSITIONS=129}
[2024-06-20 19:05:59,930 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 68 predicate places.
[2024-06-20 19:05:59,930 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 129 transitions, 1115 flow
[2024-06-20 19:05:59,931 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-20 19:05:59,931 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:05:59,931 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:05:59,931 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 19:05:59,931 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-20 19:05:59,931 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:05:59,931 INFO  L85        PathProgramCache]: Analyzing trace with hash 1578975980, now seen corresponding path program 2 times
[2024-06-20 19:05:59,931 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:05:59,931 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581384788]
[2024-06-20 19:05:59,931 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:05:59,931 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:05:59,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:06:15,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:06:15,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:06:15,165 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581384788]
[2024-06-20 19:06:15,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581384788] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:06:15,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:06:15,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:06:15,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392104585]
[2024-06-20 19:06:15,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:06:15,165 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:06:15,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:06:15,166 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:06:15,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:06:15,390 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:06:15,390 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 129 transitions, 1115 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-20 19:06:15,390 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:06:15,390 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:06:15,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:06:17,244 INFO  L124   PetriNetUnfolderBase]: 2537/3885 cut-off events.
[2024-06-20 19:06:17,245 INFO  L125   PetriNetUnfolderBase]: For 143537/143539 co-relation queries the response was YES.
[2024-06-20 19:06:17,256 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25292 conditions, 3885 events. 2537/3885 cut-off events. For 143537/143539 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19753 event pairs, 766 based on Foata normal form. 2/3886 useless extension candidates. Maximal degree in co-relation 25242. Up to 3536 conditions per place. 
[2024-06-20 19:06:17,270 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 113 selfloop transitions, 39 changer transitions 0/158 dead transitions.
[2024-06-20 19:06:17,271 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 158 transitions, 1527 flow
[2024-06-20 19:06:17,273 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:06:17,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:06:17,273 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-20 19:06:17,273 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45170454545454547
[2024-06-20 19:06:17,273 INFO  L175             Difference]: Start difference. First operand has 113 places, 129 transitions, 1115 flow. Second operand 8 states and 159 transitions.
[2024-06-20 19:06:17,273 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 158 transitions, 1527 flow
[2024-06-20 19:06:17,345 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 158 transitions, 1442 flow, removed 23 selfloop flow, removed 4 redundant places.
[2024-06-20 19:06:17,347 INFO  L231             Difference]: Finished difference. Result has 117 places, 132 transitions, 1164 flow
[2024-06-20 19:06:17,347 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1164, PETRI_PLACES=117, PETRI_TRANSITIONS=132}
[2024-06-20 19:06:17,347 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 72 predicate places.
[2024-06-20 19:06:17,347 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 132 transitions, 1164 flow
[2024-06-20 19:06:17,347 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-20 19:06:17,348 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:06:17,348 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:06:17,348 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 19:06:17,348 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-20 19:06:17,348 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:06:17,348 INFO  L85        PathProgramCache]: Analyzing trace with hash 1578971206, now seen corresponding path program 3 times
[2024-06-20 19:06:17,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:06:17,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603642849]
[2024-06-20 19:06:17,349 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:06:17,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:06:17,399 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:06:31,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-20 19:06:31,435 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:06:31,435 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603642849]
[2024-06-20 19:06:31,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603642849] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:06:31,435 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:06:31,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:06:31,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204560620]
[2024-06-20 19:06:31,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:06:31,435 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:06:31,436 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:06:31,436 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:06:31,436 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:06:31,688 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:06:31,688 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 132 transitions, 1164 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-20 19:06:31,688 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:06:31,688 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:06:31,688 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:06:33,534 INFO  L124   PetriNetUnfolderBase]: 2402/3746 cut-off events.
[2024-06-20 19:06:33,534 INFO  L125   PetriNetUnfolderBase]: For 152200/152202 co-relation queries the response was YES.
[2024-06-20 19:06:33,546 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24960 conditions, 3746 events. 2402/3746 cut-off events. For 152200/152202 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19570 event pairs, 725 based on Foata normal form. 6/3751 useless extension candidates. Maximal degree in co-relation 24908. Up to 3363 conditions per place. 
[2024-06-20 19:06:33,559 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 118 selfloop transitions, 24 changer transitions 0/159 dead transitions.
[2024-06-20 19:06:33,559 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 159 transitions, 1516 flow
[2024-06-20 19:06:33,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:06:33,562 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:06:33,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-20 19:06:33,562 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4630681818181818
[2024-06-20 19:06:33,562 INFO  L175             Difference]: Start difference. First operand has 117 places, 132 transitions, 1164 flow. Second operand 8 states and 163 transitions.
[2024-06-20 19:06:33,562 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 159 transitions, 1516 flow
[2024-06-20 19:06:33,613 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 159 transitions, 1408 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-20 19:06:33,617 INFO  L231             Difference]: Finished difference. Result has 119 places, 132 transitions, 1111 flow
[2024-06-20 19:06:33,618 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1111, PETRI_PLACES=119, PETRI_TRANSITIONS=132}
[2024-06-20 19:06:33,618 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 74 predicate places.
[2024-06-20 19:06:33,618 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 132 transitions, 1111 flow
[2024-06-20 19:06:33,619 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-20 19:06:33,619 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:06:33,619 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:06:33,619 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 19:06:33,619 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-20 19:06:33,619 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:06:33,620 INFO  L85        PathProgramCache]: Analyzing trace with hash 1129539162, now seen corresponding path program 3 times
[2024-06-20 19:06:33,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:06:33,620 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761198815]
[2024-06-20 19:06:33,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:06:33,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:06:33,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:06:47,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:06:47,631 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:06:47,631 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761198815]
[2024-06-20 19:06:47,631 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761198815] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:06:47,631 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:06:47,631 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:06:47,631 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507161784]
[2024-06-20 19:06:47,631 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:06:47,631 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:06:47,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:06:47,632 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:06:47,632 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:06:47,904 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:06:47,904 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 132 transitions, 1111 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-20 19:06:47,904 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:06:47,904 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:06:47,904 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:06:49,810 INFO  L124   PetriNetUnfolderBase]: 2540/3889 cut-off events.
[2024-06-20 19:06:49,811 INFO  L125   PetriNetUnfolderBase]: For 161132/161134 co-relation queries the response was YES.
[2024-06-20 19:06:49,823 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25916 conditions, 3889 events. 2540/3889 cut-off events. For 161132/161134 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19809 event pairs, 764 based on Foata normal form. 2/3890 useless extension candidates. Maximal degree in co-relation 25863. Up to 3522 conditions per place. 
[2024-06-20 19:06:49,837 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 114 selfloop transitions, 45 changer transitions 0/165 dead transitions.
[2024-06-20 19:06:49,837 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 165 transitions, 1545 flow
[2024-06-20 19:06:49,839 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:06:49,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:06:49,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-20 19:06:49,840 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-20 19:06:49,840 INFO  L175             Difference]: Start difference. First operand has 119 places, 132 transitions, 1111 flow. Second operand 9 states and 176 transitions.
[2024-06-20 19:06:49,840 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 165 transitions, 1545 flow
[2024-06-20 19:06:49,915 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 165 transitions, 1482 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-20 19:06:49,917 INFO  L231             Difference]: Finished difference. Result has 121 places, 135 transitions, 1196 flow
[2024-06-20 19:06:49,917 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1196, PETRI_PLACES=121, PETRI_TRANSITIONS=135}
[2024-06-20 19:06:49,917 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 76 predicate places.
[2024-06-20 19:06:49,917 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 135 transitions, 1196 flow
[2024-06-20 19:06:49,917 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-20 19:06:49,917 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:06:49,918 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:06:49,918 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 19:06:49,918 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-20 19:06:49,918 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:06:49,918 INFO  L85        PathProgramCache]: Analyzing trace with hash 1694262500, now seen corresponding path program 4 times
[2024-06-20 19:06:49,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:06:49,918 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215561856]
[2024-06-20 19:06:49,918 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:06:49,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:06:49,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:03,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:07:03,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:03,946 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215561856]
[2024-06-20 19:07:03,946 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215561856] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:03,946 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:03,946 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:07:03,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357424805]
[2024-06-20 19:07:03,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:03,946 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:07:03,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:03,948 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:07:03,948 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:07:04,165 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:07:04,166 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 135 transitions, 1196 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-20 19:07:04,166 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:04,166 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:07:04,166 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:06,101 INFO  L124   PetriNetUnfolderBase]: 2551/3905 cut-off events.
[2024-06-20 19:07:06,102 INFO  L125   PetriNetUnfolderBase]: For 171322/171324 co-relation queries the response was YES.
[2024-06-20 19:07:06,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26436 conditions, 3905 events. 2551/3905 cut-off events. For 171322/171324 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19869 event pairs, 764 based on Foata normal form. 2/3906 useless extension candidates. Maximal degree in co-relation 26382. Up to 3511 conditions per place. 
[2024-06-20 19:07:06,131 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 118 selfloop transitions, 48 changer transitions 0/172 dead transitions.
[2024-06-20 19:07:06,131 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 172 transitions, 1776 flow
[2024-06-20 19:07:06,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:07:06,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:07:06,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions.
[2024-06-20 19:07:06,134 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48011363636363635
[2024-06-20 19:07:06,134 INFO  L175             Difference]: Start difference. First operand has 121 places, 135 transitions, 1196 flow. Second operand 8 states and 169 transitions.
[2024-06-20 19:07:06,134 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 172 transitions, 1776 flow
[2024-06-20 19:07:06,219 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 172 transitions, 1652 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-20 19:07:06,221 INFO  L231             Difference]: Finished difference. Result has 122 places, 138 transitions, 1226 flow
[2024-06-20 19:07:06,221 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1226, PETRI_PLACES=122, PETRI_TRANSITIONS=138}
[2024-06-20 19:07:06,222 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 77 predicate places.
[2024-06-20 19:07:06,222 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 138 transitions, 1226 flow
[2024-06-20 19:07:06,222 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-20 19:07:06,222 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:06,222 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:06,222 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 19:07:06,223 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-20 19:07:06,223 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:06,223 INFO  L85        PathProgramCache]: Analyzing trace with hash 1245007962, now seen corresponding path program 5 times
[2024-06-20 19:07:06,223 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:06,223 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047175031]
[2024-06-20 19:07:06,223 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:06,223 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:06,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:20,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:07:20,591 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:20,591 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047175031]
[2024-06-20 19:07:20,591 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047175031] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:20,592 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:20,592 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:07:20,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595572360]
[2024-06-20 19:07:20,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:20,592 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:07:20,592 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:20,592 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:07:20,592 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:07:20,827 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:07:20,827 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 138 transitions, 1226 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-20 19:07:20,827 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:20,827 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:07:20,827 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:22,619 INFO  L124   PetriNetUnfolderBase]: 2562/3921 cut-off events.
[2024-06-20 19:07:22,619 INFO  L125   PetriNetUnfolderBase]: For 171286/171288 co-relation queries the response was YES.
[2024-06-20 19:07:22,633 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26528 conditions, 3921 events. 2562/3921 cut-off events. For 171286/171288 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19938 event pairs, 764 based on Foata normal form. 2/3922 useless extension candidates. Maximal degree in co-relation 26473. Up to 3572 conditions per place. 
[2024-06-20 19:07:22,649 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 122 selfloop transitions, 39 changer transitions 0/167 dead transitions.
[2024-06-20 19:07:22,649 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 167 transitions, 1660 flow
[2024-06-20 19:07:22,651 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:07:22,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:07:22,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-20 19:07:22,652 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44886363636363635
[2024-06-20 19:07:22,652 INFO  L175             Difference]: Start difference. First operand has 122 places, 138 transitions, 1226 flow. Second operand 8 states and 158 transitions.
[2024-06-20 19:07:22,652 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 167 transitions, 1660 flow
[2024-06-20 19:07:22,745 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 167 transitions, 1522 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-20 19:07:22,747 INFO  L231             Difference]: Finished difference. Result has 124 places, 141 transitions, 1226 flow
[2024-06-20 19:07:22,747 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1226, PETRI_PLACES=124, PETRI_TRANSITIONS=141}
[2024-06-20 19:07:22,747 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 79 predicate places.
[2024-06-20 19:07:22,748 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 141 transitions, 1226 flow
[2024-06-20 19:07:22,748 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-20 19:07:22,748 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:22,748 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:22,748 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 19:07:22,748 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-20 19:07:22,748 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:22,749 INFO  L85        PathProgramCache]: Analyzing trace with hash 1245008148, now seen corresponding path program 1 times
[2024-06-20 19:07:22,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:22,749 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017216513]
[2024-06-20 19:07:22,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:22,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:22,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:36,121 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:07:36,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:36,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017216513]
[2024-06-20 19:07:36,122 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017216513] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:36,122 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:36,122 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:07:36,122 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555618759]
[2024-06-20 19:07:36,122 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:36,122 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:07:36,122 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:36,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:07:36,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:07:36,304 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:07:36,304 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 141 transitions, 1226 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-20 19:07:36,304 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:36,304 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:07:36,304 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:38,271 INFO  L124   PetriNetUnfolderBase]: 2648/4050 cut-off events.
[2024-06-20 19:07:38,272 INFO  L125   PetriNetUnfolderBase]: For 187141/187143 co-relation queries the response was YES.
[2024-06-20 19:07:38,285 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27694 conditions, 4050 events. 2648/4050 cut-off events. For 187141/187143 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20734 event pairs, 739 based on Foata normal form. 4/4053 useless extension candidates. Maximal degree in co-relation 27638. Up to 3481 conditions per place. 
[2024-06-20 19:07:38,298 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 124 selfloop transitions, 56 changer transitions 0/186 dead transitions.
[2024-06-20 19:07:38,298 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 186 transitions, 2172 flow
[2024-06-20 19:07:38,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:07:38,301 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:07:38,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions.
[2024-06-20 19:07:38,301 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48863636363636365
[2024-06-20 19:07:38,301 INFO  L175             Difference]: Start difference. First operand has 124 places, 141 transitions, 1226 flow. Second operand 8 states and 172 transitions.
[2024-06-20 19:07:38,302 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 186 transitions, 2172 flow
[2024-06-20 19:07:38,390 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 186 transitions, 2070 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-20 19:07:38,392 INFO  L231             Difference]: Finished difference. Result has 126 places, 150 transitions, 1376 flow
[2024-06-20 19:07:38,392 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1376, PETRI_PLACES=126, PETRI_TRANSITIONS=150}
[2024-06-20 19:07:38,393 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 81 predicate places.
[2024-06-20 19:07:38,393 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 150 transitions, 1376 flow
[2024-06-20 19:07:38,393 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-20 19:07:38,393 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:38,393 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:38,393 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 19:07:38,393 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-20 19:07:38,393 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:38,393 INFO  L85        PathProgramCache]: Analyzing trace with hash 886671298, now seen corresponding path program 2 times
[2024-06-20 19:07:38,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:38,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582082787]
[2024-06-20 19:07:38,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:38,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:38,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:51,573 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:07:51,573 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:51,573 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582082787]
[2024-06-20 19:07:51,573 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582082787] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:51,574 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:51,574 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:07:51,574 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520489788]
[2024-06-20 19:07:51,574 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:51,574 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:07:51,574 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:51,574 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:07:51,575 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:07:51,806 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:07:51,806 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 150 transitions, 1376 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-20 19:07:51,806 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:51,806 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:07:51,807 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:53,663 INFO  L124   PetriNetUnfolderBase]: 2638/4041 cut-off events.
[2024-06-20 19:07:53,663 INFO  L125   PetriNetUnfolderBase]: For 196652/196654 co-relation queries the response was YES.
[2024-06-20 19:07:53,677 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27965 conditions, 4041 events. 2638/4041 cut-off events. For 196652/196654 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 20679 event pairs, 734 based on Foata normal form. 4/4044 useless extension candidates. Maximal degree in co-relation 27908. Up to 3473 conditions per place. 
[2024-06-20 19:07:53,691 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 120 selfloop transitions, 57 changer transitions 0/183 dead transitions.
[2024-06-20 19:07:53,691 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 183 transitions, 2064 flow
[2024-06-20 19:07:53,693 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:07:53,693 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:07:53,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions.
[2024-06-20 19:07:53,694 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4772727272727273
[2024-06-20 19:07:53,694 INFO  L175             Difference]: Start difference. First operand has 126 places, 150 transitions, 1376 flow. Second operand 8 states and 168 transitions.
[2024-06-20 19:07:53,694 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 183 transitions, 2064 flow
[2024-06-20 19:07:53,795 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 183 transitions, 1939 flow, removed 35 selfloop flow, removed 3 redundant places.
[2024-06-20 19:07:53,797 INFO  L231             Difference]: Finished difference. Result has 131 places, 150 transitions, 1374 flow
[2024-06-20 19:07:53,797 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1374, PETRI_PLACES=131, PETRI_TRANSITIONS=150}
[2024-06-20 19:07:53,798 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 86 predicate places.
[2024-06-20 19:07:53,798 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 150 transitions, 1374 flow
[2024-06-20 19:07:53,798 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-20 19:07:53,798 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:53,798 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:53,798 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 19:07:53,798 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:07:53,798 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:53,798 INFO  L85        PathProgramCache]: Analyzing trace with hash 1244835168, now seen corresponding path program 3 times
[2024-06-20 19:07:53,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:53,799 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089421159]
[2024-06-20 19:07:53,799 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:53,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:53,842 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:07,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:07,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:07,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089421159]
[2024-06-20 19:08:07,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089421159] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:07,138 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:07,138 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:08:07,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105449982]
[2024-06-20 19:08:07,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:07,138 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:08:07,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:07,138 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:08:07,138 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:08:07,340 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:08:07,341 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 150 transitions, 1374 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-20 19:08:07,341 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:07,341 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:08:07,341 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:09,292 INFO  L124   PetriNetUnfolderBase]: 2628/4027 cut-off events.
[2024-06-20 19:08:09,293 INFO  L125   PetriNetUnfolderBase]: For 205551/205553 co-relation queries the response was YES.
[2024-06-20 19:08:09,306 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28038 conditions, 4027 events. 2628/4027 cut-off events. For 205551/205553 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 20595 event pairs, 732 based on Foata normal form. 4/4030 useless extension candidates. Maximal degree in co-relation 27980. Up to 3465 conditions per place. 
[2024-06-20 19:08:09,319 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 117 selfloop transitions, 61 changer transitions 0/184 dead transitions.
[2024-06-20 19:08:09,319 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 184 transitions, 1948 flow
[2024-06-20 19:08:09,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:08:09,321 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:08:09,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions.
[2024-06-20 19:08:09,322 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48295454545454547
[2024-06-20 19:08:09,322 INFO  L175             Difference]: Start difference. First operand has 131 places, 150 transitions, 1374 flow. Second operand 8 states and 170 transitions.
[2024-06-20 19:08:09,322 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 184 transitions, 1948 flow
[2024-06-20 19:08:09,425 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 184 transitions, 1824 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-20 19:08:09,427 INFO  L231             Difference]: Finished difference. Result has 133 places, 150 transitions, 1380 flow
[2024-06-20 19:08:09,427 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1380, PETRI_PLACES=133, PETRI_TRANSITIONS=150}
[2024-06-20 19:08:09,427 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 88 predicate places.
[2024-06-20 19:08:09,427 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 150 transitions, 1380 flow
[2024-06-20 19:08:09,428 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-20 19:08:09,428 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:09,428 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:09,428 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 19:08:09,428 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-20 19:08:09,428 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:09,428 INFO  L85        PathProgramCache]: Analyzing trace with hash 1694267150, now seen corresponding path program 6 times
[2024-06-20 19:08:09,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:09,428 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423932072]
[2024-06-20 19:08:09,428 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:09,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:09,471 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:23,840 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:23,841 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:23,841 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423932072]
[2024-06-20 19:08:23,841 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423932072] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:23,841 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:23,841 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:08:23,841 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398602631]
[2024-06-20 19:08:23,841 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:23,841 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:08:23,841 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:23,842 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:08:23,842 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:08:24,079 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:08:24,079 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 150 transitions, 1380 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-20 19:08:24,079 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:24,079 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:08:24,079 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:26,019 INFO  L124   PetriNetUnfolderBase]: 2639/4038 cut-off events.
[2024-06-20 19:08:26,020 INFO  L125   PetriNetUnfolderBase]: For 215868/215870 co-relation queries the response was YES.
[2024-06-20 19:08:26,035 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28477 conditions, 4038 events. 2639/4038 cut-off events. For 215868/215870 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 20605 event pairs, 774 based on Foata normal form. 2/4039 useless extension candidates. Maximal degree in co-relation 28418. Up to 3684 conditions per place. 
[2024-06-20 19:08:26,052 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 134 selfloop transitions, 42 changer transitions 0/182 dead transitions.
[2024-06-20 19:08:26,052 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 182 transitions, 1852 flow
[2024-06-20 19:08:26,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:08:26,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:08:26,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-20 19:08:26,055 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4602272727272727
[2024-06-20 19:08:26,055 INFO  L175             Difference]: Start difference. First operand has 133 places, 150 transitions, 1380 flow. Second operand 8 states and 162 transitions.
[2024-06-20 19:08:26,055 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 182 transitions, 1852 flow
[2024-06-20 19:08:26,171 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 182 transitions, 1677 flow, removed 4 selfloop flow, removed 8 redundant places.
[2024-06-20 19:08:26,173 INFO  L231             Difference]: Finished difference. Result has 133 places, 153 transitions, 1349 flow
[2024-06-20 19:08:26,173 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1349, PETRI_PLACES=133, PETRI_TRANSITIONS=153}
[2024-06-20 19:08:26,173 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 88 predicate places.
[2024-06-20 19:08:26,173 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 153 transitions, 1349 flow
[2024-06-20 19:08:26,174 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-20 19:08:26,174 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:26,174 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:26,174 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 19:08:26,174 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:08:26,174 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:26,174 INFO  L85        PathProgramCache]: Analyzing trace with hash -854899131, now seen corresponding path program 1 times
[2024-06-20 19:08:26,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:26,175 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521268100]
[2024-06-20 19:08:26,175 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:26,175 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:26,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:42,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:42,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:42,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521268100]
[2024-06-20 19:08:42,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521268100] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:42,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:42,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:08:42,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721794506]
[2024-06-20 19:08:42,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:42,707 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:08:42,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:42,708 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:08:42,708 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:08:42,870 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:08:42,870 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 153 transitions, 1349 flow. Second operand  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:08:42,871 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:42,871 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:08:42,871 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:44,765 INFO  L124   PetriNetUnfolderBase]: 2970/4519 cut-off events.
[2024-06-20 19:08:44,765 INFO  L125   PetriNetUnfolderBase]: For 257543/257543 co-relation queries the response was YES.
[2024-06-20 19:08:44,780 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31968 conditions, 4519 events. 2970/4519 cut-off events. For 257543/257543 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 22727 event pairs, 933 based on Foata normal form. 1/4519 useless extension candidates. Maximal degree in co-relation 31908. Up to 4218 conditions per place. 
[2024-06-20 19:08:44,794 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 139 selfloop transitions, 16 changer transitions 0/175 dead transitions.
[2024-06-20 19:08:44,794 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 175 transitions, 1845 flow
[2024-06-20 19:08:44,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:08:44,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:08:44,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-20 19:08:44,795 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4431818181818182
[2024-06-20 19:08:44,795 INFO  L175             Difference]: Start difference. First operand has 133 places, 153 transitions, 1349 flow. Second operand 6 states and 117 transitions.
[2024-06-20 19:08:44,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 175 transitions, 1845 flow
[2024-06-20 19:08:44,932 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 175 transitions, 1731 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-20 19:08:44,934 INFO  L231             Difference]: Finished difference. Result has 133 places, 159 transitions, 1355 flow
[2024-06-20 19:08:44,934 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1355, PETRI_PLACES=133, PETRI_TRANSITIONS=159}
[2024-06-20 19:08:44,935 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 88 predicate places.
[2024-06-20 19:08:44,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 159 transitions, 1355 flow
[2024-06-20 19:08:44,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:08:44,935 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:44,935 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:44,935 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 19:08:44,935 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-20 19:08:44,936 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:44,936 INFO  L85        PathProgramCache]: Analyzing trace with hash -102385312, now seen corresponding path program 4 times
[2024-06-20 19:08:44,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:44,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762627944]
[2024-06-20 19:08:44,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:44,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:44,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:57,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:57,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:57,635 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762627944]
[2024-06-20 19:08:57,635 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762627944] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:57,635 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:57,635 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:08:57,635 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301120588]
[2024-06-20 19:08:57,635 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:57,636 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:08:57,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:57,636 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:08:57,636 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:08:57,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:08:57,873 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 159 transitions, 1355 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-20 19:08:57,873 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:57,873 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:08:57,873 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:59,895 INFO  L124   PetriNetUnfolderBase]: 2729/4159 cut-off events.
[2024-06-20 19:08:59,895 INFO  L125   PetriNetUnfolderBase]: For 243367/243369 co-relation queries the response was YES.
[2024-06-20 19:08:59,911 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29959 conditions, 4159 events. 2729/4159 cut-off events. For 243367/243369 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 21237 event pairs, 775 based on Foata normal form. 6/4164 useless extension candidates. Maximal degree in co-relation 29898. Up to 3809 conditions per place. 
[2024-06-20 19:08:59,927 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 158 selfloop transitions, 31 changer transitions 0/195 dead transitions.
[2024-06-20 19:08:59,927 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 195 transitions, 2173 flow
[2024-06-20 19:08:59,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:08:59,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:08:59,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-20 19:08:59,930 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45738636363636365
[2024-06-20 19:08:59,930 INFO  L175             Difference]: Start difference. First operand has 133 places, 159 transitions, 1355 flow. Second operand 8 states and 161 transitions.
[2024-06-20 19:08:59,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 195 transitions, 2173 flow
[2024-06-20 19:09:00,102 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 195 transitions, 2131 flow, removed 17 selfloop flow, removed 2 redundant places.
[2024-06-20 19:09:00,104 INFO  L231             Difference]: Finished difference. Result has 139 places, 165 transitions, 1469 flow
[2024-06-20 19:09:00,104 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1469, PETRI_PLACES=139, PETRI_TRANSITIONS=165}
[2024-06-20 19:09:00,105 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 94 predicate places.
[2024-06-20 19:09:00,105 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 165 transitions, 1469 flow
[2024-06-20 19:09:00,105 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-20 19:09:00,105 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:00,105 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:00,105 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 19:09:00,105 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-20 19:09:00,105 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:00,105 INFO  L85        PathProgramCache]: Analyzing trace with hash 2013609296, now seen corresponding path program 5 times
[2024-06-20 19:09:00,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:00,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478462612]
[2024-06-20 19:09:00,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:00,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:00,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:13,314 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:09:13,314 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:13,314 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478462612]
[2024-06-20 19:09:13,314 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478462612] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:13,314 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:13,314 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:09:13,314 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185298985]
[2024-06-20 19:09:13,314 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:13,315 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:09:13,315 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:13,315 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:09:13,315 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:09:13,448 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:09:13,448 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 165 transitions, 1469 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-20 19:09:13,449 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:13,449 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:09:13,449 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:15,545 INFO  L124   PetriNetUnfolderBase]: 2719/4145 cut-off events.
[2024-06-20 19:09:15,546 INFO  L125   PetriNetUnfolderBase]: For 253744/253746 co-relation queries the response was YES.
[2024-06-20 19:09:15,560 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30232 conditions, 4145 events. 2719/4145 cut-off events. For 253744/253746 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 21157 event pairs, 766 based on Foata normal form. 6/4150 useless extension candidates. Maximal degree in co-relation 30169. Up to 3801 conditions per place. 
[2024-06-20 19:09:15,575 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 155 selfloop transitions, 32 changer transitions 0/193 dead transitions.
[2024-06-20 19:09:15,575 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 193 transitions, 2059 flow
[2024-06-20 19:09:15,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:09:15,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:09:15,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-20 19:09:15,578 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44886363636363635
[2024-06-20 19:09:15,579 INFO  L175             Difference]: Start difference. First operand has 139 places, 165 transitions, 1469 flow. Second operand 8 states and 158 transitions.
[2024-06-20 19:09:15,579 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 193 transitions, 2059 flow
[2024-06-20 19:09:15,688 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 193 transitions, 1930 flow, removed 31 selfloop flow, removed 5 redundant places.
[2024-06-20 19:09:15,690 INFO  L231             Difference]: Finished difference. Result has 142 places, 165 transitions, 1412 flow
[2024-06-20 19:09:15,690 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1412, PETRI_PLACES=142, PETRI_TRANSITIONS=165}
[2024-06-20 19:09:15,691 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 97 predicate places.
[2024-06-20 19:09:15,691 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 165 transitions, 1412 flow
[2024-06-20 19:09:15,691 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-20 19:09:15,691 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:15,691 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:15,691 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 19:09:15,691 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-20 19:09:15,692 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:15,692 INFO  L85        PathProgramCache]: Analyzing trace with hash 2013609110, now seen corresponding path program 7 times
[2024-06-20 19:09:15,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:15,692 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710770693]
[2024-06-20 19:09:15,692 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:15,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:15,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:29,655 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:09:29,655 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:29,655 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710770693]
[2024-06-20 19:09:29,655 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710770693] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:29,655 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:29,655 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:09:29,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92896030]
[2024-06-20 19:09:29,656 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:29,656 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:09:29,656 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:29,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:09:29,656 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:09:29,916 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:09:29,917 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 165 transitions, 1412 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-20 19:09:29,917 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:29,917 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:09:29,917 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:31,956 INFO  L124   PetriNetUnfolderBase]: 2714/4138 cut-off events.
[2024-06-20 19:09:31,956 INFO  L125   PetriNetUnfolderBase]: For 262919/262921 co-relation queries the response was YES.
[2024-06-20 19:09:31,972 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30324 conditions, 4138 events. 2714/4138 cut-off events. For 262919/262921 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 21114 event pairs, 778 based on Foata normal form. 4/4141 useless extension candidates. Maximal degree in co-relation 30260. Up to 3900 conditions per place. 
[2024-06-20 19:09:31,986 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 163 selfloop transitions, 19 changer transitions 0/188 dead transitions.
[2024-06-20 19:09:31,986 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 188 transitions, 1834 flow
[2024-06-20 19:09:31,989 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:09:31,989 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:09:31,989 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-20 19:09:31,989 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42613636363636365
[2024-06-20 19:09:31,989 INFO  L175             Difference]: Start difference. First operand has 142 places, 165 transitions, 1412 flow. Second operand 8 states and 150 transitions.
[2024-06-20 19:09:31,989 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 188 transitions, 1834 flow
[2024-06-20 19:09:32,136 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 188 transitions, 1727 flow, removed 9 selfloop flow, removed 7 redundant places.
[2024-06-20 19:09:32,138 INFO  L231             Difference]: Finished difference. Result has 143 places, 165 transitions, 1351 flow
[2024-06-20 19:09:32,138 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1351, PETRI_PLACES=143, PETRI_TRANSITIONS=165}
[2024-06-20 19:09:32,139 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 98 predicate places.
[2024-06-20 19:09:32,139 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 165 transitions, 1351 flow
[2024-06-20 19:09:32,139 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-20 19:09:32,139 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:32,139 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:32,140 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 19:09:32,140 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-20 19:09:32,140 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:32,140 INFO  L85        PathProgramCache]: Analyzing trace with hash -836115832, now seen corresponding path program 6 times
[2024-06-20 19:09:32,140 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:32,140 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159507060]
[2024-06-20 19:09:32,140 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:32,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:32,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:45,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:09:45,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:45,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159507060]
[2024-06-20 19:09:45,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159507060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:45,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:45,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:09:45,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933307987]
[2024-06-20 19:09:45,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:45,505 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:09:45,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:45,506 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:09:45,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:09:45,763 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:09:45,763 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 165 transitions, 1351 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-20 19:09:45,763 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:45,763 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:09:45,763 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:47,631 INFO  L124   PetriNetUnfolderBase]: 2704/4124 cut-off events.
[2024-06-20 19:09:47,631 INFO  L125   PetriNetUnfolderBase]: For 274152/274154 co-relation queries the response was YES.
[2024-06-20 19:09:47,648 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30292 conditions, 4124 events. 2704/4124 cut-off events. For 274152/274154 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 21023 event pairs, 771 based on Foata normal form. 6/4129 useless extension candidates. Maximal degree in co-relation 30227. Up to 3863 conditions per place. 
[2024-06-20 19:09:47,662 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 165 selfloop transitions, 19 changer transitions 0/190 dead transitions.
[2024-06-20 19:09:47,662 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 190 transitions, 1785 flow
[2024-06-20 19:09:47,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:09:47,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:09:47,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-20 19:09:47,665 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4318181818181818
[2024-06-20 19:09:47,665 INFO  L175             Difference]: Start difference. First operand has 143 places, 165 transitions, 1351 flow. Second operand 8 states and 152 transitions.
[2024-06-20 19:09:47,665 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 190 transitions, 1785 flow
[2024-06-20 19:09:47,868 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 190 transitions, 1694 flow, removed 20 selfloop flow, removed 7 redundant places.
[2024-06-20 19:09:47,870 INFO  L231             Difference]: Finished difference. Result has 144 places, 165 transitions, 1306 flow
[2024-06-20 19:09:47,870 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1306, PETRI_PLACES=144, PETRI_TRANSITIONS=165}
[2024-06-20 19:09:47,870 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 99 predicate places.
[2024-06-20 19:09:47,871 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 165 transitions, 1306 flow
[2024-06-20 19:09:47,871 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-20 19:09:47,871 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:47,871 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:47,871 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 19:09:47,871 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:09:47,871 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:47,871 INFO  L85        PathProgramCache]: Analyzing trace with hash -854511321, now seen corresponding path program 2 times
[2024-06-20 19:09:47,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:47,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967096061]
[2024-06-20 19:09:47,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:47,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:47,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:03,752 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:10:03,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:03,753 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967096061]
[2024-06-20 19:10:03,753 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967096061] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:03,753 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:03,753 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:10:03,753 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571969481]
[2024-06-20 19:10:03,753 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:03,753 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:10:03,753 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:03,754 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:10:03,754 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:10:03,898 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:10:03,898 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 165 transitions, 1306 flow. Second operand  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:03,899 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:03,899 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:10:03,899 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:05,921 INFO  L124   PetriNetUnfolderBase]: 3009/4579 cut-off events.
[2024-06-20 19:10:05,921 INFO  L125   PetriNetUnfolderBase]: For 323867/323867 co-relation queries the response was YES.
[2024-06-20 19:10:05,940 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33825 conditions, 4579 events. 3009/4579 cut-off events. For 323867/323867 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 23077 event pairs, 938 based on Foata normal form. 1/4579 useless extension candidates. Maximal degree in co-relation 33759. Up to 4299 conditions per place. 
[2024-06-20 19:10:05,958 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 143 selfloop transitions, 11 changer transitions 0/174 dead transitions.
[2024-06-20 19:10:05,959 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 174 transitions, 1636 flow
[2024-06-20 19:10:05,959 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:10:05,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:10:05,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-20 19:10:05,959 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4090909090909091
[2024-06-20 19:10:05,959 INFO  L175             Difference]: Start difference. First operand has 144 places, 165 transitions, 1306 flow. Second operand 6 states and 108 transitions.
[2024-06-20 19:10:05,959 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 174 transitions, 1636 flow
[2024-06-20 19:10:06,172 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 174 transitions, 1550 flow, removed 14 selfloop flow, removed 8 redundant places.
[2024-06-20 19:10:06,174 INFO  L231             Difference]: Finished difference. Result has 142 places, 165 transitions, 1248 flow
[2024-06-20 19:10:06,174 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1248, PETRI_PLACES=142, PETRI_TRANSITIONS=165}
[2024-06-20 19:10:06,174 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 97 predicate places.
[2024-06-20 19:10:06,175 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 165 transitions, 1248 flow
[2024-06-20 19:10:06,179 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:06,179 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:06,179 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:06,179 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 19:10:06,179 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:10:06,180 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:06,180 INFO  L85        PathProgramCache]: Analyzing trace with hash -849179259, now seen corresponding path program 1 times
[2024-06-20 19:10:06,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:06,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162441141]
[2024-06-20 19:10:06,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:06,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:06,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:26,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:10:26,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:26,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162441141]
[2024-06-20 19:10:26,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162441141] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:26,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:26,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:10:26,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773150454]
[2024-06-20 19:10:26,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:26,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:10:26,524 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:26,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:10:26,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:10:26,635 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:10:26,635 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 165 transitions, 1248 flow. Second operand  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:26,635 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:26,635 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:10:26,636 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:28,856 INFO  L124   PetriNetUnfolderBase]: 3014/4586 cut-off events.
[2024-06-20 19:10:28,856 INFO  L125   PetriNetUnfolderBase]: For 338134/338134 co-relation queries the response was YES.
[2024-06-20 19:10:28,875 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34072 conditions, 4586 events. 3014/4586 cut-off events. For 338134/338134 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 23100 event pairs, 938 based on Foata normal form. 1/4586 useless extension candidates. Maximal degree in co-relation 34005. Up to 4293 conditions per place. 
[2024-06-20 19:10:28,891 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 148 selfloop transitions, 16 changer transitions 0/184 dead transitions.
[2024-06-20 19:10:28,891 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 184 transitions, 1754 flow
[2024-06-20 19:10:28,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:10:28,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:10:28,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-20 19:10:28,892 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4318181818181818
[2024-06-20 19:10:28,892 INFO  L175             Difference]: Start difference. First operand has 142 places, 165 transitions, 1248 flow. Second operand 6 states and 114 transitions.
[2024-06-20 19:10:28,892 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 184 transitions, 1754 flow
[2024-06-20 19:10:29,110 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 184 transitions, 1722 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-20 19:10:29,112 INFO  L231             Difference]: Finished difference. Result has 143 places, 171 transitions, 1324 flow
[2024-06-20 19:10:29,112 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1324, PETRI_PLACES=143, PETRI_TRANSITIONS=171}
[2024-06-20 19:10:29,113 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 98 predicate places.
[2024-06-20 19:10:29,113 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 171 transitions, 1324 flow
[2024-06-20 19:10:29,113 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:29,113 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:29,113 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:29,113 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 19:10:29,113 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:10:29,113 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:29,113 INFO  L85        PathProgramCache]: Analyzing trace with hash 560701671, now seen corresponding path program 2 times
[2024-06-20 19:10:29,114 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:29,114 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481902426]
[2024-06-20 19:10:29,114 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:29,114 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:29,150 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:49,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:10:49,751 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:49,751 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481902426]
[2024-06-20 19:10:49,751 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481902426] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:49,751 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:49,751 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:10:49,751 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621868949]
[2024-06-20 19:10:49,751 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:49,752 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:10:49,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:49,752 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:10:49,752 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:10:49,927 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:10:49,927 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 171 transitions, 1324 flow. Second operand  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:49,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:49,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:10:49,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:52,099 INFO  L124   PetriNetUnfolderBase]: 3011/4583 cut-off events.
[2024-06-20 19:10:52,099 INFO  L125   PetriNetUnfolderBase]: For 353872/353874 co-relation queries the response was YES.
[2024-06-20 19:10:52,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34796 conditions, 4583 events. 3011/4583 cut-off events. For 353872/353874 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 23136 event pairs, 941 based on Foata normal form. 3/4585 useless extension candidates. Maximal degree in co-relation 34728. Up to 4290 conditions per place. 
[2024-06-20 19:10:52,134 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 144 selfloop transitions, 16 changer transitions 0/180 dead transitions.
[2024-06-20 19:10:52,134 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 180 transitions, 1666 flow
[2024-06-20 19:10:52,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:10:52,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:10:52,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-20 19:10:52,135 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 19:10:52,135 INFO  L175             Difference]: Start difference. First operand has 143 places, 171 transitions, 1324 flow. Second operand 6 states and 110 transitions.
[2024-06-20 19:10:52,135 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 180 transitions, 1666 flow
[2024-06-20 19:10:52,350 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 180 transitions, 1612 flow, removed 23 selfloop flow, removed 2 redundant places.
[2024-06-20 19:10:52,352 INFO  L231             Difference]: Finished difference. Result has 147 places, 171 transitions, 1308 flow
[2024-06-20 19:10:52,352 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1308, PETRI_PLACES=147, PETRI_TRANSITIONS=171}
[2024-06-20 19:10:52,353 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 102 predicate places.
[2024-06-20 19:10:52,353 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 171 transitions, 1308 flow
[2024-06-20 19:10:52,353 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:52,353 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:52,353 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:52,353 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 19:10:52,353 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:10:52,354 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:52,354 INFO  L85        PathProgramCache]: Analyzing trace with hash 2022197846, now seen corresponding path program 1 times
[2024-06-20 19:10:52,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:52,354 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677291846]
[2024-06-20 19:10:52,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:52,354 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:52,390 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:10,004 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:11:10,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:10,005 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677291846]
[2024-06-20 19:11:10,005 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677291846] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:10,005 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:10,005 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:11:10,005 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285042311]
[2024-06-20 19:11:10,005 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:10,005 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:11:10,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:10,006 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:11:10,006 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:11:10,277 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44
[2024-06-20 19:11:10,277 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 171 transitions, 1308 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:10,277 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:10,277 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44
[2024-06-20 19:11:10,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:12,791 INFO  L124   PetriNetUnfolderBase]: 3135/4702 cut-off events.
[2024-06-20 19:11:12,791 INFO  L125   PetriNetUnfolderBase]: For 367332/367332 co-relation queries the response was YES.
[2024-06-20 19:11:12,811 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35402 conditions, 4702 events. 3135/4702 cut-off events. For 367332/367332 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 23193 event pairs, 921 based on Foata normal form. 4/4705 useless extension candidates. Maximal degree in co-relation 35332. Up to 4484 conditions per place. 
[2024-06-20 19:11:12,826 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 178 selfloop transitions, 21 changer transitions 0/204 dead transitions.
[2024-06-20 19:11:12,826 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 204 transitions, 1834 flow
[2024-06-20 19:11:12,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:11:12,829 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:11:12,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-20 19:11:12,830 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4015151515151515
[2024-06-20 19:11:12,830 INFO  L175             Difference]: Start difference. First operand has 147 places, 171 transitions, 1308 flow. Second operand 9 states and 159 transitions.
[2024-06-20 19:11:12,830 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 204 transitions, 1834 flow
[2024-06-20 19:11:12,998 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 204 transitions, 1784 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-20 19:11:13,000 INFO  L231             Difference]: Finished difference. Result has 151 places, 176 transitions, 1375 flow
[2024-06-20 19:11:13,000 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1375, PETRI_PLACES=151, PETRI_TRANSITIONS=176}
[2024-06-20 19:11:13,000 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 106 predicate places.
[2024-06-20 19:11:13,001 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 176 transitions, 1375 flow
[2024-06-20 19:11:13,001 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:13,001 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:13,001 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:13,001 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 19:11:13,001 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:11:13,002 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:13,002 INFO  L85        PathProgramCache]: Analyzing trace with hash 516025091, now seen corresponding path program 1 times
[2024-06-20 19:11:13,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:13,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016752169]
[2024-06-20 19:11:13,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:13,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:13,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:36,254 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:11:36,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:36,254 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016752169]
[2024-06-20 19:11:36,254 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016752169] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:36,254 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:36,254 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:11:36,255 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668664405]
[2024-06-20 19:11:36,255 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:36,255 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:11:36,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:36,255 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:11:36,255 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:11:36,457 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44
[2024-06-20 19:11:36,457 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 176 transitions, 1375 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:36,458 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:36,458 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44
[2024-06-20 19:11:36,458 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:38,493 INFO  L124   PetriNetUnfolderBase]: 3192/4756 cut-off events.
[2024-06-20 19:11:38,493 INFO  L125   PetriNetUnfolderBase]: For 380312/380312 co-relation queries the response was YES.
[2024-06-20 19:11:38,513 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36321 conditions, 4756 events. 3192/4756 cut-off events. For 380312/380312 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 23062 event pairs, 981 based on Foata normal form. 3/4758 useless extension candidates. Maximal degree in co-relation 36250. Up to 4614 conditions per place. 
[2024-06-20 19:11:38,530 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 159 selfloop transitions, 14 changer transitions 0/191 dead transitions.
[2024-06-20 19:11:38,530 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 191 transitions, 1785 flow
[2024-06-20 19:11:38,531 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:11:38,531 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:11:38,531 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-20 19:11:38,531 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38311688311688313
[2024-06-20 19:11:38,531 INFO  L175             Difference]: Start difference. First operand has 151 places, 176 transitions, 1375 flow. Second operand 7 states and 118 transitions.
[2024-06-20 19:11:38,532 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 191 transitions, 1785 flow
[2024-06-20 19:11:38,756 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 191 transitions, 1712 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-20 19:11:38,758 INFO  L231             Difference]: Finished difference. Result has 152 places, 179 transitions, 1378 flow
[2024-06-20 19:11:38,758 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1378, PETRI_PLACES=152, PETRI_TRANSITIONS=179}
[2024-06-20 19:11:38,759 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 107 predicate places.
[2024-06-20 19:11:38,759 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 179 transitions, 1378 flow
[2024-06-20 19:11:38,759 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:38,759 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:38,759 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:38,759 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 19:11:38,759 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-20 19:11:38,759 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:38,759 INFO  L85        PathProgramCache]: Analyzing trace with hash 567407606, now seen corresponding path program 1 times
[2024-06-20 19:11:38,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:38,759 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628092681]
[2024-06-20 19:11:38,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:38,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:38,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:55,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:11:55,554 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:55,554 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628092681]
[2024-06-20 19:11:55,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628092681] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:55,554 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:55,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:11:55,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818853143]
[2024-06-20 19:11:55,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:55,555 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:11:55,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:55,555 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:11:55,555 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:11:55,912 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:11:55,913 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 179 transitions, 1378 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-20 19:11:55,913 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:55,913 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:11:55,913 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:58,219 INFO  L124   PetriNetUnfolderBase]: 2985/4542 cut-off events.
[2024-06-20 19:11:58,219 INFO  L125   PetriNetUnfolderBase]: For 389875/389877 co-relation queries the response was YES.
[2024-06-20 19:11:58,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35810 conditions, 4542 events. 2985/4542 cut-off events. For 389875/389877 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 23248 event pairs, 652 based on Foata normal form. 4/4539 useless extension candidates. Maximal degree in co-relation 35738. Up to 3850 conditions per place. 
[2024-06-20 19:11:58,255 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 146 selfloop transitions, 68 changer transitions 0/221 dead transitions.
[2024-06-20 19:11:58,255 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 221 transitions, 2138 flow
[2024-06-20 19:11:58,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:11:58,258 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:11:58,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-20 19:11:58,258 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4621212121212121
[2024-06-20 19:11:58,258 INFO  L175             Difference]: Start difference. First operand has 152 places, 179 transitions, 1378 flow. Second operand 9 states and 183 transitions.
[2024-06-20 19:11:58,258 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 221 transitions, 2138 flow
[2024-06-20 19:11:58,481 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 221 transitions, 2084 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-20 19:11:58,484 INFO  L231             Difference]: Finished difference. Result has 156 places, 183 transitions, 1543 flow
[2024-06-20 19:11:58,484 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1543, PETRI_PLACES=156, PETRI_TRANSITIONS=183}
[2024-06-20 19:11:58,484 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 111 predicate places.
[2024-06-20 19:11:58,484 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 183 transitions, 1543 flow
[2024-06-20 19:11:58,485 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-20 19:11:58,485 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:58,485 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:58,485 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 19:11:58,485 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:11:58,485 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:58,485 INFO  L85        PathProgramCache]: Analyzing trace with hash 569285276, now seen corresponding path program 2 times
[2024-06-20 19:11:58,485 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:58,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333159732]
[2024-06-20 19:11:58,486 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:58,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:58,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:16,024 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:12:16,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:16,025 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333159732]
[2024-06-20 19:12:16,025 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333159732] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:16,025 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:16,025 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:12:16,025 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111117370]
[2024-06-20 19:12:16,025 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:16,025 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:12:16,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:16,026 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:12:16,026 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:12:16,220 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:12:16,220 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 183 transitions, 1543 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-20 19:12:16,220 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:16,221 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:12:16,221 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:18,515 INFO  L124   PetriNetUnfolderBase]: 3002/4571 cut-off events.
[2024-06-20 19:12:18,516 INFO  L125   PetriNetUnfolderBase]: For 408094/408096 co-relation queries the response was YES.
[2024-06-20 19:12:18,535 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36708 conditions, 4571 events. 3002/4571 cut-off events. For 408094/408096 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 23379 event pairs, 824 based on Foata normal form. 4/4569 useless extension candidates. Maximal degree in co-relation 36635. Up to 4073 conditions per place. 
[2024-06-20 19:12:18,550 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 150 selfloop transitions, 62 changer transitions 0/219 dead transitions.
[2024-06-20 19:12:18,550 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 219 transitions, 2093 flow
[2024-06-20 19:12:18,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:12:18,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:12:18,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-20 19:12:18,553 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45202020202020204
[2024-06-20 19:12:18,553 INFO  L175             Difference]: Start difference. First operand has 156 places, 183 transitions, 1543 flow. Second operand 9 states and 179 transitions.
[2024-06-20 19:12:18,553 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 219 transitions, 2093 flow
[2024-06-20 19:12:18,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 219 transitions, 1962 flow, removed 30 selfloop flow, removed 5 redundant places.
[2024-06-20 19:12:18,989 INFO  L231             Difference]: Finished difference. Result has 160 places, 185 transitions, 1587 flow
[2024-06-20 19:12:18,989 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1587, PETRI_PLACES=160, PETRI_TRANSITIONS=185}
[2024-06-20 19:12:18,990 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 115 predicate places.
[2024-06-20 19:12:18,990 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 185 transitions, 1587 flow
[2024-06-20 19:12:18,990 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-20 19:12:18,990 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:18,990 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:18,990 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 19:12:18,990 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:12:18,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:18,990 INFO  L85        PathProgramCache]: Analyzing trace with hash 569285431, now seen corresponding path program 1 times
[2024-06-20 19:12:18,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:18,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467560020]
[2024-06-20 19:12:18,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:18,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:19,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:35,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:12:35,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:35,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467560020]
[2024-06-20 19:12:35,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467560020] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:35,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:35,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:12:35,492 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181171614]
[2024-06-20 19:12:35,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:35,492 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:12:35,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:35,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:12:35,492 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:12:35,838 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:12:35,838 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 185 transitions, 1587 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-20 19:12:35,838 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:35,838 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:12:35,838 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:38,089 INFO  L124   PetriNetUnfolderBase]: 3064/4653 cut-off events.
[2024-06-20 19:12:38,090 INFO  L125   PetriNetUnfolderBase]: For 427541/427543 co-relation queries the response was YES.
[2024-06-20 19:12:38,112 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37773 conditions, 4653 events. 3064/4653 cut-off events. For 427541/427543 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 23893 event pairs, 729 based on Foata normal form. 4/4647 useless extension candidates. Maximal degree in co-relation 37698. Up to 3776 conditions per place. 
[2024-06-20 19:12:38,129 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 137 selfloop transitions, 85 changer transitions 0/229 dead transitions.
[2024-06-20 19:12:38,129 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 229 transitions, 2393 flow
[2024-06-20 19:12:38,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:12:38,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:12:38,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions.
[2024-06-20 19:12:38,132 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4722222222222222
[2024-06-20 19:12:38,132 INFO  L175             Difference]: Start difference. First operand has 160 places, 185 transitions, 1587 flow. Second operand 9 states and 187 transitions.
[2024-06-20 19:12:38,132 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 229 transitions, 2393 flow
[2024-06-20 19:12:38,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 229 transitions, 2254 flow, removed 9 selfloop flow, removed 7 redundant places.
[2024-06-20 19:12:38,488 INFO  L231             Difference]: Finished difference. Result has 162 places, 191 transitions, 1720 flow
[2024-06-20 19:12:38,488 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1720, PETRI_PLACES=162, PETRI_TRANSITIONS=191}
[2024-06-20 19:12:38,488 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 117 predicate places.
[2024-06-20 19:12:38,488 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 191 transitions, 1720 flow
[2024-06-20 19:12:38,488 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-20 19:12:38,489 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:38,489 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:38,489 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 19:12:38,489 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:12:38,489 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:38,489 INFO  L85        PathProgramCache]: Analyzing trace with hash 569281556, now seen corresponding path program 3 times
[2024-06-20 19:12:38,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:38,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500987904]
[2024-06-20 19:12:38,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:38,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:38,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:53,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:12:53,742 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:53,742 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500987904]
[2024-06-20 19:12:53,742 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500987904] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:53,742 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:53,742 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:12:53,742 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424862659]
[2024-06-20 19:12:53,742 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:53,743 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:12:53,743 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:53,743 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:12:53,743 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:12:54,090 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:12:54,090 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 191 transitions, 1720 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-20 19:12:54,090 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:54,091 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:12:54,091 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:56,391 INFO  L124   PetriNetUnfolderBase]: 3062/4649 cut-off events.
[2024-06-20 19:12:56,391 INFO  L125   PetriNetUnfolderBase]: For 444798/444800 co-relation queries the response was YES.
[2024-06-20 19:12:56,413 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38528 conditions, 4649 events. 3062/4649 cut-off events. For 444798/444800 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 23779 event pairs, 855 based on Foata normal form. 4/4645 useless extension candidates. Maximal degree in co-relation 38452. Up to 4122 conditions per place. 
[2024-06-20 19:12:56,430 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 156 selfloop transitions, 65 changer transitions 0/228 dead transitions.
[2024-06-20 19:12:56,430 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 228 transitions, 2280 flow
[2024-06-20 19:12:56,433 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:12:56,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:12:56,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-20 19:12:56,433 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45707070707070707
[2024-06-20 19:12:56,433 INFO  L175             Difference]: Start difference. First operand has 162 places, 191 transitions, 1720 flow. Second operand 9 states and 181 transitions.
[2024-06-20 19:12:56,433 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 228 transitions, 2280 flow
[2024-06-20 19:12:56,791 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 228 transitions, 2164 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-20 19:12:56,793 INFO  L231             Difference]: Finished difference. Result has 166 places, 193 transitions, 1775 flow
[2024-06-20 19:12:56,794 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1775, PETRI_PLACES=166, PETRI_TRANSITIONS=193}
[2024-06-20 19:12:56,794 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 121 predicate places.
[2024-06-20 19:12:56,794 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 193 transitions, 1775 flow
[2024-06-20 19:12:56,794 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-20 19:12:56,794 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:56,795 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:56,795 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 19:12:56,795 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:12:56,795 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:56,795 INFO  L85        PathProgramCache]: Analyzing trace with hash 656126971, now seen corresponding path program 2 times
[2024-06-20 19:12:56,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:56,795 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862238444]
[2024-06-20 19:12:56,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:56,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:56,851 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:13:11,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:13:11,480 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:13:11,480 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862238444]
[2024-06-20 19:13:11,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862238444] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:13:11,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:13:11,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:13:11,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63831988]
[2024-06-20 19:13:11,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:13:11,481 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:13:11,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:13:11,481 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:13:11,481 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:13:11,780 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:13:11,781 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 193 transitions, 1775 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-20 19:13:11,781 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:13:11,781 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:13:11,781 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:13:14,009 INFO  L124   PetriNetUnfolderBase]: 3083/4690 cut-off events.
[2024-06-20 19:13:14,010 INFO  L125   PetriNetUnfolderBase]: For 465168/465170 co-relation queries the response was YES.
[2024-06-20 19:13:14,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39253 conditions, 4690 events. 3083/4690 cut-off events. For 465168/465170 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 24124 event pairs, 768 based on Foata normal form. 4/4691 useless extension candidates. Maximal degree in co-relation 39175. Up to 4008 conditions per place. 
[2024-06-20 19:13:14,052 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 157 selfloop transitions, 71 changer transitions 0/235 dead transitions.
[2024-06-20 19:13:14,052 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 235 transitions, 2615 flow
[2024-06-20 19:13:14,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:13:14,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:13:14,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions.
[2024-06-20 19:13:14,054 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4671717171717172
[2024-06-20 19:13:14,055 INFO  L175             Difference]: Start difference. First operand has 166 places, 193 transitions, 1775 flow. Second operand 9 states and 185 transitions.
[2024-06-20 19:13:14,055 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 235 transitions, 2615 flow
[2024-06-20 19:13:14,469 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 235 transitions, 2466 flow, removed 11 selfloop flow, removed 7 redundant places.
[2024-06-20 19:13:14,472 INFO  L231             Difference]: Finished difference. Result has 169 places, 199 transitions, 1928 flow
[2024-06-20 19:13:14,472 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1928, PETRI_PLACES=169, PETRI_TRANSITIONS=199}
[2024-06-20 19:13:14,472 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 124 predicate places.
[2024-06-20 19:13:14,473 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 199 transitions, 1928 flow
[2024-06-20 19:13:14,473 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-20 19:13:14,473 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:13:14,473 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:13:14,473 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 19:13:14,473 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:13:14,473 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:13:14,473 INFO  L85        PathProgramCache]: Analyzing trace with hash 1572909788, now seen corresponding path program 4 times
[2024-06-20 19:13:14,473 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:13:14,473 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31230340]
[2024-06-20 19:13:14,473 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:13:14,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:13:14,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15