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


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix019_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-03 21:31:30,121 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-03 21:31:30,185 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 21:31:30,188 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 21:31:30,189 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 21:31:30,210 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 21:31:30,211 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 21:31:30,211 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 21:31:30,212 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 21:31:30,212 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-03 21:31:30,212 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 21:31:30,212 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 21:31:30,213 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 21:31:30,213 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-03 21:31:30,214 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-03 21:31:30,214 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 21:31:30,214 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-03 21:31:30,215 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-03 21:31:30,215 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-03 21:31:30,215 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-03 21:31:30,216 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-03 21:31:30,216 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 21:31:30,216 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 21:31:30,217 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 21:31:30,217 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-03 21:31:30,217 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-03 21:31:30,218 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-03 21:31:30,218 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-03 21:31:30,218 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 21:31:30,219 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-03 21:31:30,219 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 21:31:30,219 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-03 21:31:30,220 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 21:31:30,220 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 21:31:30,220 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 21:31:30,221 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 21:31:30,221 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-03 21:31:30,221 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 21:31:30,221 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 21:31:30,222 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 21:31:30,222 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 21:31:30,224 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 21:31:30,224 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 21:31:30,225 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-03 21:31:30,434 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 21:31:30,461 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 21:31:30,463 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 21:31:30,464 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-03 21:31:30,466 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-03 21:31:30,466 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/mix019_tso.oepc.yml/witness.yml
[2024-06-03 21:31:30,640 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-03 21:31:30,640 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-03 21:31:30,640 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i
[2024-06-03 21:31:31,625 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-03 21:31:31,878 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-03 21:31:31,879 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i
[2024-06-03 21:31:31,894 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a1086f31/e7b4f7b7a07f443ca08ed7defd52e27a/FLAG73e05ea51
[2024-06-03 21:31:31,917 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a1086f31/e7b4f7b7a07f443ca08ed7defd52e27a
[2024-06-03 21:31:31,917 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 21:31:31,918 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 21:31:31,921 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 21:31:31,921 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 21:31:31,924 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 21:31:31,925 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:31:30" (1/2) ...
[2024-06-03 21:31:31,925 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baec8b1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:31:31, skipping insertion in model container
[2024-06-03 21:31:31,926 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:31:30" (1/2) ...
[2024-06-03 21:31:31,927 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1fb2b58e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:31:31, skipping insertion in model container
[2024-06-03 21:31:31,927 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:31:31" (2/2) ...
[2024-06-03 21:31:31,928 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baec8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:31, skipping insertion in model container
[2024-06-03 21:31:31,928 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:31:31" (2/2) ...
[2024-06-03 21:31:31,929 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 21:31:32,002 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 21:31:32,003 INFO  L97    edCorrectnessWitness]: Location invariant before [L830-L830] (((((((((((((((((((! multithreaded || x$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 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 )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))
[2024-06-03 21:31:32,004 INFO  L97    edCorrectnessWitness]: Location invariant before [L831-L831] (((((((((((((((((((! multithreaded || x$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 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 )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))
[2024-06-03 21:31:32,005 INFO  L97    edCorrectnessWitness]: Location invariant before [L828-L828] (((((((((((((((((((! multithreaded || x$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 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 )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))
[2024-06-03 21:31:32,005 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 21:31:32,006 INFO  L106   edCorrectnessWitness]: ghost_update [L826-L826] multithreaded = 1;
[2024-06-03 21:31:32,045 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-03 21:31:32,301 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 21:31:32,315 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-03 21:31:32,668 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 21:31:32,706 INFO  L206         MainTranslator]: Completed translation
[2024-06-03 21:31:32,707 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32 WrapperNode
[2024-06-03 21:31:32,707 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 21:31:32,708 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 21:31:32,708 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 21:31:32,709 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 21:31:32,714 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (1/1) ...
[2024-06-03 21:31:32,759 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (1/1) ...
[2024-06-03 21:31:32,891 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 145
[2024-06-03 21:31:32,891 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 21:31:32,892 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 21:31:32,892 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 21:31:32,892 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 21:31:32,900 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (1/1) ...
[2024-06-03 21:31:32,901 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (1/1) ...
[2024-06-03 21:31:32,933 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (1/1) ...
[2024-06-03 21:31:32,992 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-03 21:31:32,992 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (1/1) ...
[2024-06-03 21:31:32,993 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (1/1) ...
[2024-06-03 21:31:33,039 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (1/1) ...
[2024-06-03 21:31:33,041 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (1/1) ...
[2024-06-03 21:31:33,061 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (1/1) ...
[2024-06-03 21:31:33,067 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (1/1) ...
[2024-06-03 21:31:33,105 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 21:31:33,106 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 21:31:33,106 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 21:31:33,106 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-03 21:31:33,107 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (1/1) ...
[2024-06-03 21:31:33,112 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 21:31:33,119 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 21:31:33,162 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-03 21:31:33,199 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-03 21:31:33,268 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 21:31:33,268 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 21:31:33,268 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 21:31:33,268 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 21:31:33,268 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 21:31:33,268 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 21:31:33,269 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-03 21:31:33,269 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-03 21:31:33,269 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 21:31:33,269 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 21:31:33,269 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 21:31:33,269 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 21:31:33,270 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-03 21:31:33,376 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-03 21:31:33,377 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 21:31:34,451 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 21:31:34,452 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-03 21:31:34,734 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 21:31:34,734 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 21:31:34,735 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:31:34 BoogieIcfgContainer
[2024-06-03 21:31:34,735 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 21:31:34,737 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 21:31:34,738 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 21:31:34,740 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-03 21:31:34,740 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:31:30" (1/4) ...
[2024-06-03 21:31:34,741 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291ae52c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:31:34, skipping insertion in model container
[2024-06-03 21:31:34,741 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:31:31" (2/4) ...
[2024-06-03 21:31:34,742 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291ae52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:31:34, skipping insertion in model container
[2024-06-03 21:31:34,742 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:31:32" (3/4) ...
[2024-06-03 21:31:34,742 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291ae52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:31:34, skipping insertion in model container
[2024-06-03 21:31:34,742 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:31:34" (4/4) ...
[2024-06-03 21:31:34,743 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i
[2024-06-03 21:31:34,755 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 21:31:34,756 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-03 21:31:34,756 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 21:31:34,856 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 21:31:34,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-03 21:31:34,931 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-03 21:31:34,932 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 21:31:34,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-03 21:31:34,934 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-03 21:31:34,937 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-03 21:31:34,947 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 21:31:34,954 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;@d1b4f54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 21:31:34,954 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-03 21:31:34,963 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 21:31:34,963 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-03 21:31:34,963 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 21:31:34,963 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:31:34,964 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 21:31:34,964 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-03 21:31:34,968 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:31:34,968 INFO  L85        PathProgramCache]: Analyzing trace with hash -1277020543, now seen corresponding path program 1 times
[2024-06-03 21:31:34,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:31:34,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033857728]
[2024-06-03 21:31:34,978 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:31:34,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:31:35,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:31:40,914 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:31:40,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:31:40,915 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033857728]
[2024-06-03 21:31:40,915 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033857728] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:31:40,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:31:40,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-03 21:31:40,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356421466]
[2024-06-03 21:31:40,920 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:31:40,926 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 21:31:40,930 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:31:40,954 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 21:31:40,955 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 21:31:41,024 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 21:31:41,026 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:31:41,026 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:31:41,026 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 21:31:41,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:31:41,795 INFO  L124   PetriNetUnfolderBase]: 1156/1874 cut-off events.
[2024-06-03 21:31:41,796 INFO  L125   PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-06-03 21:31:41,801 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3703 conditions, 1874 events. 1156/1874 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9336 event pairs, 805 based on Foata normal form. 1/1802 useless extension candidates. Maximal degree in co-relation 3688. Up to 1740 conditions per place. 
[2024-06-03 21:31:41,809 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-03 21:31:41,809 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 175 flow
[2024-06-03 21:31:41,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-03 21:31:41,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 21:31:41,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions.
[2024-06-03 21:31:41,817 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5793650793650794
[2024-06-03 21:31:41,819 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 73 transitions.
[2024-06-03 21:31:41,819 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 175 flow
[2024-06-03 21:31:41,821 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-03 21:31:41,822 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-03 21:31:41,824 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-03 21:31:41,826 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-03 21:31:41,826 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-03 21:31:41,826 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:31:41,826 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:31:41,826 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:31:41,827 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 21:31:41,827 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-03 21:31:41,827 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:31:41,827 INFO  L85        PathProgramCache]: Analyzing trace with hash 1143930976, now seen corresponding path program 1 times
[2024-06-03 21:31:41,827 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:31:41,828 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131408145]
[2024-06-03 21:31:41,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:31:41,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:31:41,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:31:46,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:31:46,157 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:31:46,158 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131408145]
[2024-06-03 21:31:46,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131408145] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:31:46,158 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:31:46,158 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 21:31:46,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821798977]
[2024-06-03 21:31:46,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:31:46,159 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 21:31:46,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:31:46,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 21:31:46,160 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-03 21:31:46,253 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 21:31:46,254 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:31:46,254 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:31:46,254 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 21:31:46,254 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:31:47,060 INFO  L124   PetriNetUnfolderBase]: 1357/2119 cut-off events.
[2024-06-03 21:31:47,060 INFO  L125   PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES.
[2024-06-03 21:31:47,063 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4788 conditions, 2119 events. 1357/2119 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10242 event pairs, 840 based on Foata normal form. 3/2119 useless extension candidates. Maximal degree in co-relation 4773. Up to 2013 conditions per place. 
[2024-06-03 21:31:47,069 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 41 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-03 21:31:47,069 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 244 flow
[2024-06-03 21:31:47,070 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-03 21:31:47,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 21:31:47,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions.
[2024-06-03 21:31:47,071 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-06-03 21:31:47,071 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 91 transitions.
[2024-06-03 21:31:47,071 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 244 flow
[2024-06-03 21:31:47,072 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-03 21:31:47,073 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-03 21:31:47,073 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-03 21:31:47,074 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-03 21:31:47,074 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-03 21:31:47,074 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:31:47,074 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:31:47,074 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:31:47,075 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 21:31:47,075 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-03 21:31:47,075 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:31:47,075 INFO  L85        PathProgramCache]: Analyzing trace with hash 1102122766, now seen corresponding path program 1 times
[2024-06-03 21:31:47,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:31:47,076 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306221524]
[2024-06-03 21:31:47,076 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:31:47,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:31:47,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:31:51,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:31:51,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:31:51,289 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306221524]
[2024-06-03 21:31:51,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306221524] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:31:51,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:31:51,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 21:31:51,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242968316]
[2024-06-03 21:31:51,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:31:51,290 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-03 21:31:51,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:31:51,291 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-03 21:31:51,291 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-03 21:31:51,398 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 21:31:51,399 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:31:51,399 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:31:51,399 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 21:31:51,399 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:31:52,283 INFO  L124   PetriNetUnfolderBase]: 1345/2103 cut-off events.
[2024-06-03 21:31:52,283 INFO  L125   PetriNetUnfolderBase]: For 1116/1116 co-relation queries the response was YES.
[2024-06-03 21:31:52,285 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5277 conditions, 2103 events. 1345/2103 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10144 event pairs, 592 based on Foata normal form. 6/2106 useless extension candidates. Maximal degree in co-relation 5260. Up to 1965 conditions per place. 
[2024-06-03 21:31:52,292 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 49 selfloop transitions, 10 changer transitions 0/64 dead transitions.
[2024-06-03 21:31:52,293 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 326 flow
[2024-06-03 21:31:52,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:31:52,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:31:52,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions.
[2024-06-03 21:31:52,294 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5333333333333333
[2024-06-03 21:31:52,294 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 112 transitions.
[2024-06-03 21:31:52,294 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 326 flow
[2024-06-03 21:31:52,296 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-03 21:31:52,297 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 174 flow
[2024-06-03 21:31:52,297 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-03 21:31:52,298 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places.
[2024-06-03 21:31:52,298 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 174 flow
[2024-06-03 21:31:52,298 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:31:52,299 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:31:52,299 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:31:52,299 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 21:31:52,299 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-03 21:31:52,299 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:31:52,300 INFO  L85        PathProgramCache]: Analyzing trace with hash -1716914867, now seen corresponding path program 1 times
[2024-06-03 21:31:52,300 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:31:52,300 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204734925]
[2024-06-03 21:31:52,300 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:31:52,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:31:52,358 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:31:56,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:31:56,943 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:31:56,943 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204734925]
[2024-06-03 21:31:56,943 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204734925] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:31:56,944 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:31:56,944 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:31:56,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170997621]
[2024-06-03 21:31:56,944 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:31:56,944 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:31:56,945 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:31:56,945 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:31:56,945 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:31:57,042 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 21:31:57,042 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 174 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-03 21:31:57,042 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:31:57,042 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 21:31:57,042 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:31:57,986 INFO  L124   PetriNetUnfolderBase]: 1336/2086 cut-off events.
[2024-06-03 21:31:57,987 INFO  L125   PetriNetUnfolderBase]: For 2056/2056 co-relation queries the response was YES.
[2024-06-03 21:31:57,990 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5744 conditions, 2086 events. 1336/2086 cut-off events. For 2056/2056 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10077 event pairs, 450 based on Foata normal form. 6/2089 useless extension candidates. Maximal degree in co-relation 5726. Up to 1920 conditions per place. 
[2024-06-03 21:31:57,997 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 53 selfloop transitions, 12 changer transitions 0/70 dead transitions.
[2024-06-03 21:31:57,998 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 380 flow
[2024-06-03 21:31:57,998 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:31:57,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:31:57,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions.
[2024-06-03 21:31:57,999 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5079365079365079
[2024-06-03 21:31:57,999 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 174 flow. Second operand 6 states and 128 transitions.
[2024-06-03 21:31:57,999 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 380 flow
[2024-06-03 21:31:58,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 356 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-03 21:31:58,002 INFO  L231             Difference]: Finished difference. Result has 51 places, 43 transitions, 193 flow
[2024-06-03 21:31:58,002 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=51, PETRI_TRANSITIONS=43}
[2024-06-03 21:31:58,003 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-03 21:31:58,003 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 193 flow
[2024-06-03 21:31:58,003 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-03 21:31:58,003 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:31:58,004 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:31:58,004 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 21:31:58,004 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:31:58,004 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:31:58,004 INFO  L85        PathProgramCache]: Analyzing trace with hash -2100828532, now seen corresponding path program 1 times
[2024-06-03 21:31:58,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:31:58,005 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473091925]
[2024-06-03 21:31:58,005 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:31:58,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:31:58,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:32:06,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:32:06,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:32:06,549 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473091925]
[2024-06-03 21:32:06,549 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473091925] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:32:06,549 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:32:06,549 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 21:32:06,549 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033618289]
[2024-06-03 21:32:06,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:32:06,550 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 21:32:06,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:32:06,550 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 21:32:06,550 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-03 21:32:06,654 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 21:32:06,655 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 193 flow. Second operand  has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:32:06,655 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:32:06,655 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 21:32:06,655 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:32:07,502 INFO  L124   PetriNetUnfolderBase]: 1124/1900 cut-off events.
[2024-06-03 21:32:07,502 INFO  L125   PetriNetUnfolderBase]: For 2652/2652 co-relation queries the response was YES.
[2024-06-03 21:32:07,510 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5372 conditions, 1900 events. 1124/1900 cut-off events. For 2652/2652 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9817 event pairs, 527 based on Foata normal form. 2/1892 useless extension candidates. Maximal degree in co-relation 5353. Up to 1682 conditions per place. 
[2024-06-03 21:32:07,519 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 43 selfloop transitions, 8 changer transitions 0/57 dead transitions.
[2024-06-03 21:32:07,519 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 339 flow
[2024-06-03 21:32:07,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:32:07,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:32:07,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions.
[2024-06-03 21:32:07,521 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 21:32:07,521 INFO  L175             Difference]: Start difference. First operand has 51 places, 43 transitions, 193 flow. Second operand 5 states and 95 transitions.
[2024-06-03 21:32:07,521 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 339 flow
[2024-06-03 21:32:07,525 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 306 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-03 21:32:07,526 INFO  L231             Difference]: Finished difference. Result has 52 places, 46 transitions, 206 flow
[2024-06-03 21:32:07,526 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=52, PETRI_TRANSITIONS=46}
[2024-06-03 21:32:07,527 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2024-06-03 21:32:07,527 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 206 flow
[2024-06-03 21:32:07,527 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:32:07,527 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:32:07,527 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:32:07,527 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 21:32:07,527 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-03 21:32:07,528 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:32:07,528 INFO  L85        PathProgramCache]: Analyzing trace with hash 476472641, now seen corresponding path program 1 times
[2024-06-03 21:32:07,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:32:07,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874673881]
[2024-06-03 21:32:07,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:32:07,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:32:07,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:32:15,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:32:15,994 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:32:15,994 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874673881]
[2024-06-03 21:32:15,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874673881] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:32:15,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:32:15,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:32:15,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968178440]
[2024-06-03 21:32:15,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:32:15,995 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:32:15,995 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:32:15,995 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:32:15,995 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:32:16,136 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 21:32:16,136 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 206 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:32:16,136 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:32:16,136 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 21:32:16,136 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:32:17,063 INFO  L124   PetriNetUnfolderBase]: 1342/2120 cut-off events.
[2024-06-03 21:32:17,063 INFO  L125   PetriNetUnfolderBase]: For 4395/4395 co-relation queries the response was YES.
[2024-06-03 21:32:17,067 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6591 conditions, 2120 events. 1342/2120 cut-off events. For 4395/4395 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10286 event pairs, 626 based on Foata normal form. 2/2119 useless extension candidates. Maximal degree in co-relation 6570. Up to 1980 conditions per place. 
[2024-06-03 21:32:17,075 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 51 selfloop transitions, 11 changer transitions 0/67 dead transitions.
[2024-06-03 21:32:17,075 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 67 transitions, 396 flow
[2024-06-03 21:32:17,076 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:32:17,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:32:17,077 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-03 21:32:17,078 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-03 21:32:17,078 INFO  L175             Difference]: Start difference. First operand has 52 places, 46 transitions, 206 flow. Second operand 6 states and 110 transitions.
[2024-06-03 21:32:17,078 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 67 transitions, 396 flow
[2024-06-03 21:32:17,081 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 67 transitions, 374 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-03 21:32:17,083 INFO  L231             Difference]: Finished difference. Result has 55 places, 49 transitions, 240 flow
[2024-06-03 21:32:17,083 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=55, PETRI_TRANSITIONS=49}
[2024-06-03 21:32:17,085 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places.
[2024-06-03 21:32:17,086 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 240 flow
[2024-06-03 21:32:17,086 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:32:17,086 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:32:17,086 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:32:17,086 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 21:32:17,087 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-03 21:32:17,087 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:32:17,087 INFO  L85        PathProgramCache]: Analyzing trace with hash -996192821, now seen corresponding path program 2 times
[2024-06-03 21:32:17,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:32:17,089 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422342137]
[2024-06-03 21:32:17,089 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:32:17,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:32:17,130 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:32:26,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:32:26,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:32:26,091 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422342137]
[2024-06-03 21:32:26,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422342137] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:32:26,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:32:26,091 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:32:26,091 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899206908]
[2024-06-03 21:32:26,091 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:32:26,092 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:32:26,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:32:26,092 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:32:26,092 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:32:26,237 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 21:32:26,238 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 240 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:32:26,238 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:32:26,238 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 21:32:26,238 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:32:27,135 INFO  L124   PetriNetUnfolderBase]: 1337/2124 cut-off events.
[2024-06-03 21:32:27,135 INFO  L125   PetriNetUnfolderBase]: For 5959/5971 co-relation queries the response was YES.
[2024-06-03 21:32:27,138 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7075 conditions, 2124 events. 1337/2124 cut-off events. For 5959/5971 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10328 event pairs, 627 based on Foata normal form. 10/2129 useless extension candidates. Maximal degree in co-relation 7053. Up to 1955 conditions per place. 
[2024-06-03 21:32:27,144 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 46 selfloop transitions, 16 changer transitions 0/67 dead transitions.
[2024-06-03 21:32:27,145 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 428 flow
[2024-06-03 21:32:27,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:32:27,145 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:32:27,146 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-03 21:32:27,146 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43253968253968256
[2024-06-03 21:32:27,146 INFO  L175             Difference]: Start difference. First operand has 55 places, 49 transitions, 240 flow. Second operand 6 states and 109 transitions.
[2024-06-03 21:32:27,146 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 428 flow
[2024-06-03 21:32:27,148 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 396 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-03 21:32:27,149 INFO  L231             Difference]: Finished difference. Result has 57 places, 52 transitions, 280 flow
[2024-06-03 21:32:27,149 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=57, PETRI_TRANSITIONS=52}
[2024-06-03 21:32:27,149 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-03 21:32:27,149 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 280 flow
[2024-06-03 21:32:27,150 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:32:27,150 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:32:27,150 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:32:27,150 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 21:32:27,150 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-03 21:32:27,150 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:32:27,151 INFO  L85        PathProgramCache]: Analyzing trace with hash -261533013, now seen corresponding path program 1 times
[2024-06-03 21:32:27,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:32:27,151 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980115832]
[2024-06-03 21:32:27,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:32:27,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:32:27,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:32:37,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:32:37,143 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:32:37,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980115832]
[2024-06-03 21:32:37,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980115832] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:32:37,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:32:37,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:32:37,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701719715]
[2024-06-03 21:32:37,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:32:37,144 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:32:37,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:32:37,145 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:32:37,145 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:32:37,361 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 21:32:37,362 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 280 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:32:37,362 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:32:37,362 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 21:32:37,362 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:32:38,376 INFO  L124   PetriNetUnfolderBase]: 1377/2267 cut-off events.
[2024-06-03 21:32:38,377 INFO  L125   PetriNetUnfolderBase]: For 7558/7558 co-relation queries the response was YES.
[2024-06-03 21:32:38,381 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7783 conditions, 2267 events. 1377/2267 cut-off events. For 7558/7558 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11490 event pairs, 625 based on Foata normal form. 2/2255 useless extension candidates. Maximal degree in co-relation 7760. Up to 2033 conditions per place. 
[2024-06-03 21:32:38,388 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 58 selfloop transitions, 14 changer transitions 0/77 dead transitions.
[2024-06-03 21:32:38,388 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 511 flow
[2024-06-03 21:32:38,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:32:38,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:32:38,389 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-03 21:32:38,390 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-03 21:32:38,390 INFO  L175             Difference]: Start difference. First operand has 57 places, 52 transitions, 280 flow. Second operand 7 states and 123 transitions.
[2024-06-03 21:32:38,390 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 511 flow
[2024-06-03 21:32:38,393 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 460 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-03 21:32:38,394 INFO  L231             Difference]: Finished difference. Result has 61 places, 58 transitions, 316 flow
[2024-06-03 21:32:38,394 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=316, PETRI_PLACES=61, PETRI_TRANSITIONS=58}
[2024-06-03 21:32:38,394 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places.
[2024-06-03 21:32:38,395 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 316 flow
[2024-06-03 21:32:38,395 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:32:38,395 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:32:38,395 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:32:38,395 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 21:32:38,395 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-03 21:32:38,396 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:32:38,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -1542312761, now seen corresponding path program 1 times
[2024-06-03 21:32:38,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:32:38,396 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528252142]
[2024-06-03 21:32:38,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:32:38,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:32:38,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:32:46,760 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:32:46,761 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:32:46,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528252142]
[2024-06-03 21:32:46,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528252142] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:32:46,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:32:46,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:32:46,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964928973]
[2024-06-03 21:32:46,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:32:46,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:32:46,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:32:46,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:32:46,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:32:46,854 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 21:32:46,855 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 316 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:32:46,855 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:32:46,855 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 21:32:46,855 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:32:47,962 INFO  L124   PetriNetUnfolderBase]: 1555/2434 cut-off events.
[2024-06-03 21:32:47,963 INFO  L125   PetriNetUnfolderBase]: For 11240/11250 co-relation queries the response was YES.
[2024-06-03 21:32:47,967 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9308 conditions, 2434 events. 1555/2434 cut-off events. For 11240/11250 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11975 event pairs, 576 based on Foata normal form. 4/2435 useless extension candidates. Maximal degree in co-relation 9283. Up to 2248 conditions per place. 
[2024-06-03 21:32:47,974 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 74 selfloop transitions, 17 changer transitions 0/97 dead transitions.
[2024-06-03 21:32:47,974 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 97 transitions, 622 flow
[2024-06-03 21:32:47,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:32:47,975 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:32:47,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-03 21:32:47,975 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44345238095238093
[2024-06-03 21:32:47,975 INFO  L175             Difference]: Start difference. First operand has 61 places, 58 transitions, 316 flow. Second operand 8 states and 149 transitions.
[2024-06-03 21:32:47,975 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 97 transitions, 622 flow
[2024-06-03 21:32:47,979 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 97 transitions, 582 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-03 21:32:47,980 INFO  L231             Difference]: Finished difference. Result has 66 places, 64 transitions, 370 flow
[2024-06-03 21:32:47,980 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=370, PETRI_PLACES=66, PETRI_TRANSITIONS=64}
[2024-06-03 21:32:47,981 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places.
[2024-06-03 21:32:47,981 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 370 flow
[2024-06-03 21:32:47,981 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:32:47,981 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:32:47,981 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:32:47,981 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 21:32:47,981 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-03 21:32:47,982 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:32:47,982 INFO  L85        PathProgramCache]: Analyzing trace with hash -1542192791, now seen corresponding path program 2 times
[2024-06-03 21:32:47,982 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:32:47,982 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387217334]
[2024-06-03 21:32:47,982 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:32:47,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:32:48,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:32:57,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:32:57,634 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:32:57,634 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387217334]
[2024-06-03 21:32:57,634 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387217334] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:32:57,634 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:32:57,634 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:32:57,634 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263160141]
[2024-06-03 21:32:57,634 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:32:57,634 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:32:57,634 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:32:57,635 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:32:57,635 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:32:57,826 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 21:32:57,826 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 370 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:32:57,826 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:32:57,826 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 21:32:57,826 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:32:59,102 INFO  L124   PetriNetUnfolderBase]: 1702/2664 cut-off events.
[2024-06-03 21:32:59,102 INFO  L125   PetriNetUnfolderBase]: For 15650/15660 co-relation queries the response was YES.
[2024-06-03 21:32:59,108 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11163 conditions, 2664 events. 1702/2664 cut-off events. For 15650/15660 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13172 event pairs, 508 based on Foata normal form. 18/2679 useless extension candidates. Maximal degree in co-relation 11136. Up to 2348 conditions per place. 
[2024-06-03 21:32:59,119 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 75 selfloop transitions, 25 changer transitions 0/106 dead transitions.
[2024-06-03 21:32:59,120 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 780 flow
[2024-06-03 21:32:59,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:32:59,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:32:59,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-03 21:32:59,121 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-03 21:32:59,121 INFO  L175             Difference]: Start difference. First operand has 66 places, 64 transitions, 370 flow. Second operand 8 states and 153 transitions.
[2024-06-03 21:32:59,121 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 780 flow
[2024-06-03 21:32:59,127 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 728 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-03 21:32:59,128 INFO  L231             Difference]: Finished difference. Result has 70 places, 72 transitions, 478 flow
[2024-06-03 21:32:59,128 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=478, PETRI_PLACES=70, PETRI_TRANSITIONS=72}
[2024-06-03 21:32:59,129 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places.
[2024-06-03 21:32:59,129 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 478 flow
[2024-06-03 21:32:59,129 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:32:59,130 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:32:59,130 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:32:59,130 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 21:32:59,130 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-03 21:32:59,130 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:32:59,131 INFO  L85        PathProgramCache]: Analyzing trace with hash 482166771, now seen corresponding path program 3 times
[2024-06-03 21:32:59,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:32:59,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263123857]
[2024-06-03 21:32:59,131 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:32:59,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:32:59,172 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:33:08,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:33:08,842 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:33:08,842 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263123857]
[2024-06-03 21:33:08,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263123857] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:33:08,842 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:33:08,842 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:33:08,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17666515]
[2024-06-03 21:33:08,842 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:33:08,842 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:33:08,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:33:08,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:33:08,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:33:09,038 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 21:33:09,038 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 478 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:33:09,038 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:33:09,038 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 21:33:09,038 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:33:10,226 INFO  L124   PetriNetUnfolderBase]: 1710/2662 cut-off events.
[2024-06-03 21:33:10,226 INFO  L125   PetriNetUnfolderBase]: For 20203/20212 co-relation queries the response was YES.
[2024-06-03 21:33:10,231 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12118 conditions, 2662 events. 1710/2662 cut-off events. For 20203/20212 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13218 event pairs, 468 based on Foata normal form. 18/2675 useless extension candidates. Maximal degree in co-relation 12089. Up to 2219 conditions per place. 
[2024-06-03 21:33:10,257 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 70 selfloop transitions, 38 changer transitions 0/114 dead transitions.
[2024-06-03 21:33:10,268 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 114 transitions, 966 flow
[2024-06-03 21:33:10,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:33:10,270 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:33:10,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-03 21:33:10,271 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-03 21:33:10,271 INFO  L175             Difference]: Start difference. First operand has 70 places, 72 transitions, 478 flow. Second operand 8 states and 157 transitions.
[2024-06-03 21:33:10,271 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 114 transitions, 966 flow
[2024-06-03 21:33:10,279 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 918 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-03 21:33:10,280 INFO  L231             Difference]: Finished difference. Result has 75 places, 80 transitions, 630 flow
[2024-06-03 21:33:10,280 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=630, PETRI_PLACES=75, PETRI_TRANSITIONS=80}
[2024-06-03 21:33:10,281 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places.
[2024-06-03 21:33:10,281 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 630 flow
[2024-06-03 21:33:10,281 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:33:10,281 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:33:10,281 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:33:10,281 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 21:33:10,282 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-03 21:33:10,282 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:33:10,282 INFO  L85        PathProgramCache]: Analyzing trace with hash 482413035, now seen corresponding path program 1 times
[2024-06-03 21:33:10,282 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:33:10,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598912886]
[2024-06-03 21:33:10,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:33:10,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:33:10,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:33:20,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:33:20,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:33:20,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598912886]
[2024-06-03 21:33:20,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598912886] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:33:20,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:33:20,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:33:20,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404102429]
[2024-06-03 21:33:20,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:33:20,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:33:20,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:33:20,019 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:33:20,019 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:33:20,209 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 21:33:20,209 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 630 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:33:20,210 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:33:20,210 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 21:33:20,210 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:33:21,386 INFO  L124   PetriNetUnfolderBase]: 1573/2546 cut-off events.
[2024-06-03 21:33:21,386 INFO  L125   PetriNetUnfolderBase]: For 20078/20078 co-relation queries the response was YES.
[2024-06-03 21:33:21,392 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11818 conditions, 2546 events. 1573/2546 cut-off events. For 20078/20078 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12745 event pairs, 470 based on Foata normal form. 4/2532 useless extension candidates. Maximal degree in co-relation 11786. Up to 2302 conditions per place. 
[2024-06-03 21:33:21,400 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 85 selfloop transitions, 16 changer transitions 0/106 dead transitions.
[2024-06-03 21:33:21,400 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 106 transitions, 924 flow
[2024-06-03 21:33:21,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:33:21,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:33:21,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-03 21:33:21,417 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41369047619047616
[2024-06-03 21:33:21,417 INFO  L175             Difference]: Start difference. First operand has 75 places, 80 transitions, 630 flow. Second operand 8 states and 139 transitions.
[2024-06-03 21:33:21,417 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 106 transitions, 924 flow
[2024-06-03 21:33:21,429 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 818 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-03 21:33:21,431 INFO  L231             Difference]: Finished difference. Result has 78 places, 82 transitions, 599 flow
[2024-06-03 21:33:21,431 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=599, PETRI_PLACES=78, PETRI_TRANSITIONS=82}
[2024-06-03 21:33:21,433 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places.
[2024-06-03 21:33:21,433 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 599 flow
[2024-06-03 21:33:21,434 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:33:21,434 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:33:21,434 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:33:21,434 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 21:33:21,434 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:33:21,435 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:33:21,435 INFO  L85        PathProgramCache]: Analyzing trace with hash -762430686, now seen corresponding path program 1 times
[2024-06-03 21:33:21,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:33:21,435 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598650099]
[2024-06-03 21:33:21,435 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:33:21,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:33:21,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:33:33,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:33:33,928 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:33:33,928 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598650099]
[2024-06-03 21:33:33,928 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598650099] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:33:33,928 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:33:33,928 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 21:33:33,928 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555123996]
[2024-06-03 21:33:33,929 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:33:33,929 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 21:33:33,929 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:33:33,929 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 21:33:33,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-03 21:33:34,043 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:33:34,043 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 599 flow. Second operand  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:33:34,044 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:33:34,044 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:33:34,044 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:33:35,173 INFO  L124   PetriNetUnfolderBase]: 1822/2809 cut-off events.
[2024-06-03 21:33:35,173 INFO  L125   PetriNetUnfolderBase]: For 23902/23902 co-relation queries the response was YES.
[2024-06-03 21:33:35,179 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12999 conditions, 2809 events. 1822/2809 cut-off events. For 23902/23902 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13380 event pairs, 583 based on Foata normal form. 1/2807 useless extension candidates. Maximal degree in co-relation 12966. Up to 2700 conditions per place. 
[2024-06-03 21:33:35,187 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 81 selfloop transitions, 8 changer transitions 0/93 dead transitions.
[2024-06-03 21:33:35,187 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 93 transitions, 819 flow
[2024-06-03 21:33:35,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:33:35,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:33:35,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions.
[2024-06-03 21:33:35,188 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3952380952380952
[2024-06-03 21:33:35,188 INFO  L175             Difference]: Start difference. First operand has 78 places, 82 transitions, 599 flow. Second operand 5 states and 83 transitions.
[2024-06-03 21:33:35,188 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 93 transitions, 819 flow
[2024-06-03 21:33:35,197 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 764 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-03 21:33:35,199 INFO  L231             Difference]: Finished difference. Result has 77 places, 85 transitions, 594 flow
[2024-06-03 21:33:35,199 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=594, PETRI_PLACES=77, PETRI_TRANSITIONS=85}
[2024-06-03 21:33:35,199 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places.
[2024-06-03 21:33:35,199 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 594 flow
[2024-06-03 21:33:35,200 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:33:35,200 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:33:35,200 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:33:35,200 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 21:33:35,200 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:33:35,200 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:33:35,200 INFO  L85        PathProgramCache]: Analyzing trace with hash -567143916, now seen corresponding path program 1 times
[2024-06-03 21:33:35,201 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:33:35,201 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710496311]
[2024-06-03 21:33:35,201 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:33:35,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:33:35,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:33:43,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:33:43,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:33:43,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710496311]
[2024-06-03 21:33:43,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710496311] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:33:43,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:33:43,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:33:43,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021233432]
[2024-06-03 21:33:43,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:33:43,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:33:43,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:33:43,425 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:33:43,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:33:43,543 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 21:33:43,543 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 85 transitions, 594 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:33:43,543 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:33:43,543 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 21:33:43,544 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:33:44,782 INFO  L124   PetriNetUnfolderBase]: 1786/2761 cut-off events.
[2024-06-03 21:33:44,782 INFO  L125   PetriNetUnfolderBase]: For 31124/31124 co-relation queries the response was YES.
[2024-06-03 21:33:44,789 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13942 conditions, 2761 events. 1786/2761 cut-off events. For 31124/31124 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13678 event pairs, 524 based on Foata normal form. 2/2758 useless extension candidates. Maximal degree in co-relation 13908. Up to 2538 conditions per place. 
[2024-06-03 21:33:44,799 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 88 selfloop transitions, 19 changer transitions 0/114 dead transitions.
[2024-06-03 21:33:44,799 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 114 transitions, 922 flow
[2024-06-03 21:33:44,799 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:33:44,800 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:33:44,800 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-03 21:33:44,800 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445578231292517
[2024-06-03 21:33:44,800 INFO  L175             Difference]: Start difference. First operand has 77 places, 85 transitions, 594 flow. Second operand 7 states and 131 transitions.
[2024-06-03 21:33:44,800 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 114 transitions, 922 flow
[2024-06-03 21:33:44,811 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 114 transitions, 894 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-03 21:33:44,813 INFO  L231             Difference]: Finished difference. Result has 81 places, 88 transitions, 668 flow
[2024-06-03 21:33:44,813 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=668, PETRI_PLACES=81, PETRI_TRANSITIONS=88}
[2024-06-03 21:33:44,814 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places.
[2024-06-03 21:33:44,814 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 668 flow
[2024-06-03 21:33:44,814 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:33:44,814 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:33:44,814 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:33:44,814 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 21:33:44,814 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-03 21:33:44,815 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:33:44,815 INFO  L85        PathProgramCache]: Analyzing trace with hash -563328684, now seen corresponding path program 1 times
[2024-06-03 21:33:44,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:33:44,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123865506]
[2024-06-03 21:33:44,815 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:33:44,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:33:44,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:33:54,389 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:33:54,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:33:54,390 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123865506]
[2024-06-03 21:33:54,390 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123865506] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:33:54,390 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:33:54,390 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:33:54,390 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665529478]
[2024-06-03 21:33:54,390 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:33:54,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:33:54,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:33:54,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:33:54,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:33:54,531 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:33:54,531 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 88 transitions, 668 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:33:54,532 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:33:54,532 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:33:54,532 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:33:55,801 INFO  L124   PetriNetUnfolderBase]: 1895/2887 cut-off events.
[2024-06-03 21:33:55,801 INFO  L125   PetriNetUnfolderBase]: For 34328/34328 co-relation queries the response was YES.
[2024-06-03 21:33:55,808 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14553 conditions, 2887 events. 1895/2887 cut-off events. For 34328/34328 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13683 event pairs, 574 based on Foata normal form. 2/2886 useless extension candidates. Maximal degree in co-relation 14518. Up to 2725 conditions per place. 
[2024-06-03 21:33:55,817 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 97 selfloop transitions, 17 changer transitions 0/119 dead transitions.
[2024-06-03 21:33:55,817 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 119 transitions, 1013 flow
[2024-06-03 21:33:55,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:33:55,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:33:55,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-03 21:33:55,820 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4017857142857143
[2024-06-03 21:33:55,820 INFO  L175             Difference]: Start difference. First operand has 81 places, 88 transitions, 668 flow. Second operand 8 states and 135 transitions.
[2024-06-03 21:33:55,820 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 119 transitions, 1013 flow
[2024-06-03 21:33:55,834 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 119 transitions, 955 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-03 21:33:55,836 INFO  L231             Difference]: Finished difference. Result has 85 places, 93 transitions, 713 flow
[2024-06-03 21:33:55,836 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=713, PETRI_PLACES=85, PETRI_TRANSITIONS=93}
[2024-06-03 21:33:55,837 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places.
[2024-06-03 21:33:55,837 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 93 transitions, 713 flow
[2024-06-03 21:33:55,837 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:33:55,837 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:33:55,837 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:33:55,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 21:33:55,838 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-03 21:33:55,838 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:33:55,838 INFO  L85        PathProgramCache]: Analyzing trace with hash -1461936618, now seen corresponding path program 2 times
[2024-06-03 21:33:55,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:33:55,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674446598]
[2024-06-03 21:33:55,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:33:55,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:33:55,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:34:04,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:34:04,916 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:34:04,918 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674446598]
[2024-06-03 21:34:04,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674446598] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:34:04,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:34:04,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:34:04,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38139957]
[2024-06-03 21:34:04,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:34:04,922 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:34:04,922 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:34:04,922 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:34:04,923 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:34:05,097 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:34:05,097 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 93 transitions, 713 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:34:05,097 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:34:05,097 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:34:05,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:34:06,375 INFO  L124   PetriNetUnfolderBase]: 1906/2905 cut-off events.
[2024-06-03 21:34:06,376 INFO  L125   PetriNetUnfolderBase]: For 38427/38436 co-relation queries the response was YES.
[2024-06-03 21:34:06,382 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15012 conditions, 2905 events. 1906/2905 cut-off events. For 38427/38436 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13796 event pairs, 586 based on Foata normal form. 8/2908 useless extension candidates. Maximal degree in co-relation 14975. Up to 2671 conditions per place. 
[2024-06-03 21:34:06,389 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 86 selfloop transitions, 35 changer transitions 0/126 dead transitions.
[2024-06-03 21:34:06,390 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 126 transitions, 1168 flow
[2024-06-03 21:34:06,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:34:06,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:34:06,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-03 21:34:06,403 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4107142857142857
[2024-06-03 21:34:06,403 INFO  L175             Difference]: Start difference. First operand has 85 places, 93 transitions, 713 flow. Second operand 8 states and 138 transitions.
[2024-06-03 21:34:06,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 126 transitions, 1168 flow
[2024-06-03 21:34:06,416 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 126 transitions, 1110 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-03 21:34:06,422 INFO  L231             Difference]: Finished difference. Result has 89 places, 101 transitions, 842 flow
[2024-06-03 21:34:06,422 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=842, PETRI_PLACES=89, PETRI_TRANSITIONS=101}
[2024-06-03 21:34:06,422 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places.
[2024-06-03 21:34:06,422 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 842 flow
[2024-06-03 21:34:06,424 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:34:06,424 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:34:06,424 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:34:06,424 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 21:34:06,425 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-03 21:34:06,425 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:34:06,425 INFO  L85        PathProgramCache]: Analyzing trace with hash -1462203528, now seen corresponding path program 3 times
[2024-06-03 21:34:06,425 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:34:06,425 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751386278]
[2024-06-03 21:34:06,425 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:34:06,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:34:06,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:34:16,929 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:34:16,929 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:34:16,929 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751386278]
[2024-06-03 21:34:16,929 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751386278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:34:16,929 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:34:16,929 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:34:16,929 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439892746]
[2024-06-03 21:34:16,929 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:34:16,930 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:34:16,930 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:34:16,930 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:34:16,930 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:34:17,087 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:34:17,088 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 842 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:34:17,088 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:34:17,088 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:34:17,088 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:34:18,311 INFO  L124   PetriNetUnfolderBase]: 1928/2937 cut-off events.
[2024-06-03 21:34:18,311 INFO  L125   PetriNetUnfolderBase]: For 42954/42963 co-relation queries the response was YES.
[2024-06-03 21:34:18,318 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15693 conditions, 2937 events. 1928/2937 cut-off events. For 42954/42963 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13969 event pairs, 581 based on Foata normal form. 8/2940 useless extension candidates. Maximal degree in co-relation 15654. Up to 2728 conditions per place. 
[2024-06-03 21:34:18,326 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 95 selfloop transitions, 30 changer transitions 0/130 dead transitions.
[2024-06-03 21:34:18,326 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 130 transitions, 1223 flow
[2024-06-03 21:34:18,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:34:18,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:34:18,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-03 21:34:18,329 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4017857142857143
[2024-06-03 21:34:18,329 INFO  L175             Difference]: Start difference. First operand has 89 places, 101 transitions, 842 flow. Second operand 8 states and 135 transitions.
[2024-06-03 21:34:18,337 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 130 transitions, 1223 flow
[2024-06-03 21:34:18,354 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 130 transitions, 1185 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-03 21:34:18,362 INFO  L231             Difference]: Finished difference. Result has 95 places, 107 transitions, 951 flow
[2024-06-03 21:34:18,363 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=951, PETRI_PLACES=95, PETRI_TRANSITIONS=107}
[2024-06-03 21:34:18,363 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places.
[2024-06-03 21:34:18,363 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 107 transitions, 951 flow
[2024-06-03 21:34:18,363 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:34:18,364 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:34:18,364 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:34:18,364 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 21:34:18,364 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-03 21:34:18,365 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:34:18,365 INFO  L85        PathProgramCache]: Analyzing trace with hash -1469555178, now seen corresponding path program 4 times
[2024-06-03 21:34:18,365 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:34:18,365 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234472865]
[2024-06-03 21:34:18,365 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:34:18,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:34:18,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:34:28,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:34:28,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:34:28,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234472865]
[2024-06-03 21:34:28,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234472865] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:34:28,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:34:28,439 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:34:28,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562273766]
[2024-06-03 21:34:28,439 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:34:28,439 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:34:28,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:34:28,440 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:34:28,440 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:34:28,607 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:34:28,608 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 107 transitions, 951 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:34:28,608 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:34:28,608 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:34:28,608 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:34:29,844 INFO  L124   PetriNetUnfolderBase]: 1917/2920 cut-off events.
[2024-06-03 21:34:29,845 INFO  L125   PetriNetUnfolderBase]: For 46159/46168 co-relation queries the response was YES.
[2024-06-03 21:34:29,852 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15648 conditions, 2920 events. 1917/2920 cut-off events. For 46159/46168 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13852 event pairs, 581 based on Foata normal form. 8/2923 useless extension candidates. Maximal degree in co-relation 15607. Up to 2711 conditions per place. 
[2024-06-03 21:34:29,860 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 96 selfloop transitions, 29 changer transitions 0/130 dead transitions.
[2024-06-03 21:34:29,860 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 130 transitions, 1259 flow
[2024-06-03 21:34:29,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:34:29,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:34:29,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-03 21:34:29,863 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-03 21:34:29,863 INFO  L175             Difference]: Start difference. First operand has 95 places, 107 transitions, 951 flow. Second operand 8 states and 136 transitions.
[2024-06-03 21:34:29,863 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 130 transitions, 1259 flow
[2024-06-03 21:34:29,884 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 130 transitions, 1157 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-03 21:34:29,886 INFO  L231             Difference]: Finished difference. Result has 98 places, 107 transitions, 915 flow
[2024-06-03 21:34:29,886 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=915, PETRI_PLACES=98, PETRI_TRANSITIONS=107}
[2024-06-03 21:34:29,887 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places.
[2024-06-03 21:34:29,887 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 107 transitions, 915 flow
[2024-06-03 21:34:29,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:34:29,887 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:34:29,887 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:34:29,887 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 21:34:29,887 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:34:29,888 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:34:29,888 INFO  L85        PathProgramCache]: Analyzing trace with hash 2134453610, now seen corresponding path program 1 times
[2024-06-03 21:34:29,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:34:29,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389351742]
[2024-06-03 21:34:29,888 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:34:29,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:34:29,919 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:34:42,985 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:34:42,986 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:34:42,986 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389351742]
[2024-06-03 21:34:42,986 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389351742] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:34:42,986 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:34:42,986 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:34:42,986 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127456651]
[2024-06-03 21:34:42,987 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:34:42,987 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:34:42,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:34:42,992 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:34:42,993 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:34:43,125 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:34:43,126 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 107 transitions, 915 flow. Second operand  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:34:43,126 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:34:43,126 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:34:43,126 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:34:44,325 INFO  L124   PetriNetUnfolderBase]: 1817/2798 cut-off events.
[2024-06-03 21:34:44,325 INFO  L125   PetriNetUnfolderBase]: For 42102/42102 co-relation queries the response was YES.
[2024-06-03 21:34:44,333 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14675 conditions, 2798 events. 1817/2798 cut-off events. For 42102/42102 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13256 event pairs, 537 based on Foata normal form. 2/2797 useless extension candidates. Maximal degree in co-relation 14633. Up to 2686 conditions per place. 
[2024-06-03 21:34:44,342 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 105 selfloop transitions, 11 changer transitions 0/120 dead transitions.
[2024-06-03 21:34:44,342 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 120 transitions, 1197 flow
[2024-06-03 21:34:44,343 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:34:44,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:34:44,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-03 21:34:44,343 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38095238095238093
[2024-06-03 21:34:44,343 INFO  L175             Difference]: Start difference. First operand has 98 places, 107 transitions, 915 flow. Second operand 6 states and 96 transitions.
[2024-06-03 21:34:44,343 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 120 transitions, 1197 flow
[2024-06-03 21:34:44,364 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 120 transitions, 1095 flow, removed 7 selfloop flow, removed 9 redundant places.
[2024-06-03 21:34:44,365 INFO  L231             Difference]: Finished difference. Result has 95 places, 110 transitions, 873 flow
[2024-06-03 21:34:44,366 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=873, PETRI_PLACES=95, PETRI_TRANSITIONS=110}
[2024-06-03 21:34:44,366 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places.
[2024-06-03 21:34:44,366 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 110 transitions, 873 flow
[2024-06-03 21:34:44,366 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:34:44,366 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:34:44,366 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:34:44,367 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 21:34:44,367 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-03 21:34:44,367 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:34:44,367 INFO  L85        PathProgramCache]: Analyzing trace with hash 1076565482, now seen corresponding path program 1 times
[2024-06-03 21:34:44,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:34:44,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018372352]
[2024-06-03 21:34:44,368 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:34:44,368 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:34:44,424 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:34:54,275 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:34:54,276 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:34:54,276 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018372352]
[2024-06-03 21:34:54,276 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018372352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:34:54,276 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:34:54,276 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:34:54,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351991881]
[2024-06-03 21:34:54,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:34:54,276 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:34:54,276 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:34:54,277 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:34:54,277 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:34:54,476 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 21:34:54,477 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 110 transitions, 873 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-03 21:34:54,477 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:34:54,477 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 21:34:54,477 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:34:55,860 INFO  L124   PetriNetUnfolderBase]: 1832/2828 cut-off events.
[2024-06-03 21:34:55,861 INFO  L125   PetriNetUnfolderBase]: For 55236/55236 co-relation queries the response was YES.
[2024-06-03 21:34:55,869 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16375 conditions, 2828 events. 1832/2828 cut-off events. For 55236/55236 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14064 event pairs, 389 based on Foata normal form. 4/2823 useless extension candidates. Maximal degree in co-relation 16334. Up to 2577 conditions per place. 
[2024-06-03 21:34:55,877 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 117 selfloop transitions, 17 changer transitions 0/143 dead transitions.
[2024-06-03 21:34:55,877 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 143 transitions, 1259 flow
[2024-06-03 21:34:55,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:34:55,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:34:55,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-03 21:34:55,881 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-03 21:34:55,881 INFO  L175             Difference]: Start difference. First operand has 95 places, 110 transitions, 873 flow. Second operand 8 states and 146 transitions.
[2024-06-03 21:34:55,881 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 143 transitions, 1259 flow
[2024-06-03 21:34:55,902 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 143 transitions, 1221 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-03 21:34:55,904 INFO  L231             Difference]: Finished difference. Result has 99 places, 112 transitions, 920 flow
[2024-06-03 21:34:55,904 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=920, PETRI_PLACES=99, PETRI_TRANSITIONS=112}
[2024-06-03 21:34:55,905 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places.
[2024-06-03 21:34:55,905 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 112 transitions, 920 flow
[2024-06-03 21:34:55,905 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-03 21:34:55,905 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:34:55,905 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:34:55,905 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 21:34:55,906 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-03 21:34:55,906 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:34:55,906 INFO  L85        PathProgramCache]: Analyzing trace with hash -199725278, now seen corresponding path program 2 times
[2024-06-03 21:34:55,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:34:55,906 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570937344]
[2024-06-03 21:34:55,906 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:34:55,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:34:55,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:35:05,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:35:05,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:35:05,141 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570937344]
[2024-06-03 21:35:05,142 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570937344] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:35:05,142 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:35:05,142 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:35:05,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252113181]
[2024-06-03 21:35:05,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:35:05,142 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:35:05,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:35:05,143 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:35:05,144 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:35:05,342 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 21:35:05,342 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 112 transitions, 920 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-03 21:35:05,342 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:35:05,343 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 21:35:05,343 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:35:06,757 INFO  L124   PetriNetUnfolderBase]: 1831/2849 cut-off events.
[2024-06-03 21:35:06,757 INFO  L125   PetriNetUnfolderBase]: For 61717/61717 co-relation queries the response was YES.
[2024-06-03 21:35:06,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16925 conditions, 2849 events. 1831/2849 cut-off events. For 61717/61717 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14268 event pairs, 476 based on Foata normal form. 4/2850 useless extension candidates. Maximal degree in co-relation 16883. Up to 2585 conditions per place. 
[2024-06-03 21:35:06,777 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 115 selfloop transitions, 21 changer transitions 0/145 dead transitions.
[2024-06-03 21:35:06,777 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 145 transitions, 1316 flow
[2024-06-03 21:35:06,780 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:35:06,780 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:35:06,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-03 21:35:06,780 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-03 21:35:06,781 INFO  L175             Difference]: Start difference. First operand has 99 places, 112 transitions, 920 flow. Second operand 8 states and 147 transitions.
[2024-06-03 21:35:06,781 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 145 transitions, 1316 flow
[2024-06-03 21:35:06,807 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 145 transitions, 1249 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-03 21:35:06,809 INFO  L231             Difference]: Finished difference. Result has 101 places, 114 transitions, 951 flow
[2024-06-03 21:35:06,809 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=951, PETRI_PLACES=101, PETRI_TRANSITIONS=114}
[2024-06-03 21:35:06,810 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places.
[2024-06-03 21:35:06,810 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 114 transitions, 951 flow
[2024-06-03 21:35:06,810 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-03 21:35:06,810 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:35:06,810 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:35:06,810 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 21:35:06,811 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-03 21:35:06,811 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:35:06,811 INFO  L85        PathProgramCache]: Analyzing trace with hash 965866032, now seen corresponding path program 1 times
[2024-06-03 21:35:06,811 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:35:06,811 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139251959]
[2024-06-03 21:35:06,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:35:06,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:35:06,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:35:15,902 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:35:15,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:35:15,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139251959]
[2024-06-03 21:35:15,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139251959] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:35:15,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:35:15,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:35:15,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077183566]
[2024-06-03 21:35:15,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:35:15,903 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:35:15,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:35:15,904 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:35:15,904 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:35:16,073 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:35:16,073 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 114 transitions, 951 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:35:16,074 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:35:16,074 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:35:16,074 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:35:17,423 INFO  L124   PetriNetUnfolderBase]: 1976/3010 cut-off events.
[2024-06-03 21:35:17,423 INFO  L125   PetriNetUnfolderBase]: For 66523/66523 co-relation queries the response was YES.
[2024-06-03 21:35:17,431 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17335 conditions, 3010 events. 1976/3010 cut-off events. For 66523/66523 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14344 event pairs, 495 based on Foata normal form. 4/3011 useless extension candidates. Maximal degree in co-relation 17292. Up to 2675 conditions per place. 
[2024-06-03 21:35:17,439 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 115 selfloop transitions, 39 changer transitions 0/159 dead transitions.
[2024-06-03 21:35:17,439 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 159 transitions, 1425 flow
[2024-06-03 21:35:17,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:35:17,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:35:17,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-03 21:35:17,443 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42328042328042326
[2024-06-03 21:35:17,443 INFO  L175             Difference]: Start difference. First operand has 101 places, 114 transitions, 951 flow. Second operand 9 states and 160 transitions.
[2024-06-03 21:35:17,443 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 159 transitions, 1425 flow
[2024-06-03 21:35:17,472 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 159 transitions, 1323 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-03 21:35:17,474 INFO  L231             Difference]: Finished difference. Result has 105 places, 123 transitions, 1029 flow
[2024-06-03 21:35:17,474 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1029, PETRI_PLACES=105, PETRI_TRANSITIONS=123}
[2024-06-03 21:35:17,474 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places.
[2024-06-03 21:35:17,474 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 123 transitions, 1029 flow
[2024-06-03 21:35:17,474 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:35:17,475 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:35:17,475 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:35:17,475 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 21:35:17,475 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-03 21:35:17,475 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:35:17,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 1081336940, now seen corresponding path program 1 times
[2024-06-03 21:35:17,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:35:17,476 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814391530]
[2024-06-03 21:35:17,476 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:35:17,476 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:35:17,514 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:35:27,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:35:27,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:35:27,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814391530]
[2024-06-03 21:35:27,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814391530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:35:27,200 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:35:27,200 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:35:27,200 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033621759]
[2024-06-03 21:35:27,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:35:27,201 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:35:27,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:35:27,201 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:35:27,201 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:35:27,371 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:35:27,372 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 123 transitions, 1029 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:35:27,372 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:35:27,372 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:35:27,372 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:35:28,786 INFO  L124   PetriNetUnfolderBase]: 1999/3043 cut-off events.
[2024-06-03 21:35:28,787 INFO  L125   PetriNetUnfolderBase]: For 72110/72110 co-relation queries the response was YES.
[2024-06-03 21:35:28,795 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17912 conditions, 3043 events. 1999/3043 cut-off events. For 72110/72110 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14496 event pairs, 497 based on Foata normal form. 4/3041 useless extension candidates. Maximal degree in co-relation 17867. Up to 2865 conditions per place. 
[2024-06-03 21:35:28,804 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 132 selfloop transitions, 19 changer transitions 0/156 dead transitions.
[2024-06-03 21:35:28,804 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 156 transitions, 1449 flow
[2024-06-03 21:35:28,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:35:28,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:35:28,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-03 21:35:28,807 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3968253968253968
[2024-06-03 21:35:28,807 INFO  L175             Difference]: Start difference. First operand has 105 places, 123 transitions, 1029 flow. Second operand 9 states and 150 transitions.
[2024-06-03 21:35:28,807 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 156 transitions, 1449 flow
[2024-06-03 21:35:28,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 156 transitions, 1397 flow, removed 7 selfloop flow, removed 5 redundant places.
[2024-06-03 21:35:28,835 INFO  L231             Difference]: Finished difference. Result has 109 places, 125 transitions, 1066 flow
[2024-06-03 21:35:28,835 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1066, PETRI_PLACES=109, PETRI_TRANSITIONS=125}
[2024-06-03 21:35:28,841 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places.
[2024-06-03 21:35:28,842 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 125 transitions, 1066 flow
[2024-06-03 21:35:28,842 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:35:28,842 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:35:28,842 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:35:28,842 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 21:35:28,842 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:35:28,856 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:35:28,856 INFO  L85        PathProgramCache]: Analyzing trace with hash 1081152242, now seen corresponding path program 3 times
[2024-06-03 21:35:28,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:35:28,857 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588679458]
[2024-06-03 21:35:28,857 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:35:28,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:35:28,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:35:38,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:35:38,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:35:38,516 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588679458]
[2024-06-03 21:35:38,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588679458] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:35:38,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:35:38,516 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:35:38,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133134981]
[2024-06-03 21:35:38,518 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:35:38,519 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:35:38,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:35:38,520 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:35:38,520 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:35:38,648 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 21:35:38,648 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 125 transitions, 1066 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-03 21:35:38,648 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:35:38,648 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 21:35:38,649 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:35:40,106 INFO  L124   PetriNetUnfolderBase]: 1861/2884 cut-off events.
[2024-06-03 21:35:40,107 INFO  L125   PetriNetUnfolderBase]: For 74185/74185 co-relation queries the response was YES.
[2024-06-03 21:35:40,117 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17720 conditions, 2884 events. 1861/2884 cut-off events. For 74185/74185 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 14316 event pairs, 467 based on Foata normal form. 8/2878 useless extension candidates. Maximal degree in co-relation 17673. Up to 2577 conditions per place. 
[2024-06-03 21:35:40,127 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 118 selfloop transitions, 35 changer transitions 0/163 dead transitions.
[2024-06-03 21:35:40,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 163 transitions, 1516 flow
[2024-06-03 21:35:40,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:35:40,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:35:40,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-03 21:35:40,130 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-03 21:35:40,130 INFO  L175             Difference]: Start difference. First operand has 109 places, 125 transitions, 1066 flow. Second operand 9 states and 165 transitions.
[2024-06-03 21:35:40,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 163 transitions, 1516 flow
[2024-06-03 21:35:40,158 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 163 transitions, 1445 flow, removed 18 selfloop flow, removed 7 redundant places.
[2024-06-03 21:35:40,164 INFO  L231             Difference]: Finished difference. Result has 111 places, 127 transitions, 1127 flow
[2024-06-03 21:35:40,164 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1127, PETRI_PLACES=111, PETRI_TRANSITIONS=127}
[2024-06-03 21:35:40,164 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places.
[2024-06-03 21:35:40,164 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 127 transitions, 1127 flow
[2024-06-03 21:35:40,165 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-03 21:35:40,165 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:35:40,165 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:35:40,165 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 21:35:40,165 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:35:40,165 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:35:40,165 INFO  L85        PathProgramCache]: Analyzing trace with hash 1732111873, now seen corresponding path program 1 times
[2024-06-03 21:35:40,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:35:40,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469636141]
[2024-06-03 21:35:40,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:35:40,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:35:40,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:35:53,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:35:53,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:35:53,855 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469636141]
[2024-06-03 21:35:53,856 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469636141] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:35:53,856 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:35:53,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:35:53,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142399619]
[2024-06-03 21:35:53,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:35:53,856 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:35:53,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:35:53,857 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:35:53,857 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:35:53,944 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-03 21:35:53,945 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 127 transitions, 1127 flow. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:35:53,945 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:35:53,945 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-03 21:35:53,945 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:35:55,283 INFO  L124   PetriNetUnfolderBase]: 2180/3246 cut-off events.
[2024-06-03 21:35:55,284 INFO  L125   PetriNetUnfolderBase]: For 80476/80476 co-relation queries the response was YES.
[2024-06-03 21:35:55,294 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19557 conditions, 3246 events. 2180/3246 cut-off events. For 80476/80476 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 15013 event pairs, 554 based on Foata normal form. 1/3244 useless extension candidates. Maximal degree in co-relation 19509. Up to 3208 conditions per place. 
[2024-06-03 21:35:55,304 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 130 selfloop transitions, 16 changer transitions 0/149 dead transitions.
[2024-06-03 21:35:55,305 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 149 transitions, 1569 flow
[2024-06-03 21:35:55,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:35:55,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:35:55,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions.
[2024-06-03 21:35:55,306 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39285714285714285
[2024-06-03 21:35:55,306 INFO  L175             Difference]: Start difference. First operand has 111 places, 127 transitions, 1127 flow. Second operand 6 states and 99 transitions.
[2024-06-03 21:35:55,306 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 149 transitions, 1569 flow
[2024-06-03 21:35:55,344 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 149 transitions, 1464 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-03 21:35:55,346 INFO  L231             Difference]: Finished difference. Result has 111 places, 133 transitions, 1130 flow
[2024-06-03 21:35:55,346 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1130, PETRI_PLACES=111, PETRI_TRANSITIONS=133}
[2024-06-03 21:35:55,347 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places.
[2024-06-03 21:35:55,347 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 133 transitions, 1130 flow
[2024-06-03 21:35:55,347 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:35:55,347 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:35:55,347 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:35:55,347 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 21:35:55,347 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-03 21:35:55,348 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:35:55,348 INFO  L85        PathProgramCache]: Analyzing trace with hash -117863738, now seen corresponding path program 4 times
[2024-06-03 21:35:55,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:35:55,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847449157]
[2024-06-03 21:35:55,348 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:35:55,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:35:55,390 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:36:05,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:36:05,000 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:36:05,000 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847449157]
[2024-06-03 21:36:05,000 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847449157] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:36:05,000 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:36:05,000 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:36:05,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109096233]
[2024-06-03 21:36:05,000 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:36:05,001 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:36:05,001 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:36:05,001 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:36:05,001 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:36:05,177 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 21:36:05,178 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 133 transitions, 1130 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-03 21:36:05,178 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:36:05,178 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 21:36:05,178 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:36:06,586 INFO  L124   PetriNetUnfolderBase]: 1950/3040 cut-off events.
[2024-06-03 21:36:06,586 INFO  L125   PetriNetUnfolderBase]: For 92442/92454 co-relation queries the response was YES.
[2024-06-03 21:36:06,597 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19037 conditions, 3040 events. 1950/3040 cut-off events. For 92442/92454 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15288 event pairs, 457 based on Foata normal form. 32/3062 useless extension candidates. Maximal degree in co-relation 18988. Up to 2385 conditions per place. 
[2024-06-03 21:36:06,607 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 98 selfloop transitions, 65 changer transitions 0/175 dead transitions.
[2024-06-03 21:36:06,608 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 175 transitions, 1714 flow
[2024-06-03 21:36:06,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:36:06,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:36:06,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-03 21:36:06,610 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46296296296296297
[2024-06-03 21:36:06,611 INFO  L175             Difference]: Start difference. First operand has 111 places, 133 transitions, 1130 flow. Second operand 9 states and 175 transitions.
[2024-06-03 21:36:06,611 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 175 transitions, 1714 flow
[2024-06-03 21:36:06,646 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 175 transitions, 1676 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-03 21:36:06,648 INFO  L231             Difference]: Finished difference. Result has 118 places, 135 transitions, 1288 flow
[2024-06-03 21:36:06,648 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1288, PETRI_PLACES=118, PETRI_TRANSITIONS=135}
[2024-06-03 21:36:06,649 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 75 predicate places.
[2024-06-03 21:36:06,649 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 135 transitions, 1288 flow
[2024-06-03 21:36:06,649 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-03 21:36:06,649 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:36:06,649 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:36:06,650 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-03 21:36:06,650 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-03 21:36:06,650 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:36:06,650 INFO  L85        PathProgramCache]: Analyzing trace with hash 645277746, now seen corresponding path program 2 times
[2024-06-03 21:36:06,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:36:06,650 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73286172]
[2024-06-03 21:36:06,650 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:36:06,650 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:36:06,695 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:36:16,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:36:16,267 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:36:16,267 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73286172]
[2024-06-03 21:36:16,267 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73286172] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:36:16,267 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:36:16,267 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:36:16,267 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094262862]
[2024-06-03 21:36:16,268 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:36:16,268 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:36:16,268 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:36:16,268 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:36:16,268 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:36:16,455 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:36:16,455 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 135 transitions, 1288 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:36:16,455 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:36:16,455 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:36:16,456 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:36:18,072 INFO  L124   PetriNetUnfolderBase]: 2150/3280 cut-off events.
[2024-06-03 21:36:18,073 INFO  L125   PetriNetUnfolderBase]: For 94782/94794 co-relation queries the response was YES.
[2024-06-03 21:36:18,084 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20552 conditions, 3280 events. 2150/3280 cut-off events. For 94782/94794 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15898 event pairs, 499 based on Foata normal form. 12/3287 useless extension candidates. Maximal degree in co-relation 20501. Up to 2698 conditions per place. 
[2024-06-03 21:36:18,099 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 106 selfloop transitions, 70 changer transitions 0/183 dead transitions.
[2024-06-03 21:36:18,100 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 183 transitions, 1922 flow
[2024-06-03 21:36:18,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:36:18,102 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:36:18,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions.
[2024-06-03 21:36:18,103 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4357142857142857
[2024-06-03 21:36:18,103 INFO  L175             Difference]: Start difference. First operand has 118 places, 135 transitions, 1288 flow. Second operand 10 states and 183 transitions.
[2024-06-03 21:36:18,104 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 183 transitions, 1922 flow
[2024-06-03 21:36:18,172 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 183 transitions, 1745 flow, removed 20 selfloop flow, removed 7 redundant places.
[2024-06-03 21:36:18,175 INFO  L231             Difference]: Finished difference. Result has 122 places, 142 transitions, 1350 flow
[2024-06-03 21:36:18,175 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1350, PETRI_PLACES=122, PETRI_TRANSITIONS=142}
[2024-06-03 21:36:18,175 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places.
[2024-06-03 21:36:18,176 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 142 transitions, 1350 flow
[2024-06-03 21:36:18,176 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:36:18,176 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:36:18,176 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:36:18,176 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-03 21:36:18,176 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-03 21:36:18,176 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:36:18,177 INFO  L85        PathProgramCache]: Analyzing trace with hash 1688431584, now seen corresponding path program 2 times
[2024-06-03 21:36:18,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:36:18,177 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037054404]
[2024-06-03 21:36:18,177 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:36:18,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:36:18,222 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:36:28,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:36:28,669 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:36:28,669 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037054404]
[2024-06-03 21:36:28,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037054404] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:36:28,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:36:28,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:36:28,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193009471]
[2024-06-03 21:36:28,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:36:28,671 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:36:28,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:36:28,671 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:36:28,674 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:36:28,848 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:36:28,848 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 142 transitions, 1350 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:36:28,848 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:36:28,848 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:36:28,848 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:36:30,354 INFO  L124   PetriNetUnfolderBase]: 2167/3307 cut-off events.
[2024-06-03 21:36:30,355 INFO  L125   PetriNetUnfolderBase]: For 98467/98479 co-relation queries the response was YES.
[2024-06-03 21:36:30,364 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20802 conditions, 3307 events. 2167/3307 cut-off events. For 98467/98479 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 16045 event pairs, 526 based on Foata normal form. 12/3314 useless extension candidates. Maximal degree in co-relation 20749. Up to 3078 conditions per place. 
[2024-06-03 21:36:30,373 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 134 selfloop transitions, 31 changer transitions 0/172 dead transitions.
[2024-06-03 21:36:30,373 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 172 transitions, 1800 flow
[2024-06-03 21:36:30,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:36:30,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:36:30,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-03 21:36:30,376 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3994708994708995
[2024-06-03 21:36:30,376 INFO  L175             Difference]: Start difference. First operand has 122 places, 142 transitions, 1350 flow. Second operand 9 states and 151 transitions.
[2024-06-03 21:36:30,376 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 172 transitions, 1800 flow
[2024-06-03 21:36:30,420 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 172 transitions, 1630 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-03 21:36:30,422 INFO  L231             Difference]: Finished difference. Result has 124 places, 144 transitions, 1303 flow
[2024-06-03 21:36:30,423 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1303, PETRI_PLACES=124, PETRI_TRANSITIONS=144}
[2024-06-03 21:36:30,423 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 81 predicate places.
[2024-06-03 21:36:30,423 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 144 transitions, 1303 flow
[2024-06-03 21:36:30,424 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:36:30,424 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:36:30,424 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:36:30,424 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-03 21:36:30,424 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-03 21:36:30,424 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:36:30,424 INFO  L85        PathProgramCache]: Analyzing trace with hash -493970938, now seen corresponding path program 3 times
[2024-06-03 21:36:30,425 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:36:30,425 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611782642]
[2024-06-03 21:36:30,425 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:36:30,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:36:30,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:36:39,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:36:39,891 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:36:39,891 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611782642]
[2024-06-03 21:36:39,891 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611782642] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:36:39,891 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:36:39,891 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:36:39,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139686363]
[2024-06-03 21:36:39,918 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:36:39,919 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:36:39,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:36:39,919 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:36:39,919 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:36:40,117 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:36:40,117 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 144 transitions, 1303 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:36:40,117 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:36:40,117 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:36:40,117 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:36:41,533 INFO  L124   PetriNetUnfolderBase]: 2211/3371 cut-off events.
[2024-06-03 21:36:41,533 INFO  L125   PetriNetUnfolderBase]: For 105251/105263 co-relation queries the response was YES.
[2024-06-03 21:36:41,546 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21222 conditions, 3371 events. 2211/3371 cut-off events. For 105251/105263 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16394 event pairs, 514 based on Foata normal form. 12/3378 useless extension candidates. Maximal degree in co-relation 21168. Up to 2902 conditions per place. 
[2024-06-03 21:36:41,560 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 119 selfloop transitions, 60 changer transitions 0/186 dead transitions.
[2024-06-03 21:36:41,560 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 186 transitions, 1831 flow
[2024-06-03 21:36:41,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:36:41,562 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:36:41,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-03 21:36:41,563 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4312169312169312
[2024-06-03 21:36:41,563 INFO  L175             Difference]: Start difference. First operand has 124 places, 144 transitions, 1303 flow. Second operand 9 states and 163 transitions.
[2024-06-03 21:36:41,563 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 186 transitions, 1831 flow
[2024-06-03 21:36:41,616 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 186 transitions, 1726 flow, removed 23 selfloop flow, removed 7 redundant places.
[2024-06-03 21:36:41,618 INFO  L231             Difference]: Finished difference. Result has 126 places, 152 transitions, 1422 flow
[2024-06-03 21:36:41,618 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1422, PETRI_PLACES=126, PETRI_TRANSITIONS=152}
[2024-06-03 21:36:41,619 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places.
[2024-06-03 21:36:41,619 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 152 transitions, 1422 flow
[2024-06-03 21:36:41,619 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:36:41,619 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:36:41,620 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:36:41,620 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-03 21:36:41,620 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-03 21:36:41,620 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:36:41,620 INFO  L85        PathProgramCache]: Analyzing trace with hash -257492150, now seen corresponding path program 3 times
[2024-06-03 21:36:41,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:36:41,620 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036573626]
[2024-06-03 21:36:41,621 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:36:41,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:36:41,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:36:51,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:36:51,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:36:51,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036573626]
[2024-06-03 21:36:51,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036573626] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:36:51,687 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:36:51,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:36:51,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680670210]
[2024-06-03 21:36:51,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:36:51,687 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:36:51,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:36:51,688 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:36:51,688 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:36:51,992 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:36:51,992 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 152 transitions, 1422 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:36:51,992 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:36:51,992 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:36:51,992 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:36:53,498 INFO  L124   PetriNetUnfolderBase]: 2228/3398 cut-off events.
[2024-06-03 21:36:53,498 INFO  L125   PetriNetUnfolderBase]: For 112444/112456 co-relation queries the response was YES.
[2024-06-03 21:36:53,510 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21798 conditions, 3398 events. 2228/3398 cut-off events. For 112444/112456 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16596 event pairs, 499 based on Foata normal form. 12/3405 useless extension candidates. Maximal degree in co-relation 21743. Up to 3045 conditions per place. 
[2024-06-03 21:36:53,521 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 130 selfloop transitions, 50 changer transitions 0/187 dead transitions.
[2024-06-03 21:36:53,521 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 187 transitions, 2072 flow
[2024-06-03 21:36:53,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:36:53,524 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:36:53,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-03 21:36:53,524 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4074074074074074
[2024-06-03 21:36:53,524 INFO  L175             Difference]: Start difference. First operand has 126 places, 152 transitions, 1422 flow. Second operand 9 states and 154 transitions.
[2024-06-03 21:36:53,525 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 187 transitions, 2072 flow
[2024-06-03 21:36:53,588 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 187 transitions, 1983 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-03 21:36:53,590 INFO  L231             Difference]: Finished difference. Result has 129 places, 156 transitions, 1560 flow
[2024-06-03 21:36:53,590 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1560, PETRI_PLACES=129, PETRI_TRANSITIONS=156}
[2024-06-03 21:36:53,591 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places.
[2024-06-03 21:36:53,591 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 156 transitions, 1560 flow
[2024-06-03 21:36:53,591 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:36:53,591 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:36:53,591 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:36:53,591 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-03 21:36:53,591 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-03 21:36:53,592 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:36:53,592 INFO  L85        PathProgramCache]: Analyzing trace with hash -257788820, now seen corresponding path program 4 times
[2024-06-03 21:36:53,592 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:36:53,592 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259919208]
[2024-06-03 21:36:53,592 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:36:53,592 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:36:53,632 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:37:04,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-03 21:37:04,103 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:37:04,103 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259919208]
[2024-06-03 21:37:04,103 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259919208] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:37:04,103 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:37:04,103 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:37:04,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422042771]
[2024-06-03 21:37:04,103 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:37:04,104 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:37:04,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:37:04,104 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:37:04,104 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:37:04,247 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:37:04,247 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 156 transitions, 1560 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:37:04,247 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:37:04,247 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:37:04,248 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:37:05,785 INFO  L124   PetriNetUnfolderBase]: 2220/3386 cut-off events.
[2024-06-03 21:37:05,786 INFO  L125   PetriNetUnfolderBase]: For 105414/105426 co-relation queries the response was YES.
[2024-06-03 21:37:05,798 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21621 conditions, 3386 events. 2220/3386 cut-off events. For 105414/105426 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16457 event pairs, 534 based on Foata normal form. 12/3393 useless extension candidates. Maximal degree in co-relation 21566. Up to 3116 conditions per place. 
[2024-06-03 21:37:05,811 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 137 selfloop transitions, 44 changer transitions 0/188 dead transitions.
[2024-06-03 21:37:05,811 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 188 transitions, 2002 flow
[2024-06-03 21:37:05,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:37:05,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:37:05,812 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions.
[2024-06-03 21:37:05,813 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3952380952380952
[2024-06-03 21:37:05,813 INFO  L175             Difference]: Start difference. First operand has 129 places, 156 transitions, 1560 flow. Second operand 10 states and 166 transitions.
[2024-06-03 21:37:05,813 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 188 transitions, 2002 flow
[2024-06-03 21:37:05,879 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 188 transitions, 1862 flow, removed 45 selfloop flow, removed 5 redundant places.
[2024-06-03 21:37:05,881 INFO  L231             Difference]: Finished difference. Result has 134 places, 156 transitions, 1516 flow
[2024-06-03 21:37:05,882 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1516, PETRI_PLACES=134, PETRI_TRANSITIONS=156}
[2024-06-03 21:37:05,882 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places.
[2024-06-03 21:37:05,882 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 156 transitions, 1516 flow
[2024-06-03 21:37:05,882 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:37:05,882 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:37:05,883 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:37:05,883 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-03 21:37:05,883 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-03 21:37:05,883 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:37:05,883 INFO  L85        PathProgramCache]: Analyzing trace with hash -266069788, now seen corresponding path program 4 times
[2024-06-03 21:37:05,883 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:37:05,884 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891857705]
[2024-06-03 21:37:05,884 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:37:05,884 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:37:05,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:37:15,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:37:15,368 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:37:15,368 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891857705]
[2024-06-03 21:37:15,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891857705] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:37:15,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:37:15,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:37:15,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361488764]
[2024-06-03 21:37:15,369 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:37:15,369 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:37:15,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:37:15,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:37:15,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:37:15,586 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:37:15,586 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 156 transitions, 1516 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:37:15,586 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:37:15,586 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:37:15,586 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:37:17,059 INFO  L124   PetriNetUnfolderBase]: 2210/3372 cut-off events.
[2024-06-03 21:37:17,059 INFO  L125   PetriNetUnfolderBase]: For 108625/108637 co-relation queries the response was YES.
[2024-06-03 21:37:17,072 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21547 conditions, 3372 events. 2210/3372 cut-off events. For 108625/108637 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16416 event pairs, 507 based on Foata normal form. 12/3379 useless extension candidates. Maximal degree in co-relation 21490. Up to 2926 conditions per place. 
[2024-06-03 21:37:17,085 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 124 selfloop transitions, 61 changer transitions 0/192 dead transitions.
[2024-06-03 21:37:17,085 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 192 transitions, 1996 flow
[2024-06-03 21:37:17,087 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:37:17,087 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:37:17,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-03 21:37:17,088 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-03 21:37:17,088 INFO  L175             Difference]: Start difference. First operand has 134 places, 156 transitions, 1516 flow. Second operand 9 states and 162 transitions.
[2024-06-03 21:37:17,088 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 192 transitions, 1996 flow
[2024-06-03 21:37:17,158 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 192 transitions, 1867 flow, removed 16 selfloop flow, removed 9 redundant places.
[2024-06-03 21:37:17,161 INFO  L231             Difference]: Finished difference. Result has 134 places, 158 transitions, 1539 flow
[2024-06-03 21:37:17,161 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1539, PETRI_PLACES=134, PETRI_TRANSITIONS=158}
[2024-06-03 21:37:17,161 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places.
[2024-06-03 21:37:17,161 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 158 transitions, 1539 flow
[2024-06-03 21:37:17,162 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:37:17,162 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:37:17,162 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:37:17,162 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-03 21:37:17,162 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:37:17,162 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:37:17,162 INFO  L85        PathProgramCache]: Analyzing trace with hash 1743539713, now seen corresponding path program 2 times
[2024-06-03 21:37:17,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:37:17,163 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045279904]
[2024-06-03 21:37:17,163 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:37:17,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:37:17,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:37:31,112 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:37:31,113 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:37:31,113 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045279904]
[2024-06-03 21:37:31,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045279904] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:37:31,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:37:31,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:37:31,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943063624]
[2024-06-03 21:37:31,114 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:37:31,114 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:37:31,114 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:37:31,114 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:37:31,114 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:37:31,236 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-03 21:37:31,236 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 158 transitions, 1539 flow. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:37:31,236 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:37:31,236 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-03 21:37:31,236 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:37:32,584 INFO  L124   PetriNetUnfolderBase]: 2340/3501 cut-off events.
[2024-06-03 21:37:32,585 INFO  L125   PetriNetUnfolderBase]: For 113497/113509 co-relation queries the response was YES.
[2024-06-03 21:37:32,597 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22418 conditions, 3501 events. 2340/3501 cut-off events. For 113497/113509 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16541 event pairs, 573 based on Foata normal form. 9/3505 useless extension candidates. Maximal degree in co-relation 22360. Up to 3462 conditions per place. 
[2024-06-03 21:37:32,608 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 148 selfloop transitions, 16 changer transitions 0/167 dead transitions.
[2024-06-03 21:37:32,608 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 167 transitions, 1889 flow
[2024-06-03 21:37:32,608 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:37:32,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:37:32,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions.
[2024-06-03 21:37:32,609 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36507936507936506
[2024-06-03 21:37:32,609 INFO  L175             Difference]: Start difference. First operand has 134 places, 158 transitions, 1539 flow. Second operand 6 states and 92 transitions.
[2024-06-03 21:37:32,609 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 167 transitions, 1889 flow
[2024-06-03 21:37:32,675 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 167 transitions, 1767 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-03 21:37:32,677 INFO  L231             Difference]: Finished difference. Result has 134 places, 158 transitions, 1455 flow
[2024-06-03 21:37:32,677 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1417, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1455, PETRI_PLACES=134, PETRI_TRANSITIONS=158}
[2024-06-03 21:37:32,677 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places.
[2024-06-03 21:37:32,678 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 158 transitions, 1455 flow
[2024-06-03 21:37:32,678 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:37:32,678 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:37:32,678 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:37:32,678 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-03 21:37:32,678 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:37:32,678 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:37:32,679 INFO  L85        PathProgramCache]: Analyzing trace with hash 1737831745, now seen corresponding path program 1 times
[2024-06-03 21:37:32,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:37:32,679 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127842431]
[2024-06-03 21:37:32,679 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:37:32,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:37:32,717 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:37:45,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:37:45,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:37:45,099 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127842431]
[2024-06-03 21:37:45,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127842431] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:37:45,099 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:37:45,099 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:37:45,099 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029210717]
[2024-06-03 21:37:45,099 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:37:45,099 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:37:45,099 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:37:45,099 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:37:45,099 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:37:45,245 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:37:45,245 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 158 transitions, 1455 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:37:45,245 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:37:45,245 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:37:45,246 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:37:46,398 INFO  L124   PetriNetUnfolderBase]: 2096/3232 cut-off events.
[2024-06-03 21:37:46,398 INFO  L125   PetriNetUnfolderBase]: For 95453/95453 co-relation queries the response was YES.
[2024-06-03 21:37:46,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19804 conditions, 3232 events. 2096/3232 cut-off events. For 95453/95453 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15810 event pairs, 483 based on Foata normal form. 1/3230 useless extension candidates. Maximal degree in co-relation 19746. Up to 3118 conditions per place. 
[2024-06-03 21:37:46,418 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 157 selfloop transitions, 16 changer transitions 0/177 dead transitions.
[2024-06-03 21:37:46,418 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 177 transitions, 1947 flow
[2024-06-03 21:37:46,418 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:37:46,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:37:46,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions.
[2024-06-03 21:37:46,419 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4007936507936508
[2024-06-03 21:37:46,419 INFO  L175             Difference]: Start difference. First operand has 134 places, 158 transitions, 1455 flow. Second operand 6 states and 101 transitions.
[2024-06-03 21:37:46,419 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 177 transitions, 1947 flow
[2024-06-03 21:37:46,475 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 177 transitions, 1907 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-03 21:37:46,477 INFO  L231             Difference]: Finished difference. Result has 135 places, 164 transitions, 1515 flow
[2024-06-03 21:37:46,477 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1515, PETRI_PLACES=135, PETRI_TRANSITIONS=164}
[2024-06-03 21:37:46,477 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 92 predicate places.
[2024-06-03 21:37:46,477 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 164 transitions, 1515 flow
[2024-06-03 21:37:46,477 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:37:46,477 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:37:46,478 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:37:46,478 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-03 21:37:46,478 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:37:46,479 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:37:46,479 INFO  L85        PathProgramCache]: Analyzing trace with hash -1606749021, now seen corresponding path program 2 times
[2024-06-03 21:37:46,479 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:37:46,479 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701936347]
[2024-06-03 21:37:46,479 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:37:46,479 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:37:46,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:37:58,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:37:58,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:37:58,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701936347]
[2024-06-03 21:37:58,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701936347] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:37:58,654 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:37:58,654 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:37:58,654 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192409301]
[2024-06-03 21:37:58,654 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:37:58,655 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:37:58,655 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:37:58,655 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:37:58,655 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:37:58,795 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:37:58,795 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 164 transitions, 1515 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:37:58,795 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:37:58,795 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:37:58,795 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:37:59,935 INFO  L124   PetriNetUnfolderBase]: 2093/3228 cut-off events.
[2024-06-03 21:37:59,935 INFO  L125   PetriNetUnfolderBase]: For 101279/101279 co-relation queries the response was YES.
[2024-06-03 21:37:59,947 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20243 conditions, 3228 events. 2093/3228 cut-off events. For 101279/101279 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15793 event pairs, 482 based on Foata normal form. 1/3226 useless extension candidates. Maximal degree in co-relation 20184. Up to 3127 conditions per place. 
[2024-06-03 21:37:59,958 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 158 selfloop transitions, 11 changer transitions 0/173 dead transitions.
[2024-06-03 21:37:59,958 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 173 transitions, 1875 flow
[2024-06-03 21:37:59,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:37:59,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:37:59,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions.
[2024-06-03 21:37:59,959 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.376984126984127
[2024-06-03 21:37:59,959 INFO  L175             Difference]: Start difference. First operand has 135 places, 164 transitions, 1515 flow. Second operand 6 states and 95 transitions.
[2024-06-03 21:37:59,959 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 173 transitions, 1875 flow
[2024-06-03 21:38:00,018 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 173 transitions, 1827 flow, removed 20 selfloop flow, removed 2 redundant places.
[2024-06-03 21:38:00,020 INFO  L231             Difference]: Finished difference. Result has 139 places, 164 transitions, 1495 flow
[2024-06-03 21:38:00,021 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1495, PETRI_PLACES=139, PETRI_TRANSITIONS=164}
[2024-06-03 21:38:00,021 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 96 predicate places.
[2024-06-03 21:38:00,021 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 164 transitions, 1495 flow
[2024-06-03 21:38:00,021 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:38:00,021 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:38:00,022 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:38:00,022 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-03 21:38:00,022 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-03 21:38:00,022 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:38:00,022 INFO  L85        PathProgramCache]: Analyzing trace with hash -122922234, now seen corresponding path program 1 times
[2024-06-03 21:38:00,022 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:38:00,022 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619124096]
[2024-06-03 21:38:00,022 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:38:00,023 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:38:00,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:38:10,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:38:10,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:38:10,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619124096]
[2024-06-03 21:38:10,727 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619124096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:38:10,727 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:38:10,727 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:38:10,727 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735468330]
[2024-06-03 21:38:10,727 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:38:10,727 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:38:10,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:38:10,728 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:38:10,728 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:38:10,932 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:38:10,942 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 164 transitions, 1495 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:38:10,943 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:38:10,943 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:38:10,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:38:12,651 INFO  L124   PetriNetUnfolderBase]: 2341/3571 cut-off events.
[2024-06-03 21:38:12,651 INFO  L125   PetriNetUnfolderBase]: For 138122/138122 co-relation queries the response was YES.
[2024-06-03 21:38:12,664 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23292 conditions, 3571 events. 2341/3571 cut-off events. For 138122/138122 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17537 event pairs, 530 based on Foata normal form. 20/3585 useless extension candidates. Maximal degree in co-relation 23231. Up to 3204 conditions per place. 
[2024-06-03 21:38:12,675 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 188 selfloop transitions, 26 changer transitions 0/223 dead transitions.
[2024-06-03 21:38:12,675 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 223 transitions, 2148 flow
[2024-06-03 21:38:12,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 21:38:12,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 21:38:12,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions.
[2024-06-03 21:38:12,678 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41774891774891776
[2024-06-03 21:38:12,678 INFO  L175             Difference]: Start difference. First operand has 139 places, 164 transitions, 1495 flow. Second operand 11 states and 193 transitions.
[2024-06-03 21:38:12,678 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 223 transitions, 2148 flow
[2024-06-03 21:38:12,753 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 223 transitions, 2118 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-03 21:38:12,755 INFO  L231             Difference]: Finished difference. Result has 147 places, 171 transitions, 1628 flow
[2024-06-03 21:38:12,755 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1628, PETRI_PLACES=147, PETRI_TRANSITIONS=171}
[2024-06-03 21:38:12,756 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places.
[2024-06-03 21:38:12,756 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 171 transitions, 1628 flow
[2024-06-03 21:38:12,756 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:38:12,756 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:38:12,756 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:38:12,756 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-03 21:38:12,757 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-03 21:38:12,757 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:38:12,757 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139404587, now seen corresponding path program 1 times
[2024-06-03 21:38:12,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:38:12,757 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777740306]
[2024-06-03 21:38:12,757 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:38:12,757 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:38:12,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:38:28,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:38:28,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:38:28,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777740306]
[2024-06-03 21:38:28,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777740306] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:38:28,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:38:28,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:38:28,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054220517]
[2024-06-03 21:38:28,400 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:38:28,400 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:38:28,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:38:28,401 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:38:28,401 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:38:28,568 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-03 21:38:28,568 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 171 transitions, 1628 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:38:28,568 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:38:28,568 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-03 21:38:28,568 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:38:30,037 INFO  L124   PetriNetUnfolderBase]: 2466/3700 cut-off events.
[2024-06-03 21:38:30,037 INFO  L125   PetriNetUnfolderBase]: For 137427/137427 co-relation queries the response was YES.
[2024-06-03 21:38:30,050 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24395 conditions, 3700 events. 2466/3700 cut-off events. For 137427/137427 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17749 event pairs, 588 based on Foata normal form. 2/3699 useless extension candidates. Maximal degree in co-relation 24331. Up to 3614 conditions per place. 
[2024-06-03 21:38:30,061 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 173 selfloop transitions, 26 changer transitions 0/202 dead transitions.
[2024-06-03 21:38:30,062 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 202 transitions, 2220 flow
[2024-06-03 21:38:30,062 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:38:30,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:38:30,063 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-03 21:38:30,063 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-03 21:38:30,063 INFO  L175             Difference]: Start difference. First operand has 147 places, 171 transitions, 1628 flow. Second operand 7 states and 119 transitions.
[2024-06-03 21:38:30,063 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 202 transitions, 2220 flow
[2024-06-03 21:38:30,142 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 202 transitions, 2148 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-03 21:38:30,144 INFO  L231             Difference]: Finished difference. Result has 147 places, 177 transitions, 1685 flow
[2024-06-03 21:38:30,144 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1685, PETRI_PLACES=147, PETRI_TRANSITIONS=177}
[2024-06-03 21:38:30,145 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places.
[2024-06-03 21:38:30,145 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 177 transitions, 1685 flow
[2024-06-03 21:38:30,145 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:38:30,145 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:38:30,145 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:38:30,145 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-03 21:38:30,145 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-03 21:38:30,146 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:38:30,146 INFO  L85        PathProgramCache]: Analyzing trace with hash -193136454, now seen corresponding path program 2 times
[2024-06-03 21:38:30,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:38:30,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956401547]
[2024-06-03 21:38:30,146 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:38:30,146 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:38:30,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:38:38,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:38:38,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:38:38,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956401547]
[2024-06-03 21:38:38,447 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956401547] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:38:38,447 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:38:38,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:38:38,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9395015]
[2024-06-03 21:38:38,447 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:38:38,447 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:38:38,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:38:38,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:38:38,448 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:38:38,689 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:38:38,689 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 177 transitions, 1685 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 21:38:38,689 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:38:38,689 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:38:38,689 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:38:40,342 INFO  L124   PetriNetUnfolderBase]: 2447/3731 cut-off events.
[2024-06-03 21:38:40,343 INFO  L125   PetriNetUnfolderBase]: For 157147/157147 co-relation queries the response was YES.
[2024-06-03 21:38:40,360 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24990 conditions, 3731 events. 2447/3731 cut-off events. For 157147/157147 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18547 event pairs, 543 based on Foata normal form. 20/3735 useless extension candidates. Maximal degree in co-relation 24925. Up to 3127 conditions per place. 
[2024-06-03 21:38:40,378 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 159 selfloop transitions, 46 changer transitions 0/216 dead transitions.
[2024-06-03 21:38:40,379 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 216 transitions, 2247 flow
[2024-06-03 21:38:40,381 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:38:40,381 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:38:40,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-03 21:38:40,383 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-03 21:38:40,383 INFO  L175             Difference]: Start difference. First operand has 147 places, 177 transitions, 1685 flow. Second operand 9 states and 162 transitions.
[2024-06-03 21:38:40,383 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 216 transitions, 2247 flow
[2024-06-03 21:38:40,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 216 transitions, 2197 flow, removed 16 selfloop flow, removed 3 redundant places.
[2024-06-03 21:38:40,488 INFO  L231             Difference]: Finished difference. Result has 153 places, 178 transitions, 1782 flow
[2024-06-03 21:38:40,488 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1782, PETRI_PLACES=153, PETRI_TRANSITIONS=178}
[2024-06-03 21:38:40,489 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places.
[2024-06-03 21:38:40,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 178 transitions, 1782 flow
[2024-06-03 21:38:40,489 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 21:38:40,489 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:38:40,489 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:38:40,489 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-03 21:38:40,489 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-03 21:38:40,490 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:38:40,490 INFO  L85        PathProgramCache]: Analyzing trace with hash -838291630, now seen corresponding path program 3 times
[2024-06-03 21:38:40,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:38:40,490 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552923316]
[2024-06-03 21:38:40,490 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:38:40,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:38:40,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:38:50,243 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:38:50,243 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:38:50,244 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552923316]
[2024-06-03 21:38:50,244 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552923316] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:38:50,244 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:38:50,244 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:38:50,244 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998651498]
[2024-06-03 21:38:50,244 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:38:50,244 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:38:50,244 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:38:50,244 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:38:50,244 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:38:50,417 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:38:50,417 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 178 transitions, 1782 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:38:50,417 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:38:50,418 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:38:50,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:38:52,492 INFO  L124   PetriNetUnfolderBase]: 2745/4219 cut-off events.
[2024-06-03 21:38:52,493 INFO  L125   PetriNetUnfolderBase]: For 182983/182983 co-relation queries the response was YES.
[2024-06-03 21:38:52,513 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28890 conditions, 4219 events. 2745/4219 cut-off events. For 182983/182983 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 21941 event pairs, 625 based on Foata normal form. 16/4227 useless extension candidates. Maximal degree in co-relation 28823. Up to 3572 conditions per place. 
[2024-06-03 21:38:52,529 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 194 selfloop transitions, 30 changer transitions 0/235 dead transitions.
[2024-06-03 21:38:52,529 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 235 transitions, 2698 flow
[2024-06-03 21:38:52,531 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:38:52,531 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:38:52,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions.
[2024-06-03 21:38:52,537 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42142857142857143
[2024-06-03 21:38:52,537 INFO  L175             Difference]: Start difference. First operand has 153 places, 178 transitions, 1782 flow. Second operand 10 states and 177 transitions.
[2024-06-03 21:38:52,537 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 235 transitions, 2698 flow
[2024-06-03 21:38:52,676 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 235 transitions, 2554 flow, removed 25 selfloop flow, removed 7 redundant places.
[2024-06-03 21:38:52,680 INFO  L231             Difference]: Finished difference. Result has 158 places, 187 transitions, 1939 flow
[2024-06-03 21:38:52,680 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1939, PETRI_PLACES=158, PETRI_TRANSITIONS=187}
[2024-06-03 21:38:52,681 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places.
[2024-06-03 21:38:52,681 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 187 transitions, 1939 flow
[2024-06-03 21:38:52,681 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:38:52,682 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:38:52,682 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:38:52,682 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-03 21:38:52,682 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-03 21:38:52,682 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:38:52,682 INFO  L85        PathProgramCache]: Analyzing trace with hash -838299070, now seen corresponding path program 4 times
[2024-06-03 21:38:52,682 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:38:52,683 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209927008]
[2024-06-03 21:38:52,683 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:38:52,683 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:38:52,725 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:39:02,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-03 21:39:02,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:39:02,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209927008]
[2024-06-03 21:39:02,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209927008] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:39:02,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:39:02,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:39:02,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419652267]
[2024-06-03 21:39:02,801 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:39:02,802 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:39:02,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:39:02,802 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:39:02,802 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:39:02,982 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:39:02,982 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 187 transitions, 1939 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:39:02,982 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:39:02,982 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:39:02,982 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:39:04,871 INFO  L124   PetriNetUnfolderBase]: 2766/4262 cut-off events.
[2024-06-03 21:39:04,871 INFO  L125   PetriNetUnfolderBase]: For 187361/187361 co-relation queries the response was YES.
[2024-06-03 21:39:04,889 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28765 conditions, 4262 events. 2766/4262 cut-off events. For 187361/187361 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 22351 event pairs, 648 based on Foata normal form. 20/4279 useless extension candidates. Maximal degree in co-relation 28695. Up to 3899 conditions per place. 
[2024-06-03 21:39:04,903 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 191 selfloop transitions, 29 changer transitions 0/231 dead transitions.
[2024-06-03 21:39:04,904 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 231 transitions, 2556 flow
[2024-06-03 21:39:04,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:39:04,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:39:04,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-03 21:39:04,906 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4119047619047619
[2024-06-03 21:39:04,907 INFO  L175             Difference]: Start difference. First operand has 158 places, 187 transitions, 1939 flow. Second operand 10 states and 173 transitions.
[2024-06-03 21:39:04,907 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 231 transitions, 2556 flow
[2024-06-03 21:39:05,028 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 231 transitions, 2494 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-03 21:39:05,031 INFO  L231             Difference]: Finished difference. Result has 164 places, 190 transitions, 2018 flow
[2024-06-03 21:39:05,031 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2018, PETRI_PLACES=164, PETRI_TRANSITIONS=190}
[2024-06-03 21:39:05,032 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places.
[2024-06-03 21:39:05,032 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 190 transitions, 2018 flow
[2024-06-03 21:39:05,032 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:39:05,032 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:39:05,032 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:39:05,032 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-03 21:39:05,032 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:39:05,033 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:39:05,033 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139106057, now seen corresponding path program 2 times
[2024-06-03 21:39:05,033 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:39:05,033 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910572227]
[2024-06-03 21:39:05,033 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:39:05,033 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:39:05,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:39:20,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:39:20,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:39:20,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910572227]
[2024-06-03 21:39:20,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910572227] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:39:20,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:39:20,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:39:20,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304605670]
[2024-06-03 21:39:20,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:39:20,193 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:39:20,193 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:39:20,194 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:39:20,194 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:39:20,267 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-03 21:39:20,268 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 190 transitions, 2018 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:39:20,268 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:39:20,268 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-03 21:39:20,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:39:22,234 INFO  L124   PetriNetUnfolderBase]: 2881/4381 cut-off events.
[2024-06-03 21:39:22,234 INFO  L125   PetriNetUnfolderBase]: For 183836/183836 co-relation queries the response was YES.
[2024-06-03 21:39:22,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29525 conditions, 4381 events. 2881/4381 cut-off events. For 183836/183836 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 22510 event pairs, 709 based on Foata normal form. 2/4380 useless extension candidates. Maximal degree in co-relation 29452. Up to 4291 conditions per place. 
[2024-06-03 21:39:22,286 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 188 selfloop transitions, 30 changer transitions 0/221 dead transitions.
[2024-06-03 21:39:22,287 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 221 transitions, 2632 flow
[2024-06-03 21:39:22,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:39:22,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:39:22,288 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions.
[2024-06-03 21:39:22,288 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37566137566137564
[2024-06-03 21:39:22,288 INFO  L175             Difference]: Start difference. First operand has 164 places, 190 transitions, 2018 flow. Second operand 9 states and 142 transitions.
[2024-06-03 21:39:22,288 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 221 transitions, 2632 flow
[2024-06-03 21:39:22,468 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 221 transitions, 2540 flow, removed 15 selfloop flow, removed 8 redundant places.
[2024-06-03 21:39:22,471 INFO  L231             Difference]: Finished difference. Result has 165 places, 193 transitions, 2024 flow
[2024-06-03 21:39:22,471 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1926, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2024, PETRI_PLACES=165, PETRI_TRANSITIONS=193}
[2024-06-03 21:39:22,472 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 122 predicate places.
[2024-06-03 21:39:22,472 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 193 transitions, 2024 flow
[2024-06-03 21:39:22,472 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:39:22,472 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:39:22,472 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:39:22,473 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-03 21:39:22,473 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-03 21:39:22,473 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:39:22,473 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139105685, now seen corresponding path program 1 times
[2024-06-03 21:39:22,473 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:39:22,473 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205426957]
[2024-06-03 21:39:22,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:39:22,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:39:22,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:39:37,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:39:37,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:39:37,602 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205426957]
[2024-06-03 21:39:37,602 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205426957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:39:37,602 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:39:37,602 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:39:37,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013827026]
[2024-06-03 21:39:37,602 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:39:37,603 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:39:37,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:39:37,603 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:39:37,603 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:39:37,765 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-03 21:39:37,766 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 193 transitions, 2024 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:39:37,766 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:39:37,766 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-03 21:39:37,766 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:39:39,443 INFO  L124   PetriNetUnfolderBase]: 2886/4388 cut-off events.
[2024-06-03 21:39:39,444 INFO  L125   PetriNetUnfolderBase]: For 187146/187146 co-relation queries the response was YES.
[2024-06-03 21:39:39,463 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29476 conditions, 4388 events. 2886/4388 cut-off events. For 187146/187146 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 22519 event pairs, 709 based on Foata normal form. 1/4386 useless extension candidates. Maximal degree in co-relation 29402. Up to 4339 conditions per place. 
[2024-06-03 21:39:39,479 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 193 selfloop transitions, 23 changer transitions 0/219 dead transitions.
[2024-06-03 21:39:39,479 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 219 transitions, 2662 flow
[2024-06-03 21:39:39,479 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:39:39,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:39:39,480 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-03 21:39:39,480 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38095238095238093
[2024-06-03 21:39:39,480 INFO  L175             Difference]: Start difference. First operand has 165 places, 193 transitions, 2024 flow. Second operand 7 states and 112 transitions.
[2024-06-03 21:39:39,480 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 219 transitions, 2662 flow
[2024-06-03 21:39:39,603 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 219 transitions, 2582 flow, removed 10 selfloop flow, removed 7 redundant places.
[2024-06-03 21:39:39,606 INFO  L231             Difference]: Finished difference. Result has 166 places, 202 transitions, 2104 flow
[2024-06-03 21:39:39,606 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2104, PETRI_PLACES=166, PETRI_TRANSITIONS=202}
[2024-06-03 21:39:39,606 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 123 predicate places.
[2024-06-03 21:39:39,606 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 202 transitions, 2104 flow
[2024-06-03 21:39:39,606 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:39:39,606 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:39:39,607 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:39:39,607 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-03 21:39:39,607 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:39:39,607 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:39:39,607 INFO  L85        PathProgramCache]: Analyzing trace with hash -457528512, now seen corresponding path program 5 times
[2024-06-03 21:39:39,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:39:39,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421084678]
[2024-06-03 21:39:39,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:39:39,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:39:39,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:39:50,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:39:50,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:39:50,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421084678]
[2024-06-03 21:39:50,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421084678] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:39:50,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:39:50,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:39:50,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193193859]
[2024-06-03 21:39:50,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:39:50,357 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:39:50,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:39:50,357 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:39:50,357 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:39:50,673 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:39:50,673 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 202 transitions, 2104 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:39:50,673 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:39:50,673 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:39:50,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:39:52,791 INFO  L124   PetriNetUnfolderBase]: 2965/4589 cut-off events.
[2024-06-03 21:39:52,792 INFO  L125   PetriNetUnfolderBase]: For 225386/225395 co-relation queries the response was YES.
[2024-06-03 21:39:52,814 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31926 conditions, 4589 events. 2965/4589 cut-off events. For 225386/225395 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24522 event pairs, 654 based on Foata normal form. 22/4606 useless extension candidates. Maximal degree in co-relation 31850. Up to 3178 conditions per place. 
[2024-06-03 21:39:52,829 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 166 selfloop transitions, 72 changer transitions 0/250 dead transitions.
[2024-06-03 21:39:52,830 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 250 transitions, 2950 flow
[2024-06-03 21:39:52,832 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:39:52,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:39:52,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions.
[2024-06-03 21:39:52,835 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4261904761904762
[2024-06-03 21:39:52,835 INFO  L175             Difference]: Start difference. First operand has 166 places, 202 transitions, 2104 flow. Second operand 10 states and 179 transitions.
[2024-06-03 21:39:52,835 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 250 transitions, 2950 flow
[2024-06-03 21:39:53,009 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 250 transitions, 2906 flow, removed 19 selfloop flow, removed 2 redundant places.
[2024-06-03 21:39:53,012 INFO  L231             Difference]: Finished difference. Result has 175 places, 205 transitions, 2344 flow
[2024-06-03 21:39:53,012 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2060, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2344, PETRI_PLACES=175, PETRI_TRANSITIONS=205}
[2024-06-03 21:39:53,012 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 132 predicate places.
[2024-06-03 21:39:53,012 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 205 transitions, 2344 flow
[2024-06-03 21:39:53,013 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:39:53,013 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:39:53,013 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:39:53,013 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-03 21:39:53,013 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:39:53,013 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:39:53,013 INFO  L85        PathProgramCache]: Analyzing trace with hash 598482770, now seen corresponding path program 6 times
[2024-06-03 21:39:53,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:39:53,014 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853547849]
[2024-06-03 21:39:53,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:39:53,014 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:39:53,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:40:03,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:40:03,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:40:03,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853547849]
[2024-06-03 21:40:03,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853547849] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:40:03,687 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:40:03,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:40:03,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945747994]
[2024-06-03 21:40:03,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:40:03,688 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:40:03,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:40:03,688 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:40:03,688 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:40:03,960 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:40:03,961 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 205 transitions, 2344 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:40:03,961 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:40:03,961 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:40:03,961 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:40:06,379 INFO  L124   PetriNetUnfolderBase]: 3248/5052 cut-off events.
[2024-06-03 21:40:06,380 INFO  L125   PetriNetUnfolderBase]: For 259278/259287 co-relation queries the response was YES.
[2024-06-03 21:40:06,405 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36052 conditions, 5052 events. 3248/5052 cut-off events. For 259278/259287 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 27920 event pairs, 764 based on Foata normal form. 22/5069 useless extension candidates. Maximal degree in co-relation 35972. Up to 4190 conditions per place. 
[2024-06-03 21:40:06,423 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 181 selfloop transitions, 67 changer transitions 0/260 dead transitions.
[2024-06-03 21:40:06,424 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 260 transitions, 3269 flow
[2024-06-03 21:40:06,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 21:40:06,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 21:40:06,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions.
[2024-06-03 21:40:06,426 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42424242424242425
[2024-06-03 21:40:06,427 INFO  L175             Difference]: Start difference. First operand has 175 places, 205 transitions, 2344 flow. Second operand 11 states and 196 transitions.
[2024-06-03 21:40:06,427 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 260 transitions, 3269 flow
[2024-06-03 21:40:06,642 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 260 transitions, 3196 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-03 21:40:06,645 INFO  L231             Difference]: Finished difference. Result has 182 places, 211 transitions, 2569 flow
[2024-06-03 21:40:06,645 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2569, PETRI_PLACES=182, PETRI_TRANSITIONS=211}
[2024-06-03 21:40:06,646 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-03 21:40:06,646 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 211 transitions, 2569 flow
[2024-06-03 21:40:06,646 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:40:06,646 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:40:06,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:40:06,646 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-03 21:40:06,646 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-03 21:40:06,647 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:40:06,647 INFO  L85        PathProgramCache]: Analyzing trace with hash 840648814, now seen corresponding path program 7 times
[2024-06-03 21:40:06,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:40:06,647 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810358572]
[2024-06-03 21:40:06,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:40:06,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:40:06,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:40:14,661 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:40:14,661 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:40:14,661 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810358572]
[2024-06-03 21:40:14,661 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810358572] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:40:14,661 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:40:14,662 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:40:14,662 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219159711]
[2024-06-03 21:40:14,662 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:40:14,662 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:40:14,665 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:40:14,666 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:40:14,666 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:40:14,903 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:40:14,904 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 211 transitions, 2569 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 21:40:14,904 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:40:14,904 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:40:14,904 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:40:17,022 INFO  L124   PetriNetUnfolderBase]: 3290/5128 cut-off events.
[2024-06-03 21:40:17,023 INFO  L125   PetriNetUnfolderBase]: For 269066/269078 co-relation queries the response was YES.
[2024-06-03 21:40:17,050 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36634 conditions, 5128 events. 3290/5128 cut-off events. For 269066/269078 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 28538 event pairs, 746 based on Foata normal form. 25/5146 useless extension candidates. Maximal degree in co-relation 36551. Up to 4525 conditions per place. 
[2024-06-03 21:40:17,068 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 171 selfloop transitions, 67 changer transitions 0/250 dead transitions.
[2024-06-03 21:40:17,068 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 250 transitions, 3223 flow
[2024-06-03 21:40:17,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:40:17,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:40:17,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-03 21:40:17,071 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43386243386243384
[2024-06-03 21:40:17,071 INFO  L175             Difference]: Start difference. First operand has 182 places, 211 transitions, 2569 flow. Second operand 9 states and 164 transitions.
[2024-06-03 21:40:17,072 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 250 transitions, 3223 flow
[2024-06-03 21:40:17,332 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 250 transitions, 3108 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-03 21:40:17,335 INFO  L231             Difference]: Finished difference. Result has 185 places, 214 transitions, 2674 flow
[2024-06-03 21:40:17,335 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2456, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2674, PETRI_PLACES=185, PETRI_TRANSITIONS=214}
[2024-06-03 21:40:17,335 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places.
[2024-06-03 21:40:17,335 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 214 transitions, 2674 flow
[2024-06-03 21:40:17,336 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 21:40:17,336 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:40:17,336 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:40:17,336 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-03 21:40:17,336 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:40:17,336 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:40:17,336 INFO  L85        PathProgramCache]: Analyzing trace with hash 1861409572, now seen corresponding path program 8 times
[2024-06-03 21:40:17,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:40:17,337 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171373106]
[2024-06-03 21:40:17,337 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:40:17,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:40:17,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:40:28,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:40:28,003 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:40:28,003 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171373106]
[2024-06-03 21:40:28,003 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171373106] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:40:28,003 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:40:28,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:40:28,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002851068]
[2024-06-03 21:40:28,004 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:40:28,004 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:40:28,004 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:40:28,005 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:40:28,005 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:40:28,212 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:40:28,213 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 214 transitions, 2674 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:40:28,213 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:40:28,213 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:40:28,213 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:40:30,453 INFO  L124   PetriNetUnfolderBase]: 3332/5200 cut-off events.
[2024-06-03 21:40:30,453 INFO  L125   PetriNetUnfolderBase]: For 273386/273395 co-relation queries the response was YES.
[2024-06-03 21:40:30,481 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37017 conditions, 5200 events. 3332/5200 cut-off events. For 273386/273395 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 29073 event pairs, 733 based on Foata normal form. 26/5221 useless extension candidates. Maximal degree in co-relation 36932. Up to 4384 conditions per place. 
[2024-06-03 21:40:30,575 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 159 selfloop transitions, 94 changer transitions 0/265 dead transitions.
[2024-06-03 21:40:30,575 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 265 transitions, 3384 flow
[2024-06-03 21:40:30,577 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 21:40:30,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 21:40:30,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions.
[2024-06-03 21:40:30,578 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4329004329004329
[2024-06-03 21:40:30,578 INFO  L175             Difference]: Start difference. First operand has 185 places, 214 transitions, 2674 flow. Second operand 11 states and 200 transitions.
[2024-06-03 21:40:30,578 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 265 transitions, 3384 flow
[2024-06-03 21:40:30,800 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 265 transitions, 3226 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-03 21:40:30,804 INFO  L231             Difference]: Finished difference. Result has 189 places, 217 transitions, 2784 flow
[2024-06-03 21:40:30,804 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2516, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2784, PETRI_PLACES=189, PETRI_TRANSITIONS=217}
[2024-06-03 21:40:30,804 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 146 predicate places.
[2024-06-03 21:40:30,804 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 217 transitions, 2784 flow
[2024-06-03 21:40:30,804 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:40:30,804 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:40:30,805 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:40:30,805 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-03 21:40:30,805 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-03 21:40:30,805 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:40:30,805 INFO  L85        PathProgramCache]: Analyzing trace with hash 1866771952, now seen corresponding path program 9 times
[2024-06-03 21:40:30,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:40:30,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334596163]
[2024-06-03 21:40:30,806 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:40:30,806 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:40:30,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:40:41,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:40:41,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:40:41,464 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334596163]
[2024-06-03 21:40:41,464 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334596163] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:40:41,464 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:40:41,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:40:41,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058794522]
[2024-06-03 21:40:41,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:40:41,469 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:40:41,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:40:41,469 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:40:41,470 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:40:41,669 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:40:41,669 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 217 transitions, 2784 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:40:41,669 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:40:41,669 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:40:41,669 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:40:44,069 INFO  L124   PetriNetUnfolderBase]: 3407/5325 cut-off events.
[2024-06-03 21:40:44,069 INFO  L125   PetriNetUnfolderBase]: For 286557/286566 co-relation queries the response was YES.
[2024-06-03 21:40:44,096 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38042 conditions, 5325 events. 3407/5325 cut-off events. For 286557/286566 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 29958 event pairs, 762 based on Foata normal form. 26/5346 useless extension candidates. Maximal degree in co-relation 37956. Up to 4389 conditions per place. 
[2024-06-03 21:40:44,116 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 166 selfloop transitions, 89 changer transitions 0/267 dead transitions.
[2024-06-03 21:40:44,116 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 267 transitions, 3491 flow
[2024-06-03 21:40:44,118 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 21:40:44,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 21:40:44,119 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions.
[2024-06-03 21:40:44,119 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43506493506493504
[2024-06-03 21:40:44,119 INFO  L175             Difference]: Start difference. First operand has 189 places, 217 transitions, 2784 flow. Second operand 11 states and 201 transitions.
[2024-06-03 21:40:44,119 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 267 transitions, 3491 flow
[2024-06-03 21:40:44,341 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 267 transitions, 3275 flow, removed 17 selfloop flow, removed 9 redundant places.
[2024-06-03 21:40:44,344 INFO  L231             Difference]: Finished difference. Result has 191 places, 219 transitions, 2819 flow
[2024-06-03 21:40:44,345 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2568, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2819, PETRI_PLACES=191, PETRI_TRANSITIONS=219}
[2024-06-03 21:40:44,345 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places.
[2024-06-03 21:40:44,345 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 219 transitions, 2819 flow
[2024-06-03 21:40:44,345 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:40:44,345 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:40:44,346 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:40:44,346 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-03 21:40:44,346 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-03 21:40:44,346 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:40:44,346 INFO  L85        PathProgramCache]: Analyzing trace with hash 1866981202, now seen corresponding path program 10 times
[2024-06-03 21:40:44,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:40:44,346 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227416189]
[2024-06-03 21:40:44,346 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:40:44,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:40:44,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:40:54,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:40:54,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:40:54,519 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227416189]
[2024-06-03 21:40:54,519 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227416189] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:40:54,520 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:40:54,520 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:40:54,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531262051]
[2024-06-03 21:40:54,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:40:54,520 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:40:54,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:40:54,521 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:40:54,521 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:40:54,733 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:40:54,734 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 219 transitions, 2819 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:40:54,734 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:40:54,734 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:40:54,734 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:40:57,039 INFO  L124   PetriNetUnfolderBase]: 3415/5345 cut-off events.
[2024-06-03 21:40:57,040 INFO  L125   PetriNetUnfolderBase]: For 287715/287724 co-relation queries the response was YES.
[2024-06-03 21:40:57,072 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37914 conditions, 5345 events. 3415/5345 cut-off events. For 287715/287724 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 30151 event pairs, 824 based on Foata normal form. 22/5362 useless extension candidates. Maximal degree in co-relation 37827. Up to 4608 conditions per place. 
[2024-06-03 21:40:57,095 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 209 selfloop transitions, 42 changer transitions 0/263 dead transitions.
[2024-06-03 21:40:57,095 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 263 transitions, 3654 flow
[2024-06-03 21:40:57,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:40:57,097 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:40:57,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions.
[2024-06-03 21:40:57,098 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4238095238095238
[2024-06-03 21:40:57,098 INFO  L175             Difference]: Start difference. First operand has 191 places, 219 transitions, 2819 flow. Second operand 10 states and 178 transitions.
[2024-06-03 21:40:57,098 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 263 transitions, 3654 flow
[2024-06-03 21:40:57,470 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 263 transitions, 3374 flow, removed 21 selfloop flow, removed 11 redundant places.
[2024-06-03 21:40:57,473 INFO  L231             Difference]: Finished difference. Result has 190 places, 220 transitions, 2680 flow
[2024-06-03 21:40:57,474 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2539, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2680, PETRI_PLACES=190, PETRI_TRANSITIONS=220}
[2024-06-03 21:40:57,474 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-03 21:40:57,474 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 220 transitions, 2680 flow
[2024-06-03 21:40:57,474 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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-03 21:40:57,474 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:40:57,474 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:40:57,475 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-03 21:40:57,475 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:40:57,475 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:40:57,475 INFO  L85        PathProgramCache]: Analyzing trace with hash -1784426935, now seen corresponding path program 2 times
[2024-06-03 21:40:57,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:40:57,476 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548317414]
[2024-06-03 21:40:57,476 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:40:57,476 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:40:57,506 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:41:11,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:41:11,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:41:11,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548317414]
[2024-06-03 21:41:11,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548317414] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:41:11,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:41:11,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:41:11,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539812004]
[2024-06-03 21:41:11,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:41:11,904 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:41:11,904 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:41:11,904 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:41:11,904 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:41:12,031 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-03 21:41:12,031 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 220 transitions, 2680 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:41:12,032 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:41:12,032 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-03 21:41:12,032 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:41:14,266 INFO  L124   PetriNetUnfolderBase]: 3527/5459 cut-off events.
[2024-06-03 21:41:14,266 INFO  L125   PetriNetUnfolderBase]: For 281099/281108 co-relation queries the response was YES.
[2024-06-03 21:41:14,295 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38016 conditions, 5459 events. 3527/5459 cut-off events. For 281099/281108 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 30355 event pairs, 899 based on Foata normal form. 7/5461 useless extension candidates. Maximal degree in co-relation 37929. Up to 5407 conditions per place. 
[2024-06-03 21:41:14,314 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 204 selfloop transitions, 27 changer transitions 0/234 dead transitions.
[2024-06-03 21:41:14,314 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 234 transitions, 3298 flow
[2024-06-03 21:41:14,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:41:14,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:41:14,317 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions.
[2024-06-03 21:41:14,319 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.35714285714285715
[2024-06-03 21:41:14,319 INFO  L175             Difference]: Start difference. First operand has 190 places, 220 transitions, 2680 flow. Second operand 7 states and 105 transitions.
[2024-06-03 21:41:14,319 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 234 transitions, 3298 flow
[2024-06-03 21:41:14,576 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 234 transitions, 3080 flow, removed 22 selfloop flow, removed 10 redundant places.
[2024-06-03 21:41:14,579 INFO  L231             Difference]: Finished difference. Result has 187 places, 223 transitions, 2564 flow
[2024-06-03 21:41:14,580 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2462, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2564, PETRI_PLACES=187, PETRI_TRANSITIONS=223}
[2024-06-03 21:41:14,580 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 144 predicate places.
[2024-06-03 21:41:14,580 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 223 transitions, 2564 flow
[2024-06-03 21:41:14,580 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:41:14,580 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:41:14,581 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:41:14,581 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-03 21:41:14,581 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:41:14,581 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:41:14,581 INFO  L85        PathProgramCache]: Analyzing trace with hash -1784842645, now seen corresponding path program 3 times
[2024-06-03 21:41:14,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:41:14,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941714318]
[2024-06-03 21:41:14,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:41:14,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:41:14,614 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:41:29,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:41:29,410 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:41:29,410 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941714318]
[2024-06-03 21:41:29,410 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941714318] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:41:29,410 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:41:29,410 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:41:29,410 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028841937]
[2024-06-03 21:41:29,411 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:41:29,411 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:41:29,411 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:41:29,412 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:41:29,412 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:41:29,562 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-03 21:41:29,562 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 223 transitions, 2564 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:41:29,562 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:41:29,562 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-03 21:41:29,562 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:41:31,559 INFO  L124   PetriNetUnfolderBase]: 3524/5455 cut-off events.
[2024-06-03 21:41:31,559 INFO  L125   PetriNetUnfolderBase]: For 283381/283390 co-relation queries the response was YES.
[2024-06-03 21:41:31,585 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37193 conditions, 5455 events. 3524/5455 cut-off events. For 283381/283390 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 30325 event pairs, 899 based on Foata normal form. 7/5457 useless extension candidates. Maximal degree in co-relation 37107. Up to 5404 conditions per place. 
[2024-06-03 21:41:31,601 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 204 selfloop transitions, 26 changer transitions 0/233 dead transitions.
[2024-06-03 21:41:31,602 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 233 transitions, 3048 flow
[2024-06-03 21:41:31,602 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:41:31,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:41:31,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions.
[2024-06-03 21:41:31,602 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.35714285714285715
[2024-06-03 21:41:31,603 INFO  L175             Difference]: Start difference. First operand has 187 places, 223 transitions, 2564 flow. Second operand 7 states and 105 transitions.
[2024-06-03 21:41:31,603 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 233 transitions, 3048 flow
[2024-06-03 21:41:31,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 233 transitions, 2950 flow, removed 30 selfloop flow, removed 4 redundant places.
[2024-06-03 21:41:31,805 INFO  L231             Difference]: Finished difference. Result has 190 places, 223 transitions, 2524 flow
[2024-06-03 21:41:31,806 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2466, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2524, PETRI_PLACES=190, PETRI_TRANSITIONS=223}
[2024-06-03 21:41:31,806 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-03 21:41:31,806 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 223 transitions, 2524 flow
[2024-06-03 21:41:31,806 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:41:31,806 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:41:31,807 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:41:31,807 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-03 21:41:31,807 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:41:31,807 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:41:31,807 INFO  L85        PathProgramCache]: Analyzing trace with hash -1784843017, now seen corresponding path program 3 times
[2024-06-03 21:41:31,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:41:31,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106158171]
[2024-06-03 21:41:31,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:41:31,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:41:31,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:41:46,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:41:46,490 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:41:46,490 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106158171]
[2024-06-03 21:41:46,490 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106158171] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:41:46,490 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:41:46,490 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:41:46,490 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183614442]
[2024-06-03 21:41:46,490 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:41:46,490 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:41:46,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:41:46,491 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:41:46,491 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:41:46,615 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-03 21:41:46,615 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 223 transitions, 2524 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:41:46,615 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:41:46,615 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-03 21:41:46,615 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:41:48,777 INFO  L124   PetriNetUnfolderBase]: 3518/5447 cut-off events.
[2024-06-03 21:41:48,778 INFO  L125   PetriNetUnfolderBase]: For 292646/292655 co-relation queries the response was YES.
[2024-06-03 21:41:48,805 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37248 conditions, 5447 events. 3518/5447 cut-off events. For 292646/292655 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 30316 event pairs, 898 based on Foata normal form. 8/5450 useless extension candidates. Maximal degree in co-relation 37161. Up to 5358 conditions per place. 
[2024-06-03 21:41:48,823 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 210 selfloop transitions, 30 changer transitions 0/243 dead transitions.
[2024-06-03 21:41:48,823 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 243 transitions, 3056 flow
[2024-06-03 21:41:48,825 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:41:48,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:41:48,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions.
[2024-06-03 21:41:48,826 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3544973544973545
[2024-06-03 21:41:48,826 INFO  L175             Difference]: Start difference. First operand has 190 places, 223 transitions, 2524 flow. Second operand 9 states and 134 transitions.
[2024-06-03 21:41:48,826 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 243 transitions, 3056 flow
[2024-06-03 21:41:49,121 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 243 transitions, 2992 flow, removed 7 selfloop flow, removed 5 redundant places.
[2024-06-03 21:41:49,124 INFO  L231             Difference]: Finished difference. Result has 194 places, 223 transitions, 2526 flow
[2024-06-03 21:41:49,124 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2460, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2526, PETRI_PLACES=194, PETRI_TRANSITIONS=223}
[2024-06-03 21:41:49,124 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-03 21:41:49,125 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 223 transitions, 2526 flow
[2024-06-03 21:41:49,125 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:41:49,125 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:41:49,125 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:41:49,125 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-03 21:41:49,125 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:41:49,125 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:41:49,126 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961909809, now seen corresponding path program 1 times
[2024-06-03 21:41:49,126 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:41:49,126 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150163395]
[2024-06-03 21:41:49,126 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:41:49,126 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:41:49,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:42:01,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:42:01,830 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:42:01,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150163395]
[2024-06-03 21:42:01,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150163395] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:42:01,830 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:42:01,830 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:42:01,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664559370]
[2024-06-03 21:42:01,830 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:42:01,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:42:01,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:42:01,831 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:42:01,831 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:42:02,005 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:42:02,006 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 223 transitions, 2526 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 21:42:02,006 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:42:02,006 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:42:02,006 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:42:03,933 INFO  L124   PetriNetUnfolderBase]: 3352/5276 cut-off events.
[2024-06-03 21:42:03,934 INFO  L125   PetriNetUnfolderBase]: For 263260/263260 co-relation queries the response was YES.
[2024-06-03 21:42:03,964 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35182 conditions, 5276 events. 3352/5276 cut-off events. For 263260/263260 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 30116 event pairs, 810 based on Foata normal form. 1/5265 useless extension candidates. Maximal degree in co-relation 35094. Up to 5160 conditions per place. 
[2024-06-03 21:42:03,982 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 220 selfloop transitions, 14 changer transitions 0/242 dead transitions.
[2024-06-03 21:42:03,982 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 242 transitions, 3084 flow
[2024-06-03 21:42:03,983 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:42:03,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:42:03,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-03 21:42:03,983 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3843537414965986
[2024-06-03 21:42:03,983 INFO  L175             Difference]: Start difference. First operand has 194 places, 223 transitions, 2526 flow. Second operand 7 states and 113 transitions.
[2024-06-03 21:42:03,983 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 242 transitions, 3084 flow
[2024-06-03 21:42:04,309 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 242 transitions, 3012 flow, removed 3 selfloop flow, removed 8 redundant places.
[2024-06-03 21:42:04,325 INFO  L231             Difference]: Finished difference. Result has 193 places, 226 transitions, 2544 flow
[2024-06-03 21:42:04,327 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2454, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2544, PETRI_PLACES=193, PETRI_TRANSITIONS=226}
[2024-06-03 21:42:04,327 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places.
[2024-06-03 21:42:04,328 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 226 transitions, 2544 flow
[2024-06-03 21:42:04,328 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 21:42:04,328 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:42:04,328 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:42:04,328 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-03 21:42:04,328 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:42:04,329 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:42:04,329 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961789839, now seen corresponding path program 2 times
[2024-06-03 21:42:04,329 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:42:04,329 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450769680]
[2024-06-03 21:42:04,329 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:42:04,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:42:04,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:42:16,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:42:16,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:42:16,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450769680]
[2024-06-03 21:42:16,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450769680] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:42:16,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:42:16,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:42:16,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971520527]
[2024-06-03 21:42:16,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:42:16,965 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:42:16,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:42:16,966 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:42:16,966 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:42:17,121 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:42:17,122 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 226 transitions, 2544 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 21:42:17,122 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:42:17,122 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:42:17,122 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:42:19,064 INFO  L124   PetriNetUnfolderBase]: 3357/5283 cut-off events.
[2024-06-03 21:42:19,064 INFO  L125   PetriNetUnfolderBase]: For 272586/272586 co-relation queries the response was YES.
[2024-06-03 21:42:19,090 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35653 conditions, 5283 events. 3357/5283 cut-off events. For 272586/272586 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 30113 event pairs, 811 based on Foata normal form. 1/5272 useless extension candidates. Maximal degree in co-relation 35564. Up to 5151 conditions per place. 
[2024-06-03 21:42:19,107 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 212 selfloop transitions, 26 changer transitions 0/246 dead transitions.
[2024-06-03 21:42:19,107 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 246 transitions, 3262 flow
[2024-06-03 21:42:19,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:42:19,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:42:19,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-03 21:42:19,108 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.391156462585034
[2024-06-03 21:42:19,108 INFO  L175             Difference]: Start difference. First operand has 193 places, 226 transitions, 2544 flow. Second operand 7 states and 115 transitions.
[2024-06-03 21:42:19,108 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 246 transitions, 3262 flow
[2024-06-03 21:42:19,363 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 246 transitions, 3194 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-03 21:42:19,366 INFO  L231             Difference]: Finished difference. Result has 195 places, 232 transitions, 2652 flow
[2024-06-03 21:42:19,366 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2476, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2652, PETRI_PLACES=195, PETRI_TRANSITIONS=232}
[2024-06-03 21:42:19,366 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 152 predicate places.
[2024-06-03 21:42:19,366 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 232 transitions, 2652 flow
[2024-06-03 21:42:19,367 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 21:42:19,367 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:42:19,367 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:42:19,367 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-03 21:42:19,367 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:42:19,367 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:42:19,367 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961789653, now seen corresponding path program 1 times
[2024-06-03 21:42:19,368 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:42:19,368 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90700772]
[2024-06-03 21:42:19,368 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:42:19,368 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:42:19,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:42:31,396 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:42:31,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:42:31,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90700772]
[2024-06-03 21:42:31,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90700772] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:42:31,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:42:31,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:42:31,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919572525]
[2024-06-03 21:42:31,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:42:31,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:42:31,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:42:31,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:42:31,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:42:31,559 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:42:31,560 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 232 transitions, 2652 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 21:42:31,560 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:42:31,560 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:42:31,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:42:33,413 INFO  L124   PetriNetUnfolderBase]: 3367/5299 cut-off events.
[2024-06-03 21:42:33,414 INFO  L125   PetriNetUnfolderBase]: For 285095/285095 co-relation queries the response was YES.
[2024-06-03 21:42:33,442 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36182 conditions, 5299 events. 3367/5299 cut-off events. For 285095/285095 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 30243 event pairs, 812 based on Foata normal form. 2/5289 useless extension candidates. Maximal degree in co-relation 36092. Up to 5157 conditions per place. 
[2024-06-03 21:42:33,459 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 222 selfloop transitions, 25 changer transitions 0/255 dead transitions.
[2024-06-03 21:42:33,460 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 255 transitions, 3352 flow
[2024-06-03 21:42:33,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:42:33,460 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:42:33,461 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-03 21:42:33,461 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4013605442176871
[2024-06-03 21:42:33,461 INFO  L175             Difference]: Start difference. First operand has 195 places, 232 transitions, 2652 flow. Second operand 7 states and 118 transitions.
[2024-06-03 21:42:33,461 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 255 transitions, 3352 flow
[2024-06-03 21:42:33,865 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 255 transitions, 3282 flow, removed 27 selfloop flow, removed 3 redundant places.
[2024-06-03 21:42:33,868 INFO  L231             Difference]: Finished difference. Result has 199 places, 238 transitions, 2712 flow
[2024-06-03 21:42:33,868 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2582, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2712, PETRI_PLACES=199, PETRI_TRANSITIONS=238}
[2024-06-03 21:42:33,868 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places.
[2024-06-03 21:42:33,868 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 238 transitions, 2712 flow
[2024-06-03 21:42:33,869 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 21:42:33,869 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:42:33,869 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:42:33,869 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-03 21:42:33,869 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:42:33,869 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:42:33,869 INFO  L85        PathProgramCache]: Analyzing trace with hash 1730626151, now seen corresponding path program 2 times
[2024-06-03 21:42:33,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:42:33,870 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374565982]
[2024-06-03 21:42:33,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:42:33,870 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:42:33,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:42:45,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:42:45,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:42:45,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374565982]
[2024-06-03 21:42:45,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374565982] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:42:45,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:42:45,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:42:45,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680918011]
[2024-06-03 21:42:45,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:42:45,713 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:42:45,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:42:45,727 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:42:45,727 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:42:45,926 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:42:45,926 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 238 transitions, 2712 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 21:42:45,926 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:42:45,926 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:42:45,926 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:42:47,841 INFO  L124   PetriNetUnfolderBase]: 3377/5315 cut-off events.
[2024-06-03 21:42:47,842 INFO  L125   PetriNetUnfolderBase]: For 295805/295805 co-relation queries the response was YES.
[2024-06-03 21:42:47,873 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36802 conditions, 5315 events. 3377/5315 cut-off events. For 295805/295805 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 30373 event pairs, 809 based on Foata normal form. 2/5305 useless extension candidates. Maximal degree in co-relation 36710. Up to 5197 conditions per place. 
[2024-06-03 21:42:47,893 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 229 selfloop transitions, 16 changer transitions 0/253 dead transitions.
[2024-06-03 21:42:47,893 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 253 transitions, 3270 flow
[2024-06-03 21:42:47,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:42:47,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:42:47,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-03 21:42:47,894 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3707482993197279
[2024-06-03 21:42:47,894 INFO  L175             Difference]: Start difference. First operand has 199 places, 238 transitions, 2712 flow. Second operand 7 states and 109 transitions.
[2024-06-03 21:42:47,894 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 253 transitions, 3270 flow
[2024-06-03 21:42:48,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 253 transitions, 3218 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-06-03 21:42:48,194 INFO  L231             Difference]: Finished difference. Result has 203 places, 241 transitions, 2745 flow
[2024-06-03 21:42:48,194 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2664, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2745, PETRI_PLACES=203, PETRI_TRANSITIONS=241}
[2024-06-03 21:42:48,195 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places.
[2024-06-03 21:42:48,196 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 241 transitions, 2745 flow
[2024-06-03 21:42:48,201 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 21:42:48,201 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:42:48,201 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:42:48,201 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-03 21:42:48,201 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:42:48,202 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:42:48,202 INFO  L85        PathProgramCache]: Analyzing trace with hash -1784658133, now seen corresponding path program 3 times
[2024-06-03 21:42:48,202 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:42:48,202 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000222910]
[2024-06-03 21:42:48,202 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:42:48,202 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:42:48,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:43:00,229 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:43:00,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:43:00,230 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000222910]
[2024-06-03 21:43:00,230 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000222910] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:43:00,230 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:43:00,230 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:43:00,230 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544195067]
[2024-06-03 21:43:00,230 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:43:00,230 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:43:00,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:43:00,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:43:00,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:43:00,456 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:43:00,457 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 241 transitions, 2745 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 21:43:00,457 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:43:00,457 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:43:00,457 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:43:02,305 INFO  L124   PetriNetUnfolderBase]: 3371/5307 cut-off events.
[2024-06-03 21:43:02,305 INFO  L125   PetriNetUnfolderBase]: For 302913/302913 co-relation queries the response was YES.
[2024-06-03 21:43:02,335 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36844 conditions, 5307 events. 3371/5307 cut-off events. For 302913/302913 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 30300 event pairs, 808 based on Foata normal form. 2/5297 useless extension candidates. Maximal degree in co-relation 36750. Up to 5180 conditions per place. 
[2024-06-03 21:43:02,351 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 225 selfloop transitions, 21 changer transitions 0/254 dead transitions.
[2024-06-03 21:43:02,352 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 254 transitions, 3267 flow
[2024-06-03 21:43:02,352 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:43:02,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:43:02,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-03 21:43:02,353 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38095238095238093
[2024-06-03 21:43:02,353 INFO  L175             Difference]: Start difference. First operand has 203 places, 241 transitions, 2745 flow. Second operand 7 states and 112 transitions.
[2024-06-03 21:43:02,353 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 254 transitions, 3267 flow
[2024-06-03 21:43:02,672 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 254 transitions, 3202 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-03 21:43:02,675 INFO  L231             Difference]: Finished difference. Result has 205 places, 241 transitions, 2728 flow
[2024-06-03 21:43:02,675 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2680, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2728, PETRI_PLACES=205, PETRI_TRANSITIONS=241}
[2024-06-03 21:43:02,676 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places.
[2024-06-03 21:43:02,676 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 241 transitions, 2728 flow
[2024-06-03 21:43:02,676 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 21:43:02,676 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:43:02,676 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:43:02,676 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-03 21:43:02,677 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:43:02,677 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:43:02,677 INFO  L85        PathProgramCache]: Analyzing trace with hash -1784658319, now seen corresponding path program 3 times
[2024-06-03 21:43:02,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:43:02,677 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827558234]
[2024-06-03 21:43:02,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:43:02,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:43:02,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:43:14,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:43:14,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:43:14,158 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827558234]
[2024-06-03 21:43:14,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827558234] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:43:14,158 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:43:14,158 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:43:14,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005015915]
[2024-06-03 21:43:14,159 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:43:14,159 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:43:14,159 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:43:14,159 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:43:14,159 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:43:14,321 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:43:14,321 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 241 transitions, 2728 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 21:43:14,321 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:43:14,321 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:43:14,321 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:43:16,143 INFO  L124   PetriNetUnfolderBase]: 3368/5303 cut-off events.
[2024-06-03 21:43:16,143 INFO  L125   PetriNetUnfolderBase]: For 309676/309676 co-relation queries the response was YES.
[2024-06-03 21:43:16,172 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36912 conditions, 5303 events. 3368/5303 cut-off events. For 309676/309676 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 30392 event pairs, 808 based on Foata normal form. 1/5292 useless extension candidates. Maximal degree in co-relation 36817. Up to 5195 conditions per place. 
[2024-06-03 21:43:16,189 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 229 selfloop transitions, 14 changer transitions 0/251 dead transitions.
[2024-06-03 21:43:16,189 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 251 transitions, 3238 flow
[2024-06-03 21:43:16,190 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:43:16,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:43:16,190 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions.
[2024-06-03 21:43:16,190 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36394557823129253
[2024-06-03 21:43:16,190 INFO  L175             Difference]: Start difference. First operand has 205 places, 241 transitions, 2728 flow. Second operand 7 states and 107 transitions.
[2024-06-03 21:43:16,190 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 251 transitions, 3238 flow
[2024-06-03 21:43:16,518 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 251 transitions, 3131 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-03 21:43:16,521 INFO  L231             Difference]: Finished difference. Result has 206 places, 241 transitions, 2655 flow
[2024-06-03 21:43:16,521 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2621, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2655, PETRI_PLACES=206, PETRI_TRANSITIONS=241}
[2024-06-03 21:43:16,521 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 163 predicate places.
[2024-06-03 21:43:16,521 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 241 transitions, 2655 flow
[2024-06-03 21:43:16,521 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-03 21:43:16,521 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:43:16,522 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:43:16,522 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-03 21:43:16,522 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:43:16,522 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:43:16,522 INFO  L85        PathProgramCache]: Analyzing trace with hash -1102431609, now seen corresponding path program 1 times
[2024-06-03 21:43:16,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:43:16,522 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724137148]
[2024-06-03 21:43:16,522 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:43:16,523 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:43:16,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:43:25,856 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:43:25,856 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:43:25,856 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724137148]
[2024-06-03 21:43:25,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724137148] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:43:25,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:43:25,857 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:43:25,857 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895186469]
[2024-06-03 21:43:25,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:43:25,857 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:43:25,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:43:25,858 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:43:25,858 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:43:26,000 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:43:26,000 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 241 transitions, 2655 flow. Second operand  has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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-03 21:43:26,000 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:43:26,001 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:43:26,001 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:43:28,420 INFO  L124   PetriNetUnfolderBase]: 3602/5639 cut-off events.
[2024-06-03 21:43:28,420 INFO  L125   PetriNetUnfolderBase]: For 383686/383689 co-relation queries the response was YES.
[2024-06-03 21:43:28,449 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40525 conditions, 5639 events. 3602/5639 cut-off events. For 383686/383689 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 32096 event pairs, 859 based on Foata normal form. 14/5648 useless extension candidates. Maximal degree in co-relation 40429. Up to 5305 conditions per place. 
[2024-06-03 21:43:28,468 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 265 selfloop transitions, 30 changer transitions 0/310 dead transitions.
[2024-06-03 21:43:28,468 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 310 transitions, 3630 flow
[2024-06-03 21:43:28,471 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-03 21:43:28,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-03 21:43:28,471 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 195 transitions.
[2024-06-03 21:43:28,471 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3869047619047619
[2024-06-03 21:43:28,471 INFO  L175             Difference]: Start difference. First operand has 206 places, 241 transitions, 2655 flow. Second operand 12 states and 195 transitions.
[2024-06-03 21:43:28,471 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 310 transitions, 3630 flow
[2024-06-03 21:43:28,718 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 310 transitions, 3584 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-03 21:43:28,722 INFO  L231             Difference]: Finished difference. Result has 217 places, 264 transitions, 2977 flow
[2024-06-03 21:43:28,722 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2611, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2977, PETRI_PLACES=217, PETRI_TRANSITIONS=264}
[2024-06-03 21:43:28,723 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places.
[2024-06-03 21:43:28,723 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 264 transitions, 2977 flow
[2024-06-03 21:43:28,723 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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-03 21:43:28,723 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:43:28,723 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:43:28,723 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-03 21:43:28,723 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:43:28,726 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:43:28,726 INFO  L85        PathProgramCache]: Analyzing trace with hash -1575050577, now seen corresponding path program 2 times
[2024-06-03 21:43:28,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:43:28,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067783058]
[2024-06-03 21:43:28,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:43:28,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:43:28,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:43:38,750 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:43:38,750 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:43:38,750 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067783058]
[2024-06-03 21:43:38,750 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067783058] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:43:38,750 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:43:38,750 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-03 21:43:38,750 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285548444]
[2024-06-03 21:43:38,750 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:43:38,751 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-03 21:43:38,751 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:43:38,751 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-03 21:43:38,751 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-06-03 21:43:38,963 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:43:38,963 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 264 transitions, 2977 flow. Second operand  has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 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-03 21:43:38,963 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:43:38,963 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:43:38,963 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:43:41,499 INFO  L124   PetriNetUnfolderBase]: 3783/5933 cut-off events.
[2024-06-03 21:43:41,499 INFO  L125   PetriNetUnfolderBase]: For 404741/404743 co-relation queries the response was YES.
[2024-06-03 21:43:41,532 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42831 conditions, 5933 events. 3783/5933 cut-off events. For 404741/404743 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 34195 event pairs, 876 based on Foata normal form. 14/5944 useless extension candidates. Maximal degree in co-relation 42729. Up to 5528 conditions per place. 
[2024-06-03 21:43:41,551 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 276 selfloop transitions, 42 changer transitions 0/333 dead transitions.
[2024-06-03 21:43:41,551 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 333 transitions, 4054 flow
[2024-06-03 21:43:41,552 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 21:43:41,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 21:43:41,552 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions.
[2024-06-03 21:43:41,553 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4004329004329004
[2024-06-03 21:43:41,553 INFO  L175             Difference]: Start difference. First operand has 217 places, 264 transitions, 2977 flow. Second operand 11 states and 185 transitions.
[2024-06-03 21:43:41,553 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 333 transitions, 4054 flow
[2024-06-03 21:43:41,900 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 333 transitions, 3952 flow, removed 50 selfloop flow, removed 1 redundant places.
[2024-06-03 21:43:41,903 INFO  L231             Difference]: Finished difference. Result has 232 places, 288 transitions, 3363 flow
[2024-06-03 21:43:41,904 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2925, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3363, PETRI_PLACES=232, PETRI_TRANSITIONS=288}
[2024-06-03 21:43:41,904 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 189 predicate places.
[2024-06-03 21:43:41,904 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 288 transitions, 3363 flow
[2024-06-03 21:43:41,904 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 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-03 21:43:41,904 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:43:41,904 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:43:41,904 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-03 21:43:41,905 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:43:41,905 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:43:41,905 INFO  L85        PathProgramCache]: Analyzing trace with hash 618708607, now seen corresponding path program 3 times
[2024-06-03 21:43:41,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:43:41,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629476651]
[2024-06-03 21:43:41,905 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:43:41,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:43:41,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:43:51,273 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:43:51,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:43:51,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629476651]
[2024-06-03 21:43:51,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629476651] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:43:51,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:43:51,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:43:51,274 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968159974]
[2024-06-03 21:43:51,274 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:43:51,274 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:43:51,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:43:51,274 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:43:51,275 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:43:51,451 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:43:51,451 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 288 transitions, 3363 flow. Second operand  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:43:51,451 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:43:51,451 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:43:51,451 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:43:53,949 INFO  L124   PetriNetUnfolderBase]: 3838/6023 cut-off events.
[2024-06-03 21:43:53,949 INFO  L125   PetriNetUnfolderBase]: For 422391/422393 co-relation queries the response was YES.
[2024-06-03 21:43:53,988 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43260 conditions, 6023 events. 3838/6023 cut-off events. For 422391/422393 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 34878 event pairs, 859 based on Foata normal form. 26/6046 useless extension candidates. Maximal degree in co-relation 43150. Up to 5387 conditions per place. 
[2024-06-03 21:43:54,009 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 249 selfloop transitions, 70 changer transitions 0/334 dead transitions.
[2024-06-03 21:43:54,009 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 334 transitions, 4201 flow
[2024-06-03 21:43:54,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:43:54,011 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:43:54,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions.
[2024-06-03 21:43:54,012 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4142857142857143
[2024-06-03 21:43:54,012 INFO  L175             Difference]: Start difference. First operand has 232 places, 288 transitions, 3363 flow. Second operand 10 states and 174 transitions.
[2024-06-03 21:43:54,012 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 334 transitions, 4201 flow
[2024-06-03 21:43:54,505 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 334 transitions, 4106 flow, removed 38 selfloop flow, removed 3 redundant places.
[2024-06-03 21:43:54,509 INFO  L231             Difference]: Finished difference. Result has 240 places, 293 transitions, 3514 flow
[2024-06-03 21:43:54,510 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3268, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3514, PETRI_PLACES=240, PETRI_TRANSITIONS=293}
[2024-06-03 21:43:54,510 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places.
[2024-06-03 21:43:54,510 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 293 transitions, 3514 flow
[2024-06-03 21:43:54,510 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:43:54,510 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:43:54,510 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:43:54,510 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-03 21:43:54,511 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:43:54,511 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:43:54,511 INFO  L85        PathProgramCache]: Analyzing trace with hash -1099750419, now seen corresponding path program 4 times
[2024-06-03 21:43:54,511 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:43:54,511 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078474715]
[2024-06-03 21:43:54,511 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:43:54,511 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:43:54,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:44:04,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:44:04,665 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:44:04,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078474715]
[2024-06-03 21:44:04,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078474715] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:44:04,666 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:44:04,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-03 21:44:04,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202065192]
[2024-06-03 21:44:04,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:44:04,666 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-03 21:44:04,666 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:44:04,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-03 21:44:04,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132
[2024-06-03 21:44:04,963 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:44:04,964 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 293 transitions, 3514 flow. Second operand  has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 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-03 21:44:04,964 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:44:04,964 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:44:04,964 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:44:07,877 INFO  L124   PetriNetUnfolderBase]: 3879/6094 cut-off events.
[2024-06-03 21:44:07,877 INFO  L125   PetriNetUnfolderBase]: For 422556/422558 co-relation queries the response was YES.
[2024-06-03 21:44:07,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43993 conditions, 6094 events. 3879/6094 cut-off events. For 422556/422558 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 35437 event pairs, 894 based on Foata normal form. 14/6105 useless extension candidates. Maximal degree in co-relation 43880. Up to 5622 conditions per place. 
[2024-06-03 21:44:07,935 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 268 selfloop transitions, 55 changer transitions 0/338 dead transitions.
[2024-06-03 21:44:07,936 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 338 transitions, 4372 flow
[2024-06-03 21:44:07,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:44:07,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:44:07,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-03 21:44:07,938 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4119047619047619
[2024-06-03 21:44:07,939 INFO  L175             Difference]: Start difference. First operand has 240 places, 293 transitions, 3514 flow. Second operand 10 states and 173 transitions.
[2024-06-03 21:44:07,939 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 338 transitions, 4372 flow
[2024-06-03 21:44:08,589 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 338 transitions, 4192 flow, removed 28 selfloop flow, removed 7 redundant places.
[2024-06-03 21:44:08,593 INFO  L231             Difference]: Finished difference. Result has 244 places, 296 transitions, 3542 flow
[2024-06-03 21:44:08,593 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3336, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3542, PETRI_PLACES=244, PETRI_TRANSITIONS=296}
[2024-06-03 21:44:08,594 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places.
[2024-06-03 21:44:08,594 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 296 transitions, 3542 flow
[2024-06-03 21:44:08,594 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 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-03 21:44:08,594 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:44:08,594 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:44:08,595 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-03 21:44:08,595 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:44:08,595 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:44:08,595 INFO  L85        PathProgramCache]: Analyzing trace with hash 2107734544, now seen corresponding path program 1 times
[2024-06-03 21:44:08,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:44:08,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030141939]
[2024-06-03 21:44:08,596 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:44:08,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:44:08,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:44:21,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:44:21,170 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:44:21,170 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030141939]
[2024-06-03 21:44:21,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030141939] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:44:21,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:44:21,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:44:21,171 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945538505]
[2024-06-03 21:44:21,171 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:44:21,171 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:44:21,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:44:21,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:44:21,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:44:21,294 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-03 21:44:21,294 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 296 transitions, 3542 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:44:21,294 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:44:21,294 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-03 21:44:21,294 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:44:23,752 INFO  L124   PetriNetUnfolderBase]: 3982/6205 cut-off events.
[2024-06-03 21:44:23,752 INFO  L125   PetriNetUnfolderBase]: For 420890/420892 co-relation queries the response was YES.
[2024-06-03 21:44:23,791 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44612 conditions, 6205 events. 3982/6205 cut-off events. For 420890/420892 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 35675 event pairs, 970 based on Foata normal form. 3/6205 useless extension candidates. Maximal degree in co-relation 44497. Up to 6119 conditions per place. 
[2024-06-03 21:44:23,812 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 287 selfloop transitions, 30 changer transitions 0/320 dead transitions.
[2024-06-03 21:44:23,813 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 320 transitions, 4450 flow
[2024-06-03 21:44:23,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:44:23,815 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:44:23,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-03 21:44:23,815 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3877551020408163
[2024-06-03 21:44:23,815 INFO  L175             Difference]: Start difference. First operand has 244 places, 296 transitions, 3542 flow. Second operand 7 states and 114 transitions.
[2024-06-03 21:44:23,815 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 320 transitions, 4450 flow
[2024-06-03 21:44:24,265 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 320 transitions, 4276 flow, removed 34 selfloop flow, removed 7 redundant places.
[2024-06-03 21:44:24,268 INFO  L231             Difference]: Finished difference. Result has 244 places, 302 transitions, 3548 flow
[2024-06-03 21:44:24,269 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3368, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3548, PETRI_PLACES=244, PETRI_TRANSITIONS=302}
[2024-06-03 21:44:24,269 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places.
[2024-06-03 21:44:24,269 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 302 transitions, 3548 flow
[2024-06-03 21:44:24,269 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:44:24,269 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:44:24,269 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:44:24,269 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-03 21:44:24,270 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:44:24,270 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:44:24,270 INFO  L85        PathProgramCache]: Analyzing trace with hash 133548098, now seen corresponding path program 2 times
[2024-06-03 21:44:24,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:44:24,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151943962]
[2024-06-03 21:44:24,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:44:24,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:44:24,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:44:35,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:44:35,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:44:35,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151943962]
[2024-06-03 21:44:35,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151943962] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:44:35,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:44:35,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:44:35,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743299668]
[2024-06-03 21:44:35,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:44:35,568 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:44:35,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:44:35,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:44:35,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:44:35,697 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-03 21:44:35,697 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 302 transitions, 3548 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:44:35,697 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:44:35,697 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-03 21:44:35,698 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:44:38,007 INFO  L124   PetriNetUnfolderBase]: 3987/6212 cut-off events.
[2024-06-03 21:44:38,007 INFO  L125   PetriNetUnfolderBase]: For 431555/431557 co-relation queries the response was YES.
[2024-06-03 21:44:38,051 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44720 conditions, 6212 events. 3987/6212 cut-off events. For 431555/431557 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 35722 event pairs, 970 based on Foata normal form. 3/6212 useless extension candidates. Maximal degree in co-relation 44604. Up to 6149 conditions per place. 
[2024-06-03 21:44:38,073 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 289 selfloop transitions, 27 changer transitions 0/319 dead transitions.
[2024-06-03 21:44:38,074 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 319 transitions, 4280 flow
[2024-06-03 21:44:38,074 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:44:38,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:44:38,074 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-03 21:44:38,075 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3707482993197279
[2024-06-03 21:44:38,075 INFO  L175             Difference]: Start difference. First operand has 244 places, 302 transitions, 3548 flow. Second operand 7 states and 109 transitions.
[2024-06-03 21:44:38,075 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 319 transitions, 4280 flow
[2024-06-03 21:44:38,777 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 319 transitions, 4155 flow, removed 50 selfloop flow, removed 3 redundant places.
[2024-06-03 21:44:38,781 INFO  L231             Difference]: Finished difference. Result has 248 places, 305 transitions, 3549 flow
[2024-06-03 21:44:38,781 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3449, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3549, PETRI_PLACES=248, PETRI_TRANSITIONS=305}
[2024-06-03 21:44:38,782 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 205 predicate places.
[2024-06-03 21:44:38,782 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 305 transitions, 3549 flow
[2024-06-03 21:44:38,782 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:44:38,782 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:44:38,782 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:44:38,782 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-03 21:44:38,783 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:44:38,783 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:44:38,783 INFO  L85        PathProgramCache]: Analyzing trace with hash -394723951, now seen corresponding path program 5 times
[2024-06-03 21:44:38,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:44:38,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610679914]
[2024-06-03 21:44:38,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:44:38,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:44:38,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:44:48,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:44:48,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:44:48,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610679914]
[2024-06-03 21:44:48,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610679914] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:44:48,795 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:44:48,795 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:44:48,795 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683806161]
[2024-06-03 21:44:48,795 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:44:48,795 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:44:48,795 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:44:48,800 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:44:48,800 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:44:49,068 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-03 21:44:49,068 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 305 transitions, 3549 flow. Second operand  has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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-03 21:44:49,068 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:44:49,068 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-03 21:44:49,069 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:44:52,003 INFO  L124   PetriNetUnfolderBase]: 3938/6190 cut-off events.
[2024-06-03 21:44:52,004 INFO  L125   PetriNetUnfolderBase]: For 463368/463370 co-relation queries the response was YES.
[2024-06-03 21:44:52,044 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45053 conditions, 6190 events. 3938/6190 cut-off events. For 463368/463370 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 36144 event pairs, 868 based on Foata normal form. 14/6201 useless extension candidates. Maximal degree in co-relation 44935. Up to 5480 conditions per place. 
[2024-06-03 21:44:52,066 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 256 selfloop transitions, 75 changer transitions 0/349 dead transitions.
[2024-06-03 21:44:52,066 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 349 transitions, 4417 flow
[2024-06-03 21:44:52,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:44:52,068 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:44:52,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions.
[2024-06-03 21:44:52,069 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4142857142857143
[2024-06-03 21:44:52,069 INFO  L175             Difference]: Start difference. First operand has 248 places, 305 transitions, 3549 flow. Second operand 10 states and 174 transitions.
[2024-06-03 21:44:52,069 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 349 transitions, 4417 flow
[2024-06-03 21:44:52,643 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 349 transitions, 4345 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-03 21:44:52,647 INFO  L231             Difference]: Finished difference. Result has 254 places, 308 transitions, 3740 flow
[2024-06-03 21:44:52,648 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3477, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3740, PETRI_PLACES=254, PETRI_TRANSITIONS=308}
[2024-06-03 21:44:52,648 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 211 predicate places.
[2024-06-03 21:44:52,648 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 308 transitions, 3740 flow
[2024-06-03 21:44:52,648 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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-03 21:44:52,648 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:44:52,649 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:44:52,649 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-03 21:44:52,649 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:44:52,649 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:44:52,649 INFO  L85        PathProgramCache]: Analyzing trace with hash -1897031657, now seen corresponding path program 1 times
[2024-06-03 21:44:52,649 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:44:52,649 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688249453]
[2024-06-03 21:44:52,649 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:44:52,650 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:44:52,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:45:09,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:45:09,097 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:45:09,097 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688249453]
[2024-06-03 21:45:09,097 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688249453] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:45:09,097 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:45:09,097 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:45:09,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975721292]
[2024-06-03 21:45:09,097 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:45:09,097 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:45:09,098 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:45:09,098 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:45:09,098 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:45:09,239 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-03 21:45:09,239 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 308 transitions, 3740 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:45:09,239 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:45:09,240 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-03 21:45:09,240 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:45:11,668 INFO  L124   PetriNetUnfolderBase]: 4038/6294 cut-off events.
[2024-06-03 21:45:11,669 INFO  L125   PetriNetUnfolderBase]: For 466425/466427 co-relation queries the response was YES.
[2024-06-03 21:45:11,715 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46232 conditions, 6294 events. 4038/6294 cut-off events. For 466425/466427 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 36297 event pairs, 979 based on Foata normal form. 4/6295 useless extension candidates. Maximal degree in co-relation 46112. Up to 6086 conditions per place. 
[2024-06-03 21:45:11,739 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 273 selfloop transitions, 63 changer transitions 0/339 dead transitions.
[2024-06-03 21:45:11,739 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 339 transitions, 4676 flow
[2024-06-03 21:45:11,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:45:11,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:45:11,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-03 21:45:11,742 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39880952380952384
[2024-06-03 21:45:11,742 INFO  L175             Difference]: Start difference. First operand has 254 places, 308 transitions, 3740 flow. Second operand 8 states and 134 transitions.
[2024-06-03 21:45:11,742 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 339 transitions, 4676 flow
[2024-06-03 21:45:12,339 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 339 transitions, 4475 flow, removed 40 selfloop flow, removed 6 redundant places.
[2024-06-03 21:45:12,343 INFO  L231             Difference]: Finished difference. Result has 256 places, 314 transitions, 3747 flow
[2024-06-03 21:45:12,344 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3541, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3747, PETRI_PLACES=256, PETRI_TRANSITIONS=314}
[2024-06-03 21:45:12,347 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places.
[2024-06-03 21:45:12,347 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 314 transitions, 3747 flow
[2024-06-03 21:45:12,347 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:45:12,347 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:45:12,347 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:45:12,348 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-03 21:45:12,348 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:45:12,348 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:45:12,348 INFO  L85        PathProgramCache]: Analyzing trace with hash -1887777227, now seen corresponding path program 2 times
[2024-06-03 21:45:12,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:45:12,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595087001]
[2024-06-03 21:45:12,349 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:45:12,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:45:12,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:45:28,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:45:28,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:45:28,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595087001]
[2024-06-03 21:45:28,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595087001] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:45:28,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:45:28,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:45:28,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261545096]
[2024-06-03 21:45:28,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:45:28,283 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:45:28,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:45:28,283 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:45:28,283 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:45:28,478 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-03 21:45:28,478 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 314 transitions, 3747 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:45:28,478 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:45:28,478 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-03 21:45:28,478 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:45:31,014 INFO  L124   PetriNetUnfolderBase]: 4064/6330 cut-off events.
[2024-06-03 21:45:31,014 INFO  L125   PetriNetUnfolderBase]: For 464978/464980 co-relation queries the response was YES.
[2024-06-03 21:45:31,059 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46369 conditions, 6330 events. 4064/6330 cut-off events. For 464978/464980 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 36503 event pairs, 980 based on Foata normal form. 4/6331 useless extension candidates. Maximal degree in co-relation 46248. Up to 6111 conditions per place. 
[2024-06-03 21:45:31,081 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 274 selfloop transitions, 72 changer transitions 0/349 dead transitions.
[2024-06-03 21:45:31,081 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 349 transitions, 4845 flow
[2024-06-03 21:45:31,082 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:45:31,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:45:31,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions.
[2024-06-03 21:45:31,082 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38333333333333336
[2024-06-03 21:45:31,082 INFO  L175             Difference]: Start difference. First operand has 256 places, 314 transitions, 3747 flow. Second operand 10 states and 161 transitions.
[2024-06-03 21:45:31,082 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 349 transitions, 4845 flow
[2024-06-03 21:45:31,608 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 349 transitions, 4753 flow, removed 23 selfloop flow, removed 4 redundant places.
[2024-06-03 21:45:31,612 INFO  L231             Difference]: Finished difference. Result has 262 places, 320 transitions, 3885 flow
[2024-06-03 21:45:31,628 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3667, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3885, PETRI_PLACES=262, PETRI_TRANSITIONS=320}
[2024-06-03 21:45:31,628 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 219 predicate places.
[2024-06-03 21:45:31,628 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 320 transitions, 3885 flow
[2024-06-03 21:45:31,628 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:45:31,629 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:45:31,629 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:45:31,629 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-03 21:45:31,629 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:45:31,630 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:45:31,630 INFO  L85        PathProgramCache]: Analyzing trace with hash -1887765664, now seen corresponding path program 1 times
[2024-06-03 21:45:31,630 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:45:31,630 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17475887]
[2024-06-03 21:45:31,630 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:45:31,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:45:31,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15