./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-04 16:51:43,225 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 16:51:43,310 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 16:51:43,316 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 16:51:43,317 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 16:51:43,343 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 16:51:43,344 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 16:51:43,345 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 16:51:43,345 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 16:51:43,349 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 16:51:43,349 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 16:51:43,350 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 16:51:43,351 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 16:51:43,351 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 16:51:43,352 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 16:51:43,352 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 16:51:43,352 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 16:51:43,353 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 16:51:43,353 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 16:51:43,353 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 16:51:43,353 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 16:51:43,354 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 16:51:43,354 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 16:51:43,354 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 16:51:43,355 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 16:51:43,355 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 16:51:43,355 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 16:51:43,356 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 16:51:43,356 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 16:51:43,356 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 16:51:43,356 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 16:51:43,357 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 16:51:43,357 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 16:51:43,357 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 16:51:43,357 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 16:51:43,358 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 16:51:43,358 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 16:51:43,358 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 16:51:43,358 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 16:51:43,359 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 16:51:43,359 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 16:51:43,359 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 16:51:43,359 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 16:51:43,360 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-04 16:51:43,560 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 16:51:43,586 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 16:51:43,588 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 16:51:43,589 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 16:51:43,590 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 16:51:43,591 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-04 16:51:44,831 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 16:51:45,084 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 16:51:45,085 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i
[2024-06-04 16:51:45,110 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16d8f9f57/b15ae4d7379f417882b08970def8394a/FLAG8f394774f
[2024-06-04 16:51:45,122 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16d8f9f57/b15ae4d7379f417882b08970def8394a
[2024-06-04 16:51:45,124 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 16:51:45,125 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 16:51:45,125 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-04 16:51:45,344 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 16:51:45,345 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 16:51:45,346 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 16:51:45,346 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 16:51:45,351 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 16:51:45,352 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:51:45" (1/2) ...
[2024-06-04 16:51:45,353 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2ea46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:51:45, skipping insertion in model container
[2024-06-04 16:51:45,353 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:51:45" (1/2) ...
[2024-06-04 16:51:45,354 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@16a57395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:51:45, skipping insertion in model container
[2024-06-04 16:51:45,354 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:51:45" (2/2) ...
[2024-06-04 16:51:45,355 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2ea46 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:45, skipping insertion in model container
[2024-06-04 16:51:45,356 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:51:45" (2/2) ...
[2024-06-04 16:51:45,356 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 16:51:45,454 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 16:51:45,456 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-04 16:51:45,457 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-04 16:51:45,458 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-04 16:51:45,458 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 16:51:45,459 INFO  L106   edCorrectnessWitness]: ghost_update [L826-L826] multithreaded = 1;
[2024-06-04 16:51:45,514 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 16:51:45,889 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 16:51:45,899 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-04 16:51:46,241 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 16:51:46,285 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 16:51:46,286 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46 WrapperNode
[2024-06-04 16:51:46,286 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 16:51:46,287 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 16:51:46,288 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 16:51:46,288 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 16:51:46,294 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (1/1) ...
[2024-06-04 16:51:46,350 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (1/1) ...
[2024-06-04 16:51:46,493 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 145
[2024-06-04 16:51:46,494 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 16:51:46,495 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 16:51:46,495 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 16:51:46,495 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 16:51:46,507 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (1/1) ...
[2024-06-04 16:51:46,507 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (1/1) ...
[2024-06-04 16:51:46,535 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (1/1) ...
[2024-06-04 16:51:46,580 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-04 16:51:46,581 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (1/1) ...
[2024-06-04 16:51:46,581 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (1/1) ...
[2024-06-04 16:51:46,617 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (1/1) ...
[2024-06-04 16:51:46,619 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (1/1) ...
[2024-06-04 16:51:46,634 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (1/1) ...
[2024-06-04 16:51:46,641 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (1/1) ...
[2024-06-04 16:51:46,663 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 16:51:46,664 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 16:51:46,664 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 16:51:46,665 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 16:51:46,665 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (1/1) ...
[2024-06-04 16:51:46,671 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 16:51:46,679 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 16:51:46,697 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-04 16:51:46,724 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-04 16:51:46,742 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 16:51:46,742 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 16:51:46,743 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 16:51:46,743 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 16:51:46,743 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 16:51:46,743 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 16:51:46,744 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 16:51:46,744 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 16:51:46,744 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 16:51:46,744 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 16:51:46,744 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 16:51:46,745 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 16:51:46,746 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-04 16:51:46,977 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 16:51:46,980 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 16:51:48,602 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 16:51:48,604 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 16:51:48,979 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 16:51:48,979 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 16:51:48,980 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:51:48 BoogieIcfgContainer
[2024-06-04 16:51:48,981 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 16:51:48,983 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 16:51:48,983 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 16:51:48,986 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 16:51:48,987 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:51:45" (1/4) ...
[2024-06-04 16:51:48,987 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4672f614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:51:48, skipping insertion in model container
[2024-06-04 16:51:48,987 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:51:45" (2/4) ...
[2024-06-04 16:51:48,988 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4672f614 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:51:48, skipping insertion in model container
[2024-06-04 16:51:48,988 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:51:46" (3/4) ...
[2024-06-04 16:51:48,988 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4672f614 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:51:48, skipping insertion in model container
[2024-06-04 16:51:48,989 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:51:48" (4/4) ...
[2024-06-04 16:51:48,990 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i
[2024-06-04 16:51:49,006 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 16:51:49,006 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 16:51:49,006 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 16:51:49,135 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 16:51:49,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-04 16:51:49,262 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-04 16:51:49,263 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 16:51:49,266 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-04 16:51:49,266 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-04 16:51:49,269 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-04 16:51:49,283 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 16:51:49,290 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;@17f78396, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 16:51:49,291 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 16:51:49,301 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 16:51:49,301 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-04 16:51:49,301 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 16:51:49,302 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:51:49,302 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 16:51:49,303 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:51:49,308 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:51:49,309 INFO  L85        PathProgramCache]: Analyzing trace with hash -1277020543, now seen corresponding path program 1 times
[2024-06-04 16:51:49,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:51:49,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412488946]
[2024-06-04 16:51:49,320 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:51:49,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:51:49,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:51:56,884 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:51:56,885 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:51:56,885 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412488946]
[2024-06-04 16:51:56,886 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412488946] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:51:56,886 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:51:56,886 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 16:51:56,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90179834]
[2024-06-04 16:51:56,888 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:51:56,895 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 16:51:56,900 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:51:56,921 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 16:51:56,922 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 16:51:57,010 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 16:51:57,013 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-04 16:51:57,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:51:57,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 16:51:57,014 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:51:58,222 INFO  L124   PetriNetUnfolderBase]: 1156/1874 cut-off events.
[2024-06-04 16:51:58,222 INFO  L125   PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-06-04 16:51:58,230 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-04 16:51:58,240 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-04 16:51:58,241 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 175 flow
[2024-06-04 16:51:58,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 16:51:58,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 16:51:58,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions.
[2024-06-04 16:51:58,252 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5793650793650794
[2024-06-04 16:51:58,254 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 73 transitions.
[2024-06-04 16:51:58,255 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 175 flow
[2024-06-04 16:51:58,257 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 16:51:58,260 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-04 16:51:58,262 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-04 16:51:58,267 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-04 16:51:58,267 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-04 16:51:58,267 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-04 16:51:58,267 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:51:58,268 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:51:58,268 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 16:51:58,268 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:51:58,269 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:51:58,269 INFO  L85        PathProgramCache]: Analyzing trace with hash 1143930976, now seen corresponding path program 1 times
[2024-06-04 16:51:58,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:51:58,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569494019]
[2024-06-04 16:51:58,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:51:58,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:51:58,390 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:52:04,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:52:04,279 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:52:04,279 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569494019]
[2024-06-04 16:52:04,279 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569494019] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:52:04,280 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:52:04,280 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 16:52:04,280 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413758943]
[2024-06-04 16:52:04,280 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:52:04,282 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 16:52:04,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:52:04,283 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 16:52:04,283 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-04 16:52:04,429 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 16:52:04,429 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-04 16:52:04,429 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:52:04,430 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 16:52:04,430 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:52:05,501 INFO  L124   PetriNetUnfolderBase]: 1357/2119 cut-off events.
[2024-06-04 16:52:05,501 INFO  L125   PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES.
[2024-06-04 16:52:05,505 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-04 16:52:05,515 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 41 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-04 16:52:05,516 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 244 flow
[2024-06-04 16:52:05,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 16:52:05,516 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 16:52:05,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions.
[2024-06-04 16:52:05,518 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-06-04 16:52:05,518 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 91 transitions.
[2024-06-04 16:52:05,518 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 244 flow
[2024-06-04 16:52:05,519 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 16:52:05,520 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-04 16:52:05,520 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-04 16:52:05,521 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-04 16:52:05,521 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-04 16:52:05,521 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-04 16:52:05,522 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:52:05,522 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:52:05,522 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 16:52:05,522 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:52:05,523 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:52:05,523 INFO  L85        PathProgramCache]: Analyzing trace with hash 1102122766, now seen corresponding path program 1 times
[2024-06-04 16:52:05,523 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:52:05,523 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150159212]
[2024-06-04 16:52:05,524 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:52:05,524 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:52:05,585 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:52:10,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:52:10,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:52:10,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150159212]
[2024-06-04 16:52:10,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150159212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:52:10,957 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:52:10,957 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-04 16:52:10,957 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821623326]
[2024-06-04 16:52:10,957 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:52:10,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-04 16:52:10,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:52:10,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-04 16:52:10,960 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-04 16:52:11,142 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 16:52:11,142 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-04 16:52:11,142 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:52:11,143 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 16:52:11,143 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:52:12,219 INFO  L124   PetriNetUnfolderBase]: 1345/2103 cut-off events.
[2024-06-04 16:52:12,219 INFO  L125   PetriNetUnfolderBase]: For 1116/1116 co-relation queries the response was YES.
[2024-06-04 16:52:12,222 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-04 16:52:12,235 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 49 selfloop transitions, 10 changer transitions 0/64 dead transitions.
[2024-06-04 16:52:12,235 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 326 flow
[2024-06-04 16:52:12,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 16:52:12,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 16:52:12,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions.
[2024-06-04 16:52:12,242 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5333333333333333
[2024-06-04 16:52:12,242 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 112 transitions.
[2024-06-04 16:52:12,242 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 326 flow
[2024-06-04 16:52:12,246 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-04 16:52:12,248 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 174 flow
[2024-06-04 16:52:12,248 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-04 16:52:12,249 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places.
[2024-06-04 16:52:12,250 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 174 flow
[2024-06-04 16:52:12,250 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-04 16:52:12,250 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:52:12,250 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:52:12,250 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 16:52:12,250 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:52:12,251 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:52:12,252 INFO  L85        PathProgramCache]: Analyzing trace with hash -1716914867, now seen corresponding path program 1 times
[2024-06-04 16:52:12,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:52:12,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093909793]
[2024-06-04 16:52:12,253 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:52:12,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:52:12,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:52:17,879 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:52:17,879 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:52:17,879 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093909793]
[2024-06-04 16:52:17,880 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093909793] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:52:17,880 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:52:17,880 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 16:52:17,880 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471828091]
[2024-06-04 16:52:17,880 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:52:17,881 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 16:52:17,881 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:52:17,882 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 16:52:17,882 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 16:52:17,992 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 16:52:17,993 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-04 16:52:17,993 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:52:17,993 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 16:52:17,993 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:52:19,154 INFO  L124   PetriNetUnfolderBase]: 1336/2086 cut-off events.
[2024-06-04 16:52:19,154 INFO  L125   PetriNetUnfolderBase]: For 2056/2056 co-relation queries the response was YES.
[2024-06-04 16:52:19,158 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-04 16:52:19,168 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 53 selfloop transitions, 12 changer transitions 0/70 dead transitions.
[2024-06-04 16:52:19,168 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 380 flow
[2024-06-04 16:52:19,169 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 16:52:19,169 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 16:52:19,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions.
[2024-06-04 16:52:19,170 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5079365079365079
[2024-06-04 16:52:19,170 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 174 flow. Second operand 6 states and 128 transitions.
[2024-06-04 16:52:19,170 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 380 flow
[2024-06-04 16:52:19,173 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 356 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 16:52:19,174 INFO  L231             Difference]: Finished difference. Result has 51 places, 43 transitions, 193 flow
[2024-06-04 16:52:19,174 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-04 16:52:19,175 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-04 16:52:19,175 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 193 flow
[2024-06-04 16:52:19,175 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-04 16:52:19,175 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:52:19,176 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:52:19,176 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 16:52:19,176 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:52:19,176 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:52:19,177 INFO  L85        PathProgramCache]: Analyzing trace with hash -2100828532, now seen corresponding path program 1 times
[2024-06-04 16:52:19,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:52:19,177 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80292285]
[2024-06-04 16:52:19,177 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:52:19,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:52:19,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:52:28,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:52:28,615 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:52:28,615 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80292285]
[2024-06-04 16:52:28,615 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80292285] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:52:28,616 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:52:28,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 16:52:28,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770500502]
[2024-06-04 16:52:28,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:52:28,616 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 16:52:28,617 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:52:28,617 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 16:52:28,618 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-04 16:52:28,763 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 16:52:28,763 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-04 16:52:28,764 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:52:28,764 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 16:52:28,764 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:52:29,778 INFO  L124   PetriNetUnfolderBase]: 1124/1900 cut-off events.
[2024-06-04 16:52:29,778 INFO  L125   PetriNetUnfolderBase]: For 2652/2652 co-relation queries the response was YES.
[2024-06-04 16:52:29,781 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-04 16:52:29,788 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 43 selfloop transitions, 8 changer transitions 0/57 dead transitions.
[2024-06-04 16:52:29,789 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 339 flow
[2024-06-04 16:52:29,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 16:52:29,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 16:52:29,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions.
[2024-06-04 16:52:29,790 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 16:52:29,790 INFO  L175             Difference]: Start difference. First operand has 51 places, 43 transitions, 193 flow. Second operand 5 states and 95 transitions.
[2024-06-04 16:52:29,790 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 339 flow
[2024-06-04 16:52:29,793 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 306 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-04 16:52:29,794 INFO  L231             Difference]: Finished difference. Result has 52 places, 46 transitions, 206 flow
[2024-06-04 16:52:29,795 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-04 16:52:29,795 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2024-06-04 16:52:29,796 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 206 flow
[2024-06-04 16:52:29,796 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-04 16:52:29,796 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:52:29,796 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:52:29,796 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 16:52:29,797 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:52:29,797 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:52:29,797 INFO  L85        PathProgramCache]: Analyzing trace with hash 476472641, now seen corresponding path program 1 times
[2024-06-04 16:52:29,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:52:29,797 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931774943]
[2024-06-04 16:52:29,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:52:29,798 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:52:29,855 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:52:39,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:52:39,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:52:39,246 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931774943]
[2024-06-04 16:52:39,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931774943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:52:39,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:52:39,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 16:52:39,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264061638]
[2024-06-04 16:52:39,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:52:39,247 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 16:52:39,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:52:39,248 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 16:52:39,248 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-04 16:52:39,423 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 16:52:39,423 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-04 16:52:39,423 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:52:39,424 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 16:52:39,424 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:52:40,362 INFO  L124   PetriNetUnfolderBase]: 1342/2120 cut-off events.
[2024-06-04 16:52:40,362 INFO  L125   PetriNetUnfolderBase]: For 4395/4395 co-relation queries the response was YES.
[2024-06-04 16:52:40,365 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-04 16:52:40,374 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 51 selfloop transitions, 11 changer transitions 0/67 dead transitions.
[2024-06-04 16:52:40,374 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 67 transitions, 396 flow
[2024-06-04 16:52:40,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 16:52:40,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 16:52:40,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-04 16:52:40,375 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-04 16:52:40,375 INFO  L175             Difference]: Start difference. First operand has 52 places, 46 transitions, 206 flow. Second operand 6 states and 110 transitions.
[2024-06-04 16:52:40,375 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 67 transitions, 396 flow
[2024-06-04 16:52:40,378 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 67 transitions, 374 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-04 16:52:40,379 INFO  L231             Difference]: Finished difference. Result has 55 places, 49 transitions, 240 flow
[2024-06-04 16:52:40,379 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-04 16:52:40,380 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places.
[2024-06-04 16:52:40,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 240 flow
[2024-06-04 16:52:40,380 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-04 16:52:40,380 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:52:40,381 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:52:40,381 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 16:52:40,381 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:52:40,381 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:52:40,382 INFO  L85        PathProgramCache]: Analyzing trace with hash -996192821, now seen corresponding path program 2 times
[2024-06-04 16:52:40,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:52:40,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749521244]
[2024-06-04 16:52:40,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:52:40,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:52:40,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:52:49,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:52:49,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:52:49,538 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749521244]
[2024-06-04 16:52:49,539 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749521244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:52:49,539 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:52:49,539 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 16:52:49,539 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605208098]
[2024-06-04 16:52:49,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:52:49,540 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 16:52:49,540 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:52:49,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 16:52:49,541 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-04 16:52:49,710 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 16:52:49,711 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-04 16:52:49,711 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:52:49,711 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 16:52:49,711 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:52:50,636 INFO  L124   PetriNetUnfolderBase]: 1337/2124 cut-off events.
[2024-06-04 16:52:50,637 INFO  L125   PetriNetUnfolderBase]: For 5959/5971 co-relation queries the response was YES.
[2024-06-04 16:52:50,640 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-04 16:52:50,649 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 46 selfloop transitions, 16 changer transitions 0/67 dead transitions.
[2024-06-04 16:52:50,650 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 428 flow
[2024-06-04 16:52:50,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 16:52:50,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 16:52:50,651 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-04 16:52:50,651 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43253968253968256
[2024-06-04 16:52:50,651 INFO  L175             Difference]: Start difference. First operand has 55 places, 49 transitions, 240 flow. Second operand 6 states and 109 transitions.
[2024-06-04 16:52:50,652 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 428 flow
[2024-06-04 16:52:50,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 396 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-04 16:52:50,656 INFO  L231             Difference]: Finished difference. Result has 57 places, 52 transitions, 280 flow
[2024-06-04 16:52:50,656 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-04 16:52:50,657 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-04 16:52:50,657 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 280 flow
[2024-06-04 16:52:50,657 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-04 16:52:50,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:52:50,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:52:50,658 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 16:52:50,658 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:52:50,658 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:52:50,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -261533013, now seen corresponding path program 1 times
[2024-06-04 16:52:50,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:52:50,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052754535]
[2024-06-04 16:52:50,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:52:50,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:52:50,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:53:01,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:53:01,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:53:01,133 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052754535]
[2024-06-04 16:53:01,133 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052754535] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:53:01,133 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:53:01,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 16:53:01,133 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644418108]
[2024-06-04 16:53:01,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:53:01,134 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 16:53:01,134 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:53:01,134 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 16:53:01,134 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-04 16:53:01,341 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 16:53:01,341 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-04 16:53:01,342 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:53:01,342 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 16:53:01,342 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:53:02,284 INFO  L124   PetriNetUnfolderBase]: 1377/2267 cut-off events.
[2024-06-04 16:53:02,285 INFO  L125   PetriNetUnfolderBase]: For 7558/7558 co-relation queries the response was YES.
[2024-06-04 16:53:02,287 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-04 16:53:02,295 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 58 selfloop transitions, 14 changer transitions 0/77 dead transitions.
[2024-06-04 16:53:02,296 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 511 flow
[2024-06-04 16:53:02,297 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 16:53:02,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 16:53:02,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-04 16:53:02,298 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-04 16:53:02,298 INFO  L175             Difference]: Start difference. First operand has 57 places, 52 transitions, 280 flow. Second operand 7 states and 123 transitions.
[2024-06-04 16:53:02,298 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 511 flow
[2024-06-04 16:53:02,302 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 460 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-04 16:53:02,303 INFO  L231             Difference]: Finished difference. Result has 61 places, 58 transitions, 316 flow
[2024-06-04 16:53:02,304 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-04 16:53:02,304 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places.
[2024-06-04 16:53:02,304 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 316 flow
[2024-06-04 16:53:02,305 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-04 16:53:02,305 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:53:02,305 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:53:02,305 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 16:53:02,305 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:53:02,306 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:53:02,306 INFO  L85        PathProgramCache]: Analyzing trace with hash -1542312761, now seen corresponding path program 1 times
[2024-06-04 16:53:02,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:53:02,306 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214434940]
[2024-06-04 16:53:02,306 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:53:02,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:53:02,358 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:53:10,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:53:10,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:53:10,883 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214434940]
[2024-06-04 16:53:10,883 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214434940] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:53:10,883 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:53:10,883 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 16:53:10,883 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550668930]
[2024-06-04 16:53:10,883 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:53:10,883 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 16:53:10,884 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:53:10,884 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 16:53:10,884 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 16:53:11,013 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 16:53:11,014 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-04 16:53:11,014 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:53:11,014 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 16:53:11,014 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:53:12,137 INFO  L124   PetriNetUnfolderBase]: 1555/2434 cut-off events.
[2024-06-04 16:53:12,137 INFO  L125   PetriNetUnfolderBase]: For 11240/11250 co-relation queries the response was YES.
[2024-06-04 16:53:12,140 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-04 16:53:12,148 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 74 selfloop transitions, 17 changer transitions 0/97 dead transitions.
[2024-06-04 16:53:12,148 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 97 transitions, 622 flow
[2024-06-04 16:53:12,148 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 16:53:12,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 16:53:12,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-04 16:53:12,149 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44345238095238093
[2024-06-04 16:53:12,149 INFO  L175             Difference]: Start difference. First operand has 61 places, 58 transitions, 316 flow. Second operand 8 states and 149 transitions.
[2024-06-04 16:53:12,149 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 97 transitions, 622 flow
[2024-06-04 16:53:12,154 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 97 transitions, 582 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-04 16:53:12,156 INFO  L231             Difference]: Finished difference. Result has 66 places, 64 transitions, 370 flow
[2024-06-04 16:53:12,156 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-04 16:53:12,157 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places.
[2024-06-04 16:53:12,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 370 flow
[2024-06-04 16:53:12,157 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-04 16:53:12,157 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:53:12,157 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:53:12,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 16:53:12,158 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:53:12,158 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:53:12,158 INFO  L85        PathProgramCache]: Analyzing trace with hash -1542192791, now seen corresponding path program 2 times
[2024-06-04 16:53:12,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:53:12,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174293640]
[2024-06-04 16:53:12,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:53:12,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:53:12,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:53:21,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:53:21,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:53:21,818 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174293640]
[2024-06-04 16:53:21,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174293640] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:53:21,818 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:53:21,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 16:53:21,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646407170]
[2024-06-04 16:53:21,819 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:53:21,819 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 16:53:21,819 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:53:21,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 16:53:21,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 16:53:22,017 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 16:53:22,018 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-04 16:53:22,018 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:53:22,018 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 16:53:22,020 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:53:23,273 INFO  L124   PetriNetUnfolderBase]: 1702/2664 cut-off events.
[2024-06-04 16:53:23,273 INFO  L125   PetriNetUnfolderBase]: For 15650/15660 co-relation queries the response was YES.
[2024-06-04 16:53:23,278 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-04 16:53:23,287 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 75 selfloop transitions, 25 changer transitions 0/106 dead transitions.
[2024-06-04 16:53:23,287 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 780 flow
[2024-06-04 16:53:23,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 16:53:23,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 16:53:23,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 16:53:23,289 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-04 16:53:23,290 INFO  L175             Difference]: Start difference. First operand has 66 places, 64 transitions, 370 flow. Second operand 8 states and 153 transitions.
[2024-06-04 16:53:23,290 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 780 flow
[2024-06-04 16:53:23,298 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 728 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-04 16:53:23,302 INFO  L231             Difference]: Finished difference. Result has 70 places, 72 transitions, 478 flow
[2024-06-04 16:53:23,303 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-04 16:53:23,305 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places.
[2024-06-04 16:53:23,307 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 478 flow
[2024-06-04 16:53:23,307 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-04 16:53:23,307 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:53:23,307 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:53:23,307 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 16:53:23,307 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:53:23,308 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:53:23,308 INFO  L85        PathProgramCache]: Analyzing trace with hash 482166771, now seen corresponding path program 3 times
[2024-06-04 16:53:23,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:53:23,308 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891974551]
[2024-06-04 16:53:23,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:53:23,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:53:23,384 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:53:32,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:53:32,949 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:53:32,949 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891974551]
[2024-06-04 16:53:32,949 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891974551] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:53:32,949 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:53:32,949 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 16:53:32,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142555980]
[2024-06-04 16:53:32,949 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:53:32,949 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 16:53:32,949 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:53:32,950 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 16:53:32,950 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 16:53:33,149 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 16:53:33,149 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-04 16:53:33,149 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:53:33,149 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 16:53:33,149 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:53:34,350 INFO  L124   PetriNetUnfolderBase]: 1710/2662 cut-off events.
[2024-06-04 16:53:34,350 INFO  L125   PetriNetUnfolderBase]: For 20203/20212 co-relation queries the response was YES.
[2024-06-04 16:53:34,353 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-04 16:53:34,363 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 70 selfloop transitions, 38 changer transitions 0/114 dead transitions.
[2024-06-04 16:53:34,363 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 114 transitions, 966 flow
[2024-06-04 16:53:34,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 16:53:34,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 16:53:34,366 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-04 16:53:34,366 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-04 16:53:34,367 INFO  L175             Difference]: Start difference. First operand has 70 places, 72 transitions, 478 flow. Second operand 8 states and 157 transitions.
[2024-06-04 16:53:34,367 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 114 transitions, 966 flow
[2024-06-04 16:53:34,377 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 918 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-04 16:53:34,379 INFO  L231             Difference]: Finished difference. Result has 75 places, 80 transitions, 630 flow
[2024-06-04 16:53:34,379 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-04 16:53:34,380 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places.
[2024-06-04 16:53:34,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 630 flow
[2024-06-04 16:53:34,380 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-04 16:53:34,380 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:53:34,381 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:53:34,381 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 16:53:34,381 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:53:34,381 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:53:34,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 482413035, now seen corresponding path program 1 times
[2024-06-04 16:53:34,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:53:34,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907270911]
[2024-06-04 16:53:34,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:53:34,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:53:34,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:53:44,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:53:44,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:53:44,197 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907270911]
[2024-06-04 16:53:44,197 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907270911] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:53:44,197 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:53:44,197 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 16:53:44,197 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139473053]
[2024-06-04 16:53:44,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:53:44,197 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 16:53:44,197 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:53:44,198 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 16:53:44,198 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-04 16:53:44,420 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 16:53:44,421 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-04 16:53:44,421 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:53:44,421 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 16:53:44,421 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:53:45,546 INFO  L124   PetriNetUnfolderBase]: 1573/2546 cut-off events.
[2024-06-04 16:53:45,547 INFO  L125   PetriNetUnfolderBase]: For 20078/20078 co-relation queries the response was YES.
[2024-06-04 16:53:45,551 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-04 16:53:45,560 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 85 selfloop transitions, 16 changer transitions 0/106 dead transitions.
[2024-06-04 16:53:45,560 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 106 transitions, 924 flow
[2024-06-04 16:53:45,561 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 16:53:45,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 16:53:45,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-04 16:53:45,562 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41369047619047616
[2024-06-04 16:53:45,562 INFO  L175             Difference]: Start difference. First operand has 75 places, 80 transitions, 630 flow. Second operand 8 states and 139 transitions.
[2024-06-04 16:53:45,562 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 106 transitions, 924 flow
[2024-06-04 16:53:45,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 818 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-04 16:53:45,579 INFO  L231             Difference]: Finished difference. Result has 78 places, 82 transitions, 599 flow
[2024-06-04 16:53:45,579 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-04 16:53:45,580 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places.
[2024-06-04 16:53:45,580 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 599 flow
[2024-06-04 16:53:45,580 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-04 16:53:45,580 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:53:45,580 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:53:45,581 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 16:53:45,581 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-04 16:53:45,581 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:53:45,581 INFO  L85        PathProgramCache]: Analyzing trace with hash -762430686, now seen corresponding path program 1 times
[2024-06-04 16:53:45,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:53:45,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931011058]
[2024-06-04 16:53:45,582 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:53:45,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:53:45,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:53:58,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:53:58,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:53:58,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931011058]
[2024-06-04 16:53:58,571 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931011058] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:53:58,571 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:53:58,571 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 16:53:58,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637731728]
[2024-06-04 16:53:58,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:53:58,571 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 16:53:58,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:53:58,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 16:53:58,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-04 16:53:58,721 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:53:58,721 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-04 16:53:58,721 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:53:58,721 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:53:58,721 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:53:59,834 INFO  L124   PetriNetUnfolderBase]: 1822/2809 cut-off events.
[2024-06-04 16:53:59,834 INFO  L125   PetriNetUnfolderBase]: For 23902/23902 co-relation queries the response was YES.
[2024-06-04 16:53:59,838 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-04 16:53:59,845 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 81 selfloop transitions, 8 changer transitions 0/93 dead transitions.
[2024-06-04 16:53:59,845 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 93 transitions, 819 flow
[2024-06-04 16:53:59,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 16:53:59,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 16:53:59,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions.
[2024-06-04 16:53:59,846 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3952380952380952
[2024-06-04 16:53:59,846 INFO  L175             Difference]: Start difference. First operand has 78 places, 82 transitions, 599 flow. Second operand 5 states and 83 transitions.
[2024-06-04 16:53:59,846 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 93 transitions, 819 flow
[2024-06-04 16:53:59,859 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 764 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-04 16:53:59,861 INFO  L231             Difference]: Finished difference. Result has 77 places, 85 transitions, 594 flow
[2024-06-04 16:53:59,861 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-04 16:53:59,862 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places.
[2024-06-04 16:53:59,862 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 594 flow
[2024-06-04 16:53:59,862 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-04 16:53:59,862 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:53:59,862 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:53:59,862 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 16:53:59,863 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:53:59,863 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:53:59,863 INFO  L85        PathProgramCache]: Analyzing trace with hash -567143916, now seen corresponding path program 1 times
[2024-06-04 16:53:59,863 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:53:59,863 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672850990]
[2024-06-04 16:53:59,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:53:59,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:53:59,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:54:08,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:54:08,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:54:08,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672850990]
[2024-06-04 16:54:08,094 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672850990] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:54:08,094 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:54:08,094 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 16:54:08,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064470492]
[2024-06-04 16:54:08,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:54:08,095 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 16:54:08,095 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:54:08,096 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 16:54:08,096 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-04 16:54:08,231 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 16:54:08,231 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-04 16:54:08,231 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:54:08,231 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 16:54:08,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:54:09,440 INFO  L124   PetriNetUnfolderBase]: 1786/2761 cut-off events.
[2024-06-04 16:54:09,441 INFO  L125   PetriNetUnfolderBase]: For 31124/31124 co-relation queries the response was YES.
[2024-06-04 16:54:09,446 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-04 16:54:09,455 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 88 selfloop transitions, 19 changer transitions 0/114 dead transitions.
[2024-06-04 16:54:09,455 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 114 transitions, 922 flow
[2024-06-04 16:54:09,455 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 16:54:09,456 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 16:54:09,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-04 16:54:09,456 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445578231292517
[2024-06-04 16:54:09,456 INFO  L175             Difference]: Start difference. First operand has 77 places, 85 transitions, 594 flow. Second operand 7 states and 131 transitions.
[2024-06-04 16:54:09,456 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 114 transitions, 922 flow
[2024-06-04 16:54:09,468 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 114 transitions, 894 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-04 16:54:09,470 INFO  L231             Difference]: Finished difference. Result has 81 places, 88 transitions, 668 flow
[2024-06-04 16:54:09,470 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-04 16:54:09,471 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places.
[2024-06-04 16:54:09,471 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 668 flow
[2024-06-04 16:54:09,471 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-04 16:54:09,471 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:54:09,471 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:54:09,472 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 16:54:09,472 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:54:09,472 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:54:09,472 INFO  L85        PathProgramCache]: Analyzing trace with hash -563328684, now seen corresponding path program 1 times
[2024-06-04 16:54:09,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:54:09,473 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751638482]
[2024-06-04 16:54:09,473 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:54:09,473 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:54:09,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:54:19,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:54:19,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:54:19,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751638482]
[2024-06-04 16:54:19,571 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751638482] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:54:19,571 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:54:19,571 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 16:54:19,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788037293]
[2024-06-04 16:54:19,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:54:19,571 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 16:54:19,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:54:19,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 16:54:19,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 16:54:19,716 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:54:19,717 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-04 16:54:19,717 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:54:19,717 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:54:19,717 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:54:20,981 INFO  L124   PetriNetUnfolderBase]: 1895/2887 cut-off events.
[2024-06-04 16:54:20,981 INFO  L125   PetriNetUnfolderBase]: For 34328/34328 co-relation queries the response was YES.
[2024-06-04 16:54:20,986 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-04 16:54:20,994 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 97 selfloop transitions, 17 changer transitions 0/119 dead transitions.
[2024-06-04 16:54:20,994 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 119 transitions, 1013 flow
[2024-06-04 16:54:20,996 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 16:54:20,997 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 16:54:20,997 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-04 16:54:20,997 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4017857142857143
[2024-06-04 16:54:20,998 INFO  L175             Difference]: Start difference. First operand has 81 places, 88 transitions, 668 flow. Second operand 8 states and 135 transitions.
[2024-06-04 16:54:20,998 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 119 transitions, 1013 flow
[2024-06-04 16:54:21,019 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 119 transitions, 955 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-04 16:54:21,021 INFO  L231             Difference]: Finished difference. Result has 85 places, 93 transitions, 713 flow
[2024-06-04 16:54:21,021 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-04 16:54:21,022 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places.
[2024-06-04 16:54:21,022 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 93 transitions, 713 flow
[2024-06-04 16:54:21,022 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-04 16:54:21,022 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:54:21,022 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:54:21,022 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 16:54:21,023 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:54:21,023 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:54:21,023 INFO  L85        PathProgramCache]: Analyzing trace with hash -1461936618, now seen corresponding path program 2 times
[2024-06-04 16:54:21,023 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:54:21,023 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903667237]
[2024-06-04 16:54:21,024 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:54:21,024 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:54:21,072 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:54:30,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:54:30,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:54:30,549 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903667237]
[2024-06-04 16:54:30,549 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903667237] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:54:30,549 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:54:30,549 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 16:54:30,549 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923799945]
[2024-06-04 16:54:30,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:54:30,550 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 16:54:30,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:54:30,551 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 16:54:30,551 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 16:54:30,721 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:54:30,722 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-04 16:54:30,722 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:54:30,722 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:54:30,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:54:31,899 INFO  L124   PetriNetUnfolderBase]: 1906/2905 cut-off events.
[2024-06-04 16:54:31,899 INFO  L125   PetriNetUnfolderBase]: For 38427/38436 co-relation queries the response was YES.
[2024-06-04 16:54:31,904 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-04 16:54:31,911 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 86 selfloop transitions, 35 changer transitions 0/126 dead transitions.
[2024-06-04 16:54:31,911 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 126 transitions, 1168 flow
[2024-06-04 16:54:31,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 16:54:31,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 16:54:31,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-04 16:54:31,914 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4107142857142857
[2024-06-04 16:54:31,914 INFO  L175             Difference]: Start difference. First operand has 85 places, 93 transitions, 713 flow. Second operand 8 states and 138 transitions.
[2024-06-04 16:54:31,914 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 126 transitions, 1168 flow
[2024-06-04 16:54:31,930 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 126 transitions, 1110 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-04 16:54:31,932 INFO  L231             Difference]: Finished difference. Result has 89 places, 101 transitions, 842 flow
[2024-06-04 16:54:31,932 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-04 16:54:31,933 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places.
[2024-06-04 16:54:31,933 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 842 flow
[2024-06-04 16:54:31,933 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-04 16:54:31,933 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:54:31,934 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:54:31,934 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 16:54:31,934 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:54:31,934 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:54:31,934 INFO  L85        PathProgramCache]: Analyzing trace with hash -1462203528, now seen corresponding path program 3 times
[2024-06-04 16:54:31,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:54:31,935 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344616484]
[2024-06-04 16:54:31,935 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:54:31,935 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:54:31,990 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:54:42,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:54:42,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:54:42,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344616484]
[2024-06-04 16:54:42,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344616484] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:54:42,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:54:42,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 16:54:42,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767941576]
[2024-06-04 16:54:42,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:54:42,625 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 16:54:42,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:54:42,625 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 16:54:42,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 16:54:42,799 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:54:42,799 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-04 16:54:42,799 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:54:42,799 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:54:42,799 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:54:44,064 INFO  L124   PetriNetUnfolderBase]: 1928/2937 cut-off events.
[2024-06-04 16:54:44,064 INFO  L125   PetriNetUnfolderBase]: For 42954/42963 co-relation queries the response was YES.
[2024-06-04 16:54:44,069 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-04 16:54:44,077 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 95 selfloop transitions, 30 changer transitions 0/130 dead transitions.
[2024-06-04 16:54:44,077 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 130 transitions, 1223 flow
[2024-06-04 16:54:44,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 16:54:44,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 16:54:44,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-04 16:54:44,079 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4017857142857143
[2024-06-04 16:54:44,079 INFO  L175             Difference]: Start difference. First operand has 89 places, 101 transitions, 842 flow. Second operand 8 states and 135 transitions.
[2024-06-04 16:54:44,080 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 130 transitions, 1223 flow
[2024-06-04 16:54:44,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 130 transitions, 1185 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-04 16:54:44,100 INFO  L231             Difference]: Finished difference. Result has 95 places, 107 transitions, 951 flow
[2024-06-04 16:54:44,100 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-04 16:54:44,100 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places.
[2024-06-04 16:54:44,100 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 107 transitions, 951 flow
[2024-06-04 16:54:44,101 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-04 16:54:44,101 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:54:44,101 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:54:44,101 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 16:54:44,101 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:54:44,102 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:54:44,102 INFO  L85        PathProgramCache]: Analyzing trace with hash -1469555178, now seen corresponding path program 4 times
[2024-06-04 16:54:44,102 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:54:44,102 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900995541]
[2024-06-04 16:54:44,102 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:54:44,102 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:54:44,150 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:54:54,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:54:54,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:54:54,290 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900995541]
[2024-06-04 16:54:54,290 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900995541] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:54:54,290 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:54:54,290 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 16:54:54,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693944424]
[2024-06-04 16:54:54,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:54:54,291 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 16:54:54,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:54:54,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 16:54:54,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 16:54:54,458 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:54:54,459 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-04 16:54:54,459 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:54:54,459 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:54:54,459 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:54:55,712 INFO  L124   PetriNetUnfolderBase]: 1917/2920 cut-off events.
[2024-06-04 16:54:55,712 INFO  L125   PetriNetUnfolderBase]: For 46159/46168 co-relation queries the response was YES.
[2024-06-04 16:54:55,719 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-04 16:54:55,728 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 96 selfloop transitions, 29 changer transitions 0/130 dead transitions.
[2024-06-04 16:54:55,728 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 130 transitions, 1259 flow
[2024-06-04 16:54:55,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 16:54:55,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 16:54:55,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-04 16:54:55,731 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-04 16:54:55,731 INFO  L175             Difference]: Start difference. First operand has 95 places, 107 transitions, 951 flow. Second operand 8 states and 136 transitions.
[2024-06-04 16:54:55,731 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 130 transitions, 1259 flow
[2024-06-04 16:54:55,760 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 130 transitions, 1157 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-04 16:54:55,761 INFO  L231             Difference]: Finished difference. Result has 98 places, 107 transitions, 915 flow
[2024-06-04 16:54:55,762 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-04 16:54:55,762 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places.
[2024-06-04 16:54:55,762 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 107 transitions, 915 flow
[2024-06-04 16:54:55,762 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-04 16:54:55,762 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:54:55,763 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:54:55,763 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 16:54:55,763 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-04 16:54:55,763 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:54:55,763 INFO  L85        PathProgramCache]: Analyzing trace with hash 2134453610, now seen corresponding path program 1 times
[2024-06-04 16:54:55,763 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:54:55,764 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900510348]
[2024-06-04 16:54:55,764 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:54:55,764 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:54:55,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:55:09,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:55:09,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:55:09,245 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900510348]
[2024-06-04 16:55:09,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900510348] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:55:09,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:55:09,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 16:55:09,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535953546]
[2024-06-04 16:55:09,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:55:09,246 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 16:55:09,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:55:09,247 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 16:55:09,247 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 16:55:09,383 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:55:09,383 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-04 16:55:09,384 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:55:09,384 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:55:09,384 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:55:10,438 INFO  L124   PetriNetUnfolderBase]: 1817/2798 cut-off events.
[2024-06-04 16:55:10,438 INFO  L125   PetriNetUnfolderBase]: For 42102/42102 co-relation queries the response was YES.
[2024-06-04 16:55:10,444 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-04 16:55:10,450 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 105 selfloop transitions, 11 changer transitions 0/120 dead transitions.
[2024-06-04 16:55:10,450 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 120 transitions, 1197 flow
[2024-06-04 16:55:10,451 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 16:55:10,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 16:55:10,451 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-04 16:55:10,452 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38095238095238093
[2024-06-04 16:55:10,452 INFO  L175             Difference]: Start difference. First operand has 98 places, 107 transitions, 915 flow. Second operand 6 states and 96 transitions.
[2024-06-04 16:55:10,452 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 120 transitions, 1197 flow
[2024-06-04 16:55:10,473 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 120 transitions, 1095 flow, removed 7 selfloop flow, removed 9 redundant places.
[2024-06-04 16:55:10,474 INFO  L231             Difference]: Finished difference. Result has 95 places, 110 transitions, 873 flow
[2024-06-04 16:55:10,474 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-04 16:55:10,475 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places.
[2024-06-04 16:55:10,475 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 110 transitions, 873 flow
[2024-06-04 16:55:10,475 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-04 16:55:10,475 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:55:10,475 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:55:10,475 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 16:55:10,475 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:55:10,476 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:55:10,476 INFO  L85        PathProgramCache]: Analyzing trace with hash 1076565482, now seen corresponding path program 1 times
[2024-06-04 16:55:10,476 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:55:10,476 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647176524]
[2024-06-04 16:55:10,476 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:55:10,476 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:55:10,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:55:20,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:55:20,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:55:20,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647176524]
[2024-06-04 16:55:20,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647176524] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:55:20,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:55:20,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 16:55:20,457 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022469280]
[2024-06-04 16:55:20,457 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:55:20,458 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 16:55:20,458 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:55:20,458 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 16:55:20,458 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 16:55:20,670 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 16:55:20,671 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-04 16:55:20,671 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:55:20,671 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 16:55:20,671 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:55:22,002 INFO  L124   PetriNetUnfolderBase]: 1832/2828 cut-off events.
[2024-06-04 16:55:22,002 INFO  L125   PetriNetUnfolderBase]: For 55236/55236 co-relation queries the response was YES.
[2024-06-04 16:55:22,008 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-04 16:55:22,018 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 117 selfloop transitions, 17 changer transitions 0/143 dead transitions.
[2024-06-04 16:55:22,018 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 143 transitions, 1259 flow
[2024-06-04 16:55:22,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 16:55:22,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 16:55:22,021 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-04 16:55:22,021 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-04 16:55:22,021 INFO  L175             Difference]: Start difference. First operand has 95 places, 110 transitions, 873 flow. Second operand 8 states and 146 transitions.
[2024-06-04 16:55:22,022 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 143 transitions, 1259 flow
[2024-06-04 16:55:22,051 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 143 transitions, 1221 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-04 16:55:22,052 INFO  L231             Difference]: Finished difference. Result has 99 places, 112 transitions, 920 flow
[2024-06-04 16:55:22,053 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-04 16:55:22,053 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places.
[2024-06-04 16:55:22,053 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 112 transitions, 920 flow
[2024-06-04 16:55:22,053 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-04 16:55:22,053 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:55:22,053 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:55:22,054 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 16:55:22,054 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:55:22,054 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:55:22,054 INFO  L85        PathProgramCache]: Analyzing trace with hash -199725278, now seen corresponding path program 2 times
[2024-06-04 16:55:22,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:55:22,054 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581218923]
[2024-06-04 16:55:22,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:55:22,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:55:22,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:55:31,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:55:31,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:55:31,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581218923]
[2024-06-04 16:55:31,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581218923] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:55:31,603 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:55:31,603 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 16:55:31,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528430723]
[2024-06-04 16:55:31,603 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:55:31,604 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 16:55:31,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:55:31,605 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 16:55:31,605 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 16:55:31,795 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 16:55:31,795 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-04 16:55:31,795 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:55:31,796 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 16:55:31,796 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:55:33,149 INFO  L124   PetriNetUnfolderBase]: 1831/2849 cut-off events.
[2024-06-04 16:55:33,149 INFO  L125   PetriNetUnfolderBase]: For 61717/61717 co-relation queries the response was YES.
[2024-06-04 16:55:33,156 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-04 16:55:33,164 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 115 selfloop transitions, 21 changer transitions 0/145 dead transitions.
[2024-06-04 16:55:33,164 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 145 transitions, 1316 flow
[2024-06-04 16:55:33,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 16:55:33,166 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 16:55:33,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-04 16:55:33,167 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-04 16:55:33,167 INFO  L175             Difference]: Start difference. First operand has 99 places, 112 transitions, 920 flow. Second operand 8 states and 147 transitions.
[2024-06-04 16:55:33,167 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 145 transitions, 1316 flow
[2024-06-04 16:55:33,193 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 145 transitions, 1249 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-04 16:55:33,195 INFO  L231             Difference]: Finished difference. Result has 101 places, 114 transitions, 951 flow
[2024-06-04 16:55:33,195 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-04 16:55:33,196 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places.
[2024-06-04 16:55:33,196 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 114 transitions, 951 flow
[2024-06-04 16:55:33,196 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-04 16:55:33,196 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:55:33,196 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:55:33,196 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 16:55:33,196 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:55:33,196 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:55:33,196 INFO  L85        PathProgramCache]: Analyzing trace with hash 965866032, now seen corresponding path program 1 times
[2024-06-04 16:55:33,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:55:33,197 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196398346]
[2024-06-04 16:55:33,197 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:55:33,197 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:55:33,246 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:55:42,781 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:55:42,781 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:55:42,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196398346]
[2024-06-04 16:55:42,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196398346] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:55:42,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:55:42,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 16:55:42,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128426249]
[2024-06-04 16:55:42,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:55:42,783 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 16:55:42,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:55:42,783 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 16:55:42,783 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 16:55:42,960 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:55:42,961 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-04 16:55:42,961 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:55:42,961 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:55:42,961 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:55:44,308 INFO  L124   PetriNetUnfolderBase]: 1976/3010 cut-off events.
[2024-06-04 16:55:44,308 INFO  L125   PetriNetUnfolderBase]: For 66523/66523 co-relation queries the response was YES.
[2024-06-04 16:55:44,315 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-04 16:55:44,325 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 115 selfloop transitions, 39 changer transitions 0/159 dead transitions.
[2024-06-04 16:55:44,325 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 159 transitions, 1425 flow
[2024-06-04 16:55:44,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 16:55:44,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 16:55:44,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-04 16:55:44,328 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42328042328042326
[2024-06-04 16:55:44,328 INFO  L175             Difference]: Start difference. First operand has 101 places, 114 transitions, 951 flow. Second operand 9 states and 160 transitions.
[2024-06-04 16:55:44,328 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 159 transitions, 1425 flow
[2024-06-04 16:55:44,363 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 159 transitions, 1323 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-04 16:55:44,365 INFO  L231             Difference]: Finished difference. Result has 105 places, 123 transitions, 1029 flow
[2024-06-04 16:55:44,365 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-04 16:55:44,366 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places.
[2024-06-04 16:55:44,366 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 123 transitions, 1029 flow
[2024-06-04 16:55:44,366 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-04 16:55:44,366 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:55: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-04 16:55:44,367 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 16:55:44,367 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:55:44,367 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:55:44,367 INFO  L85        PathProgramCache]: Analyzing trace with hash 1081336940, now seen corresponding path program 1 times
[2024-06-04 16:55:44,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:55:44,368 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476784923]
[2024-06-04 16:55:44,368 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:55:44,368 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:55:44,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:55:54,618 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:55:54,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:55:54,618 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476784923]
[2024-06-04 16:55:54,618 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476784923] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:55:54,618 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:55:54,618 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 16:55:54,618 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806075296]
[2024-06-04 16:55:54,618 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:55:54,619 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 16:55:54,619 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:55:54,619 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 16:55:54,619 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 16:55:54,822 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:55:54,823 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-04 16:55:54,823 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:55:54,823 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:55:54,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:55:56,243 INFO  L124   PetriNetUnfolderBase]: 1999/3043 cut-off events.
[2024-06-04 16:55:56,244 INFO  L125   PetriNetUnfolderBase]: For 72110/72110 co-relation queries the response was YES.
[2024-06-04 16:55:56,251 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-04 16:55:56,260 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 132 selfloop transitions, 19 changer transitions 0/156 dead transitions.
[2024-06-04 16:55:56,260 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 156 transitions, 1449 flow
[2024-06-04 16:55:56,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 16:55:56,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 16:55:56,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-04 16:55:56,262 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3968253968253968
[2024-06-04 16:55:56,262 INFO  L175             Difference]: Start difference. First operand has 105 places, 123 transitions, 1029 flow. Second operand 9 states and 150 transitions.
[2024-06-04 16:55:56,263 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 156 transitions, 1449 flow
[2024-06-04 16:55:56,291 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 156 transitions, 1397 flow, removed 7 selfloop flow, removed 5 redundant places.
[2024-06-04 16:55:56,293 INFO  L231             Difference]: Finished difference. Result has 109 places, 125 transitions, 1066 flow
[2024-06-04 16:55:56,293 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-04 16:55:56,294 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places.
[2024-06-04 16:55:56,294 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 125 transitions, 1066 flow
[2024-06-04 16:55:56,294 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-04 16:55:56,294 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:55:56,294 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:55:56,294 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 16:55:56,294 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:55:56,295 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:55:56,295 INFO  L85        PathProgramCache]: Analyzing trace with hash 1081152242, now seen corresponding path program 3 times
[2024-06-04 16:55:56,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:55:56,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876450269]
[2024-06-04 16:55:56,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:55:56,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:55:56,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:56:05,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:56:05,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:56:05,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876450269]
[2024-06-04 16:56:05,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876450269] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:56:05,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:56:05,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 16:56:05,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319535849]
[2024-06-04 16:56:05,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:56:05,689 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 16:56:05,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:56:05,689 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 16:56:05,690 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 16:56:05,821 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 16:56:05,822 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-04 16:56:05,822 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:56:05,822 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 16:56:05,822 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:56:07,336 INFO  L124   PetriNetUnfolderBase]: 1861/2884 cut-off events.
[2024-06-04 16:56:07,337 INFO  L125   PetriNetUnfolderBase]: For 74185/74185 co-relation queries the response was YES.
[2024-06-04 16:56:07,344 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-04 16:56:07,352 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 118 selfloop transitions, 35 changer transitions 0/163 dead transitions.
[2024-06-04 16:56:07,352 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 163 transitions, 1516 flow
[2024-06-04 16:56:07,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 16:56:07,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 16:56:07,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-04 16:56:07,354 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-04 16:56:07,355 INFO  L175             Difference]: Start difference. First operand has 109 places, 125 transitions, 1066 flow. Second operand 9 states and 165 transitions.
[2024-06-04 16:56:07,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 163 transitions, 1516 flow
[2024-06-04 16:56:07,381 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 163 transitions, 1445 flow, removed 18 selfloop flow, removed 7 redundant places.
[2024-06-04 16:56:07,383 INFO  L231             Difference]: Finished difference. Result has 111 places, 127 transitions, 1127 flow
[2024-06-04 16:56:07,384 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-04 16:56:07,384 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places.
[2024-06-04 16:56:07,384 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 127 transitions, 1127 flow
[2024-06-04 16:56:07,384 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-04 16:56:07,385 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:56:07,385 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:56:07,385 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 16:56:07,385 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-04 16:56:07,386 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:56:07,386 INFO  L85        PathProgramCache]: Analyzing trace with hash 1732111873, now seen corresponding path program 1 times
[2024-06-04 16:56:07,386 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:56:07,386 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669310672]
[2024-06-04 16:56:07,387 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:56:07,387 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:56:07,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:56:20,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:56:20,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:56:20,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669310672]
[2024-06-04 16:56:20,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669310672] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:56:20,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:56:20,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 16:56:20,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547421717]
[2024-06-04 16:56:20,598 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:56:20,598 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 16:56:20,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:56:20,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 16:56:20,599 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 16:56:20,678 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 16:56:20,678 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-04 16:56:20,678 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:56:20,678 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 16:56:20,678 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:56:21,941 INFO  L124   PetriNetUnfolderBase]: 2180/3246 cut-off events.
[2024-06-04 16:56:21,941 INFO  L125   PetriNetUnfolderBase]: For 80476/80476 co-relation queries the response was YES.
[2024-06-04 16:56:21,949 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-04 16:56:21,959 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 130 selfloop transitions, 16 changer transitions 0/149 dead transitions.
[2024-06-04 16:56:21,959 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 149 transitions, 1569 flow
[2024-06-04 16:56:21,959 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 16:56:21,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 16:56:21,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions.
[2024-06-04 16:56:21,960 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39285714285714285
[2024-06-04 16:56:21,960 INFO  L175             Difference]: Start difference. First operand has 111 places, 127 transitions, 1127 flow. Second operand 6 states and 99 transitions.
[2024-06-04 16:56:21,960 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 149 transitions, 1569 flow
[2024-06-04 16:56:22,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 149 transitions, 1464 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-04 16:56:22,003 INFO  L231             Difference]: Finished difference. Result has 111 places, 133 transitions, 1130 flow
[2024-06-04 16:56:22,003 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-04 16:56:22,004 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places.
[2024-06-04 16:56:22,004 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 133 transitions, 1130 flow
[2024-06-04 16:56:22,004 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 16:56:22,004 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:56:22,004 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:56:22,005 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 16:56:22,005 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:56:22,005 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:56:22,005 INFO  L85        PathProgramCache]: Analyzing trace with hash -117863738, now seen corresponding path program 4 times
[2024-06-04 16:56:22,005 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:56:22,005 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645743475]
[2024-06-04 16:56:22,005 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:56:22,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:56:22,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:56:32,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:56:32,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:56:32,011 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645743475]
[2024-06-04 16:56:32,011 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645743475] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:56:32,011 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:56:32,011 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 16:56:32,011 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136963065]
[2024-06-04 16:56:32,011 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:56:32,011 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 16:56:32,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:56:32,012 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 16:56:32,012 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 16:56:32,194 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 16:56:32,195 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-04 16:56:32,195 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:56:32,195 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 16:56:32,195 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:56:33,526 INFO  L124   PetriNetUnfolderBase]: 1950/3040 cut-off events.
[2024-06-04 16:56:33,526 INFO  L125   PetriNetUnfolderBase]: For 92442/92454 co-relation queries the response was YES.
[2024-06-04 16:56:33,535 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-04 16:56:33,545 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 98 selfloop transitions, 65 changer transitions 0/175 dead transitions.
[2024-06-04 16:56:33,546 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 175 transitions, 1714 flow
[2024-06-04 16:56:33,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 16:56:33,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 16:56:33,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-04 16:56:33,548 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46296296296296297
[2024-06-04 16:56:33,549 INFO  L175             Difference]: Start difference. First operand has 111 places, 133 transitions, 1130 flow. Second operand 9 states and 175 transitions.
[2024-06-04 16:56:33,549 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 175 transitions, 1714 flow
[2024-06-04 16:56:33,589 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 175 transitions, 1676 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-04 16:56:33,591 INFO  L231             Difference]: Finished difference. Result has 118 places, 135 transitions, 1288 flow
[2024-06-04 16:56:33,592 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-04 16:56:33,592 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 75 predicate places.
[2024-06-04 16:56:33,592 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 135 transitions, 1288 flow
[2024-06-04 16:56:33,593 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-04 16:56:33,593 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:56:33,593 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:56:33,593 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 16:56:33,593 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:56:33,593 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:56:33,594 INFO  L85        PathProgramCache]: Analyzing trace with hash 645277746, now seen corresponding path program 2 times
[2024-06-04 16:56:33,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:56:33,594 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797616585]
[2024-06-04 16:56:33,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:56:33,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:56:33,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:56:43,174 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:56:43,174 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:56:43,174 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797616585]
[2024-06-04 16:56:43,174 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797616585] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:56:43,174 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:56:43,174 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 16:56:43,175 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232712581]
[2024-06-04 16:56:43,175 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:56:43,175 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 16:56:43,175 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:56:43,175 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 16:56:43,176 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 16:56:43,365 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:56:43,365 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-04 16:56:43,365 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:56:43,365 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:56:43,365 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:56:44,834 INFO  L124   PetriNetUnfolderBase]: 2150/3280 cut-off events.
[2024-06-04 16:56:44,834 INFO  L125   PetriNetUnfolderBase]: For 94782/94794 co-relation queries the response was YES.
[2024-06-04 16:56:44,842 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-04 16:56:44,851 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 106 selfloop transitions, 70 changer transitions 0/183 dead transitions.
[2024-06-04 16:56:44,851 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 183 transitions, 1922 flow
[2024-06-04 16:56:44,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 16:56:44,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 16:56:44,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions.
[2024-06-04 16:56:44,854 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4357142857142857
[2024-06-04 16:56:44,854 INFO  L175             Difference]: Start difference. First operand has 118 places, 135 transitions, 1288 flow. Second operand 10 states and 183 transitions.
[2024-06-04 16:56:44,854 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 183 transitions, 1922 flow
[2024-06-04 16:56:44,927 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 183 transitions, 1745 flow, removed 20 selfloop flow, removed 7 redundant places.
[2024-06-04 16:56:44,930 INFO  L231             Difference]: Finished difference. Result has 122 places, 142 transitions, 1350 flow
[2024-06-04 16:56:44,930 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-04 16:56:44,930 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places.
[2024-06-04 16:56:44,930 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 142 transitions, 1350 flow
[2024-06-04 16:56:44,931 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-04 16:56:44,931 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:56:44,931 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:56:44,931 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 16:56:44,931 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:56:44,931 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:56:44,931 INFO  L85        PathProgramCache]: Analyzing trace with hash 1688431584, now seen corresponding path program 2 times
[2024-06-04 16:56:44,931 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:56:44,931 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36453067]
[2024-06-04 16:56:44,931 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:56:44,932 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:56:44,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:56:54,795 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:56:54,795 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:56:54,796 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36453067]
[2024-06-04 16:56:54,796 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36453067] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:56:54,796 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:56:54,796 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 16:56:54,796 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818608583]
[2024-06-04 16:56:54,796 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:56:54,797 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 16:56:54,797 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:56:54,797 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 16:56:54,797 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 16:56:54,969 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:56:54,970 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-04 16:56:54,970 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:56:54,970 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:56:54,970 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:56:56,378 INFO  L124   PetriNetUnfolderBase]: 2167/3307 cut-off events.
[2024-06-04 16:56:56,378 INFO  L125   PetriNetUnfolderBase]: For 98467/98479 co-relation queries the response was YES.
[2024-06-04 16:56:56,387 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-04 16:56:56,397 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 134 selfloop transitions, 31 changer transitions 0/172 dead transitions.
[2024-06-04 16:56:56,397 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 172 transitions, 1800 flow
[2024-06-04 16:56:56,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 16:56:56,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 16:56:56,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-04 16:56:56,400 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3994708994708995
[2024-06-04 16:56:56,400 INFO  L175             Difference]: Start difference. First operand has 122 places, 142 transitions, 1350 flow. Second operand 9 states and 151 transitions.
[2024-06-04 16:56:56,400 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 172 transitions, 1800 flow
[2024-06-04 16:56:56,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 172 transitions, 1630 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-04 16:56:56,455 INFO  L231             Difference]: Finished difference. Result has 124 places, 144 transitions, 1303 flow
[2024-06-04 16:56:56,455 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-04 16:56:56,456 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 81 predicate places.
[2024-06-04 16:56:56,456 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 144 transitions, 1303 flow
[2024-06-04 16:56:56,456 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-04 16:56:56,456 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:56:56,457 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:56:56,457 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 16:56:56,457 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:56:56,457 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:56:56,457 INFO  L85        PathProgramCache]: Analyzing trace with hash -493970938, now seen corresponding path program 3 times
[2024-06-04 16:56:56,458 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:56:56,458 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933749852]
[2024-06-04 16:56:56,458 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:56:56,463 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:56:56,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:57:05,730 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:57:05,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:57:05,730 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933749852]
[2024-06-04 16:57:05,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933749852] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:57:05,730 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:57:05,731 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 16:57:05,731 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922133954]
[2024-06-04 16:57:05,731 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:57:05,731 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 16:57:05,731 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:57:05,732 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 16:57:05,732 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 16:57:05,950 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:57:05,950 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-04 16:57:05,950 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:57:05,951 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:57:05,951 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:57:07,358 INFO  L124   PetriNetUnfolderBase]: 2211/3371 cut-off events.
[2024-06-04 16:57:07,358 INFO  L125   PetriNetUnfolderBase]: For 105251/105263 co-relation queries the response was YES.
[2024-06-04 16:57:07,366 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-04 16:57:07,375 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 119 selfloop transitions, 60 changer transitions 0/186 dead transitions.
[2024-06-04 16:57:07,375 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 186 transitions, 1831 flow
[2024-06-04 16:57:07,377 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 16:57:07,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 16:57:07,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-04 16:57:07,378 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4312169312169312
[2024-06-04 16:57:07,378 INFO  L175             Difference]: Start difference. First operand has 124 places, 144 transitions, 1303 flow. Second operand 9 states and 163 transitions.
[2024-06-04 16:57:07,378 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 186 transitions, 1831 flow
[2024-06-04 16:57:07,429 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 186 transitions, 1726 flow, removed 23 selfloop flow, removed 7 redundant places.
[2024-06-04 16:57:07,431 INFO  L231             Difference]: Finished difference. Result has 126 places, 152 transitions, 1422 flow
[2024-06-04 16:57:07,431 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-04 16:57:07,431 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places.
[2024-06-04 16:57:07,432 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 152 transitions, 1422 flow
[2024-06-04 16:57:07,432 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-04 16:57:07,432 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:57:07,432 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:57:07,432 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 16:57:07,432 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:57:07,433 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:57:07,433 INFO  L85        PathProgramCache]: Analyzing trace with hash -257492150, now seen corresponding path program 3 times
[2024-06-04 16:57:07,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:57:07,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632888696]
[2024-06-04 16:57:07,433 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:57:07,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:57:07,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:57:17,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:57:17,481 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:57:17,481 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632888696]
[2024-06-04 16:57:17,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632888696] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:57:17,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:57:17,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 16:57:17,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320992214]
[2024-06-04 16:57:17,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:57:17,481 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 16:57:17,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:57:17,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 16:57:17,482 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 16:57:17,798 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:57:17,798 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-04 16:57:17,798 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:57:17,798 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:57:17,799 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:57:19,163 INFO  L124   PetriNetUnfolderBase]: 2228/3398 cut-off events.
[2024-06-04 16:57:19,163 INFO  L125   PetriNetUnfolderBase]: For 112444/112456 co-relation queries the response was YES.
[2024-06-04 16:57:19,173 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-04 16:57:19,183 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 130 selfloop transitions, 50 changer transitions 0/187 dead transitions.
[2024-06-04 16:57:19,183 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 187 transitions, 2072 flow
[2024-06-04 16:57:19,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 16:57:19,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 16:57:19,185 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-04 16:57:19,185 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4074074074074074
[2024-06-04 16:57:19,185 INFO  L175             Difference]: Start difference. First operand has 126 places, 152 transitions, 1422 flow. Second operand 9 states and 154 transitions.
[2024-06-04 16:57:19,185 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 187 transitions, 2072 flow
[2024-06-04 16:57:19,252 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 187 transitions, 1983 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-04 16:57:19,255 INFO  L231             Difference]: Finished difference. Result has 129 places, 156 transitions, 1560 flow
[2024-06-04 16:57:19,255 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-04 16:57:19,255 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places.
[2024-06-04 16:57:19,256 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 156 transitions, 1560 flow
[2024-06-04 16:57:19,256 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-04 16:57:19,256 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:57:19,256 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:57:19,256 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 16:57:19,256 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:57:19,257 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:57:19,257 INFO  L85        PathProgramCache]: Analyzing trace with hash -257788820, now seen corresponding path program 4 times
[2024-06-04 16:57:19,257 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:57:19,257 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514430595]
[2024-06-04 16:57:19,257 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:57:19,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:57:19,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:57:29,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:57:29,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:57:29,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514430595]
[2024-06-04 16:57:29,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514430595] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:57:29,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:57:29,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 16:57:29,457 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581950884]
[2024-06-04 16:57:29,457 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:57:29,458 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 16:57:29,458 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:57:29,458 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 16:57:29,458 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 16:57:29,605 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:57:29,605 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-04 16:57:29,605 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:57:29,605 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:57:29,606 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:57:31,081 INFO  L124   PetriNetUnfolderBase]: 2220/3386 cut-off events.
[2024-06-04 16:57:31,081 INFO  L125   PetriNetUnfolderBase]: For 105414/105426 co-relation queries the response was YES.
[2024-06-04 16:57:31,091 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-04 16:57:31,103 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 137 selfloop transitions, 44 changer transitions 0/188 dead transitions.
[2024-06-04 16:57:31,103 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 188 transitions, 2002 flow
[2024-06-04 16:57:31,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 16:57:31,103 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 16:57:31,104 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions.
[2024-06-04 16:57:31,104 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3952380952380952
[2024-06-04 16:57:31,104 INFO  L175             Difference]: Start difference. First operand has 129 places, 156 transitions, 1560 flow. Second operand 10 states and 166 transitions.
[2024-06-04 16:57:31,104 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 188 transitions, 2002 flow
[2024-06-04 16:57:31,175 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 188 transitions, 1862 flow, removed 45 selfloop flow, removed 5 redundant places.
[2024-06-04 16:57:31,177 INFO  L231             Difference]: Finished difference. Result has 134 places, 156 transitions, 1516 flow
[2024-06-04 16:57:31,177 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-04 16:57:31,177 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places.
[2024-06-04 16:57:31,177 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 156 transitions, 1516 flow
[2024-06-04 16:57:31,178 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-04 16:57:31,178 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:57:31,178 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:57:31,178 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 16:57:31,178 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:57:31,178 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:57:31,178 INFO  L85        PathProgramCache]: Analyzing trace with hash -266069788, now seen corresponding path program 4 times
[2024-06-04 16:57:31,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:57:31,179 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118291738]
[2024-06-04 16:57:31,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:57:31,179 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:57:31,235 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:57:40,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:57:40,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:57:40,871 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118291738]
[2024-06-04 16:57:40,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118291738] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:57:40,871 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:57:40,871 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 16:57:40,871 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576779452]
[2024-06-04 16:57:40,871 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:57:40,871 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 16:57:40,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:57:40,872 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 16:57:40,872 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 16:57:41,098 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:57:41,099 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-04 16:57:41,099 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:57:41,099 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:57:41,099 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:57:42,495 INFO  L124   PetriNetUnfolderBase]: 2210/3372 cut-off events.
[2024-06-04 16:57:42,495 INFO  L125   PetriNetUnfolderBase]: For 108625/108637 co-relation queries the response was YES.
[2024-06-04 16:57:42,505 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-04 16:57:42,516 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 124 selfloop transitions, 61 changer transitions 0/192 dead transitions.
[2024-06-04 16:57:42,516 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 192 transitions, 1996 flow
[2024-06-04 16:57:42,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 16:57:42,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 16:57:42,519 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-04 16:57:42,519 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 16:57:42,519 INFO  L175             Difference]: Start difference. First operand has 134 places, 156 transitions, 1516 flow. Second operand 9 states and 162 transitions.
[2024-06-04 16:57:42,519 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 192 transitions, 1996 flow
[2024-06-04 16:57:42,646 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 192 transitions, 1867 flow, removed 16 selfloop flow, removed 9 redundant places.
[2024-06-04 16:57:42,648 INFO  L231             Difference]: Finished difference. Result has 134 places, 158 transitions, 1539 flow
[2024-06-04 16:57:42,648 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-04 16:57:42,648 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places.
[2024-06-04 16:57:42,648 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 158 transitions, 1539 flow
[2024-06-04 16:57:42,649 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-04 16:57:42,649 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:57:42,649 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:57:42,649 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 16:57:42,649 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:57:42,650 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:57:42,650 INFO  L85        PathProgramCache]: Analyzing trace with hash 1743539713, now seen corresponding path program 2 times
[2024-06-04 16:57:42,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:57:42,650 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116298220]
[2024-06-04 16:57:42,650 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:57:42,650 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:57:42,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:57:56,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:57:56,408 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:57:56,408 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116298220]
[2024-06-04 16:57:56,408 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116298220] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:57:56,408 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:57:56,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 16:57:56,409 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169659231]
[2024-06-04 16:57:56,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:57:56,409 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 16:57:56,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:57:56,409 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 16:57:56,409 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 16:57:56,539 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 16:57:56,539 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-04 16:57:56,539 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:57:56,540 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 16:57:56,540 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:57:57,905 INFO  L124   PetriNetUnfolderBase]: 2340/3501 cut-off events.
[2024-06-04 16:57:57,905 INFO  L125   PetriNetUnfolderBase]: For 113497/113509 co-relation queries the response was YES.
[2024-06-04 16:57:57,914 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-04 16:57:57,925 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 148 selfloop transitions, 16 changer transitions 0/167 dead transitions.
[2024-06-04 16:57:57,925 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 167 transitions, 1889 flow
[2024-06-04 16:57:57,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 16:57:57,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 16:57:57,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions.
[2024-06-04 16:57:57,926 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36507936507936506
[2024-06-04 16:57:57,926 INFO  L175             Difference]: Start difference. First operand has 134 places, 158 transitions, 1539 flow. Second operand 6 states and 92 transitions.
[2024-06-04 16:57:57,926 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 167 transitions, 1889 flow
[2024-06-04 16:57:57,995 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 167 transitions, 1767 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-04 16:57:57,997 INFO  L231             Difference]: Finished difference. Result has 134 places, 158 transitions, 1455 flow
[2024-06-04 16:57:57,997 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-04 16:57:57,998 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places.
[2024-06-04 16:57:57,998 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 158 transitions, 1455 flow
[2024-06-04 16:57:57,998 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 16:57:57,998 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:57:57,998 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:57:57,998 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 16:57:57,999 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:57:57,999 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:57:57,999 INFO  L85        PathProgramCache]: Analyzing trace with hash 1737831745, now seen corresponding path program 1 times
[2024-06-04 16:57:57,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:57:57,999 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405096826]
[2024-06-04 16:57:57,999 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:57:57,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:57:58,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:58:10,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:58:10,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:58:10,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405096826]
[2024-06-04 16:58:10,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405096826] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:58:10,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:58:10,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 16:58:10,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723557553]
[2024-06-04 16:58:10,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:58:10,201 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 16:58:10,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:58:10,202 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 16:58:10,202 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 16:58:10,354 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:58:10,354 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-04 16:58:10,354 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:58:10,354 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:58:10,354 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:58:11,465 INFO  L124   PetriNetUnfolderBase]: 2096/3232 cut-off events.
[2024-06-04 16:58:11,466 INFO  L125   PetriNetUnfolderBase]: For 95453/95453 co-relation queries the response was YES.
[2024-06-04 16:58:11,475 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-04 16:58:11,485 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 157 selfloop transitions, 16 changer transitions 0/177 dead transitions.
[2024-06-04 16:58:11,485 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 177 transitions, 1947 flow
[2024-06-04 16:58:11,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 16:58:11,486 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 16:58:11,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions.
[2024-06-04 16:58:11,486 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4007936507936508
[2024-06-04 16:58:11,486 INFO  L175             Difference]: Start difference. First operand has 134 places, 158 transitions, 1455 flow. Second operand 6 states and 101 transitions.
[2024-06-04 16:58:11,486 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 177 transitions, 1947 flow
[2024-06-04 16:58:11,551 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 177 transitions, 1907 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-04 16:58:11,553 INFO  L231             Difference]: Finished difference. Result has 135 places, 164 transitions, 1515 flow
[2024-06-04 16:58:11,554 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-04 16:58:11,554 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 92 predicate places.
[2024-06-04 16:58:11,554 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 164 transitions, 1515 flow
[2024-06-04 16:58:11,554 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-04 16:58:11,554 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:58:11,554 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:58:11,554 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 16:58:11,554 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:58:11,555 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:58:11,555 INFO  L85        PathProgramCache]: Analyzing trace with hash -1606749021, now seen corresponding path program 2 times
[2024-06-04 16:58:11,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:58:11,555 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259570396]
[2024-06-04 16:58:11,555 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:58:11,555 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:58:11,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:58:23,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:58:23,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:58:23,609 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259570396]
[2024-06-04 16:58:23,609 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259570396] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:58:23,609 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:58:23,609 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 16:58:23,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229128464]
[2024-06-04 16:58:23,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:58:23,609 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 16:58:23,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:58:23,610 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 16:58:23,610 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 16:58:23,751 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:58:23,751 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-04 16:58:23,751 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:58:23,751 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:58:23,751 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:58:24,935 INFO  L124   PetriNetUnfolderBase]: 2093/3228 cut-off events.
[2024-06-04 16:58:24,936 INFO  L125   PetriNetUnfolderBase]: For 101279/101279 co-relation queries the response was YES.
[2024-06-04 16:58:24,944 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-04 16:58:24,954 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 158 selfloop transitions, 11 changer transitions 0/173 dead transitions.
[2024-06-04 16:58:24,954 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 173 transitions, 1875 flow
[2024-06-04 16:58:24,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 16:58:24,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 16:58:24,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions.
[2024-06-04 16:58:24,955 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.376984126984127
[2024-06-04 16:58:24,955 INFO  L175             Difference]: Start difference. First operand has 135 places, 164 transitions, 1515 flow. Second operand 6 states and 95 transitions.
[2024-06-04 16:58:24,955 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 173 transitions, 1875 flow
[2024-06-04 16:58:25,017 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 173 transitions, 1827 flow, removed 20 selfloop flow, removed 2 redundant places.
[2024-06-04 16:58:25,019 INFO  L231             Difference]: Finished difference. Result has 139 places, 164 transitions, 1495 flow
[2024-06-04 16:58:25,019 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-04 16:58:25,019 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 96 predicate places.
[2024-06-04 16:58:25,020 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 164 transitions, 1495 flow
[2024-06-04 16:58:25,020 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-04 16:58:25,020 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:58:25,020 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:58:25,020 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 16:58:25,020 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:58:25,020 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:58:25,020 INFO  L85        PathProgramCache]: Analyzing trace with hash -122922234, now seen corresponding path program 1 times
[2024-06-04 16:58:25,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:58:25,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146236086]
[2024-06-04 16:58:25,021 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:58:25,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:58:25,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:58:35,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:58:35,614 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:58:35,614 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146236086]
[2024-06-04 16:58:35,614 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146236086] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:58:35,614 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:58:35,614 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 16:58:35,614 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226289195]
[2024-06-04 16:58:35,614 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:58:35,615 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 16:58:35,615 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:58:35,615 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 16:58:35,615 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 16:58:35,813 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:58:35,816 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-04 16:58:35,816 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:58:35,816 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:58:35,816 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:58:37,478 INFO  L124   PetriNetUnfolderBase]: 2341/3571 cut-off events.
[2024-06-04 16:58:37,478 INFO  L125   PetriNetUnfolderBase]: For 138122/138122 co-relation queries the response was YES.
[2024-06-04 16:58:37,489 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-04 16:58:37,502 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 188 selfloop transitions, 26 changer transitions 0/223 dead transitions.
[2024-06-04 16:58:37,502 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 223 transitions, 2148 flow
[2024-06-04 16:58:37,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 16:58:37,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 16:58:37,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions.
[2024-06-04 16:58:37,505 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41774891774891776
[2024-06-04 16:58:37,505 INFO  L175             Difference]: Start difference. First operand has 139 places, 164 transitions, 1495 flow. Second operand 11 states and 193 transitions.
[2024-06-04 16:58:37,505 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 223 transitions, 2148 flow
[2024-06-04 16:58:37,591 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 223 transitions, 2118 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-04 16:58:37,593 INFO  L231             Difference]: Finished difference. Result has 147 places, 171 transitions, 1628 flow
[2024-06-04 16:58:37,594 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-04 16:58:37,594 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places.
[2024-06-04 16:58:37,594 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 171 transitions, 1628 flow
[2024-06-04 16:58:37,594 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-04 16:58:37,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:58:37,595 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:58:37,595 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 16:58:37,595 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:58:37,595 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:58:37,595 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139404587, now seen corresponding path program 1 times
[2024-06-04 16:58:37,595 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:58:37,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524242252]
[2024-06-04 16:58:37,596 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:58:37,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:58:37,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:58:53,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:58:53,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:58:53,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524242252]
[2024-06-04 16:58:53,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524242252] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:58:53,501 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:58:53,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 16:58:53,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095938284]
[2024-06-04 16:58:53,501 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:58:53,502 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 16:58:53,502 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:58:53,502 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 16:58:53,502 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-04 16:58:53,674 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 16:58:53,675 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-04 16:58:53,675 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:58:53,675 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 16:58:53,675 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:58:55,085 INFO  L124   PetriNetUnfolderBase]: 2466/3700 cut-off events.
[2024-06-04 16:58:55,085 INFO  L125   PetriNetUnfolderBase]: For 137427/137427 co-relation queries the response was YES.
[2024-06-04 16:58:55,097 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-04 16:58:55,111 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 173 selfloop transitions, 26 changer transitions 0/202 dead transitions.
[2024-06-04 16:58:55,111 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 202 transitions, 2220 flow
[2024-06-04 16:58:55,112 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 16:58:55,112 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 16:58:55,113 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-04 16:58:55,113 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-04 16:58:55,113 INFO  L175             Difference]: Start difference. First operand has 147 places, 171 transitions, 1628 flow. Second operand 7 states and 119 transitions.
[2024-06-04 16:58:55,113 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 202 transitions, 2220 flow
[2024-06-04 16:58:55,208 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 202 transitions, 2148 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-04 16:58:55,211 INFO  L231             Difference]: Finished difference. Result has 147 places, 177 transitions, 1685 flow
[2024-06-04 16:58:55,211 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-04 16:58:55,211 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places.
[2024-06-04 16:58:55,211 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 177 transitions, 1685 flow
[2024-06-04 16:58:55,212 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 16:58:55,212 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:58:55,212 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:58:55,212 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 16:58:55,212 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:58:55,212 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:58:55,212 INFO  L85        PathProgramCache]: Analyzing trace with hash -193136454, now seen corresponding path program 2 times
[2024-06-04 16:58:55,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:58:55,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805522099]
[2024-06-04 16:58:55,213 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:58:55,213 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:58:55,286 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:03,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:59:03,681 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:03,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805522099]
[2024-06-04 16:59:03,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805522099] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:03,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:03,682 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 16:59:03,682 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585158116]
[2024-06-04 16:59:03,682 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:03,682 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 16:59:03,682 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:03,683 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 16:59:03,683 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 16:59:03,936 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:59:03,936 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-04 16:59:03,936 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:03,936 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:59:03,936 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:05,531 INFO  L124   PetriNetUnfolderBase]: 2447/3731 cut-off events.
[2024-06-04 16:59:05,531 INFO  L125   PetriNetUnfolderBase]: For 157147/157147 co-relation queries the response was YES.
[2024-06-04 16:59:05,542 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-04 16:59:05,553 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 159 selfloop transitions, 46 changer transitions 0/216 dead transitions.
[2024-06-04 16:59:05,554 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 216 transitions, 2247 flow
[2024-06-04 16:59:05,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 16:59:05,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 16:59:05,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-04 16:59:05,556 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 16:59:05,556 INFO  L175             Difference]: Start difference. First operand has 147 places, 177 transitions, 1685 flow. Second operand 9 states and 162 transitions.
[2024-06-04 16:59:05,556 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 216 transitions, 2247 flow
[2024-06-04 16:59:05,656 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 216 transitions, 2197 flow, removed 16 selfloop flow, removed 3 redundant places.
[2024-06-04 16:59:05,658 INFO  L231             Difference]: Finished difference. Result has 153 places, 178 transitions, 1782 flow
[2024-06-04 16:59:05,659 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-04 16:59:05,659 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places.
[2024-06-04 16:59:05,659 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 178 transitions, 1782 flow
[2024-06-04 16:59:05,659 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-04 16:59:05,659 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:05,659 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:05,660 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 16:59:05,660 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:59:05,660 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:05,660 INFO  L85        PathProgramCache]: Analyzing trace with hash -838291630, now seen corresponding path program 3 times
[2024-06-04 16:59:05,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:05,660 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026767993]
[2024-06-04 16:59:05,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:05,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:05,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:15,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:59:15,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:15,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026767993]
[2024-06-04 16:59:15,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026767993] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:15,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:15,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 16:59:15,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951855448]
[2024-06-04 16:59:15,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:15,612 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 16:59:15,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:15,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 16:59:15,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 16:59:15,791 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:59:15,791 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-04 16:59:15,792 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:15,792 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:59:15,792 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:17,775 INFO  L124   PetriNetUnfolderBase]: 2745/4219 cut-off events.
[2024-06-04 16:59:17,775 INFO  L125   PetriNetUnfolderBase]: For 182983/182983 co-relation queries the response was YES.
[2024-06-04 16:59:17,788 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-04 16:59:17,800 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 194 selfloop transitions, 30 changer transitions 0/235 dead transitions.
[2024-06-04 16:59:17,800 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 235 transitions, 2698 flow
[2024-06-04 16:59:17,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 16:59:17,802 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 16:59:17,803 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions.
[2024-06-04 16:59:17,803 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42142857142857143
[2024-06-04 16:59:17,803 INFO  L175             Difference]: Start difference. First operand has 153 places, 178 transitions, 1782 flow. Second operand 10 states and 177 transitions.
[2024-06-04 16:59:17,803 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 235 transitions, 2698 flow
[2024-06-04 16:59:17,947 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 235 transitions, 2554 flow, removed 25 selfloop flow, removed 7 redundant places.
[2024-06-04 16:59:17,950 INFO  L231             Difference]: Finished difference. Result has 158 places, 187 transitions, 1939 flow
[2024-06-04 16:59:17,950 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-04 16:59:17,951 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places.
[2024-06-04 16:59:17,951 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 187 transitions, 1939 flow
[2024-06-04 16:59:17,951 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-04 16:59:17,951 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:17,951 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:17,951 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 16:59:17,951 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:59:17,952 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:17,952 INFO  L85        PathProgramCache]: Analyzing trace with hash -838299070, now seen corresponding path program 4 times
[2024-06-04 16:59:17,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:17,952 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345447083]
[2024-06-04 16:59:17,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:17,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:17,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:27,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-04 16:59:27,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:27,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345447083]
[2024-06-04 16:59:27,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345447083] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:27,904 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:27,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 16:59:27,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457727274]
[2024-06-04 16:59:27,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:27,904 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 16:59:27,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:27,905 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 16:59:27,905 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 16:59:28,075 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 16:59:28,076 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-04 16:59:28,076 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:28,076 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 16:59:28,076 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:29,942 INFO  L124   PetriNetUnfolderBase]: 2766/4262 cut-off events.
[2024-06-04 16:59:29,942 INFO  L125   PetriNetUnfolderBase]: For 187361/187361 co-relation queries the response was YES.
[2024-06-04 16:59:29,957 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-04 16:59:29,972 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 191 selfloop transitions, 29 changer transitions 0/231 dead transitions.
[2024-06-04 16:59:29,973 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 231 transitions, 2556 flow
[2024-06-04 16:59:29,975 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 16:59:29,975 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 16:59:29,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-04 16:59:29,975 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4119047619047619
[2024-06-04 16:59:29,976 INFO  L175             Difference]: Start difference. First operand has 158 places, 187 transitions, 1939 flow. Second operand 10 states and 173 transitions.
[2024-06-04 16:59:29,976 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 231 transitions, 2556 flow
[2024-06-04 16:59:30,189 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 231 transitions, 2494 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-04 16:59:30,192 INFO  L231             Difference]: Finished difference. Result has 164 places, 190 transitions, 2018 flow
[2024-06-04 16:59:30,192 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-04 16:59:30,192 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places.
[2024-06-04 16:59:30,192 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 190 transitions, 2018 flow
[2024-06-04 16:59:30,193 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-04 16:59:30,193 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:30,193 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:30,193 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 16:59:30,193 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:59:30,194 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:30,194 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139106057, now seen corresponding path program 2 times
[2024-06-04 16:59:30,194 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:30,194 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560605698]
[2024-06-04 16:59:30,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:30,195 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:30,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:45,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:59:45,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:45,388 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560605698]
[2024-06-04 16:59:45,388 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560605698] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:45,388 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:45,388 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 16:59:45,389 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054785185]
[2024-06-04 16:59:45,389 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:45,389 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 16:59:45,389 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:45,389 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 16:59:45,389 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-04 16:59:45,462 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 16:59:45,463 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-04 16:59:45,463 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:45,463 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 16:59:45,463 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:47,193 INFO  L124   PetriNetUnfolderBase]: 2881/4381 cut-off events.
[2024-06-04 16:59:47,193 INFO  L125   PetriNetUnfolderBase]: For 183836/183836 co-relation queries the response was YES.
[2024-06-04 16:59:47,210 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-04 16:59:47,225 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 188 selfloop transitions, 30 changer transitions 0/221 dead transitions.
[2024-06-04 16:59:47,225 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 221 transitions, 2632 flow
[2024-06-04 16:59:47,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 16:59:47,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 16:59:47,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions.
[2024-06-04 16:59:47,226 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37566137566137564
[2024-06-04 16:59:47,226 INFO  L175             Difference]: Start difference. First operand has 164 places, 190 transitions, 2018 flow. Second operand 9 states and 142 transitions.
[2024-06-04 16:59:47,226 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 221 transitions, 2632 flow
[2024-06-04 16:59:47,358 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 221 transitions, 2540 flow, removed 15 selfloop flow, removed 8 redundant places.
[2024-06-04 16:59:47,361 INFO  L231             Difference]: Finished difference. Result has 165 places, 193 transitions, 2024 flow
[2024-06-04 16:59:47,361 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-04 16:59:47,361 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 122 predicate places.
[2024-06-04 16:59:47,362 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 193 transitions, 2024 flow
[2024-06-04 16:59:47,362 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 16:59:47,362 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:47,362 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:47,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 16:59:47,362 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-04 16:59:47,362 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:47,362 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139105685, now seen corresponding path program 1 times
[2024-06-04 16:59:47,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:47,362 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860272874]
[2024-06-04 16:59:47,362 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:47,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:47,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:02,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:02,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:02,345 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860272874]
[2024-06-04 17:00:02,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860272874] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:02,345 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:02,345 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:00:02,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35408484]
[2024-06-04 17:00:02,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:02,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:00:02,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:02,346 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:00:02,346 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:00:02,476 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 17:00:02,476 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-04 17:00:02,476 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:02,476 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 17:00:02,476 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:04,127 INFO  L124   PetriNetUnfolderBase]: 2886/4388 cut-off events.
[2024-06-04 17:00:04,127 INFO  L125   PetriNetUnfolderBase]: For 187146/187146 co-relation queries the response was YES.
[2024-06-04 17:00:04,144 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-04 17:00:04,157 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 193 selfloop transitions, 23 changer transitions 0/219 dead transitions.
[2024-06-04 17:00:04,157 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 219 transitions, 2662 flow
[2024-06-04 17:00:04,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:00:04,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:00:04,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-04 17:00:04,158 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38095238095238093
[2024-06-04 17:00:04,158 INFO  L175             Difference]: Start difference. First operand has 165 places, 193 transitions, 2024 flow. Second operand 7 states and 112 transitions.
[2024-06-04 17:00:04,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 219 transitions, 2662 flow
[2024-06-04 17:00:04,295 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 219 transitions, 2582 flow, removed 10 selfloop flow, removed 7 redundant places.
[2024-06-04 17:00:04,298 INFO  L231             Difference]: Finished difference. Result has 166 places, 202 transitions, 2104 flow
[2024-06-04 17:00:04,298 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-04 17:00:04,299 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 123 predicate places.
[2024-06-04 17:00:04,299 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 202 transitions, 2104 flow
[2024-06-04 17:00:04,299 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:04,299 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:04,299 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:04,299 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 17:00:04,299 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:04,300 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:04,300 INFO  L85        PathProgramCache]: Analyzing trace with hash -457528512, now seen corresponding path program 5 times
[2024-06-04 17:00:04,300 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:04,300 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208551365]
[2024-06-04 17:00:04,300 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:04,300 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:04,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:15,359 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:15,359 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:15,360 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208551365]
[2024-06-04 17:00:15,360 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208551365] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:15,360 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:15,360 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:00:15,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077636054]
[2024-06-04 17:00:15,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:15,361 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:00:15,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:15,362 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:00:15,362 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:00:15,693 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:00:15,693 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-04 17:00:15,693 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:15,693 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:00:15,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:17,624 INFO  L124   PetriNetUnfolderBase]: 2965/4589 cut-off events.
[2024-06-04 17:00:17,624 INFO  L125   PetriNetUnfolderBase]: For 225386/225395 co-relation queries the response was YES.
[2024-06-04 17:00:17,640 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-04 17:00:17,654 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 166 selfloop transitions, 72 changer transitions 0/250 dead transitions.
[2024-06-04 17:00:17,654 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 250 transitions, 2950 flow
[2024-06-04 17:00:17,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:00:17,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:00:17,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions.
[2024-06-04 17:00:17,657 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4261904761904762
[2024-06-04 17:00:17,657 INFO  L175             Difference]: Start difference. First operand has 166 places, 202 transitions, 2104 flow. Second operand 10 states and 179 transitions.
[2024-06-04 17:00:17,657 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 250 transitions, 2950 flow
[2024-06-04 17:00:17,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 250 transitions, 2906 flow, removed 19 selfloop flow, removed 2 redundant places.
[2024-06-04 17:00:17,840 INFO  L231             Difference]: Finished difference. Result has 175 places, 205 transitions, 2344 flow
[2024-06-04 17:00:17,840 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-04 17:00:17,840 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 132 predicate places.
[2024-06-04 17:00:17,841 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 205 transitions, 2344 flow
[2024-06-04 17:00:17,841 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-04 17:00:17,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:17,841 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:17,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 17:00:17,841 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:17,841 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:17,841 INFO  L85        PathProgramCache]: Analyzing trace with hash 598482770, now seen corresponding path program 6 times
[2024-06-04 17:00:17,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:17,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990138170]
[2024-06-04 17:00:17,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:17,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:17,882 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:28,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:28,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:28,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990138170]
[2024-06-04 17:00:28,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990138170] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:28,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:28,819 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:00:28,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023049220]
[2024-06-04 17:00:28,819 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:28,820 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:00:28,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:28,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:00:28,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:00:29,097 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:00:29,098 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-04 17:00:29,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:29,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:00:29,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:31,316 INFO  L124   PetriNetUnfolderBase]: 3248/5052 cut-off events.
[2024-06-04 17:00:31,316 INFO  L125   PetriNetUnfolderBase]: For 259278/259287 co-relation queries the response was YES.
[2024-06-04 17:00:31,335 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-04 17:00:31,352 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 181 selfloop transitions, 67 changer transitions 0/260 dead transitions.
[2024-06-04 17:00:31,352 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 260 transitions, 3269 flow
[2024-06-04 17:00:31,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 17:00:31,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 17:00:31,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions.
[2024-06-04 17:00:31,355 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42424242424242425
[2024-06-04 17:00:31,355 INFO  L175             Difference]: Start difference. First operand has 175 places, 205 transitions, 2344 flow. Second operand 11 states and 196 transitions.
[2024-06-04 17:00:31,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 260 transitions, 3269 flow
[2024-06-04 17:00:31,593 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 260 transitions, 3196 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-04 17:00:31,596 INFO  L231             Difference]: Finished difference. Result has 182 places, 211 transitions, 2569 flow
[2024-06-04 17:00:31,597 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-04 17:00:31,597 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-04 17:00:31,597 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 211 transitions, 2569 flow
[2024-06-04 17:00:31,597 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-04 17:00:31,597 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:31,597 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:31,597 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 17:00:31,598 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:31,598 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:31,598 INFO  L85        PathProgramCache]: Analyzing trace with hash 840648814, now seen corresponding path program 7 times
[2024-06-04 17:00:31,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:31,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139857746]
[2024-06-04 17:00:31,598 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:31,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:31,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:39,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:39,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:39,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139857746]
[2024-06-04 17:00:39,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139857746] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:39,641 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:39,641 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:00:39,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341176708]
[2024-06-04 17:00:39,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:39,641 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:00:39,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:39,642 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:00:39,642 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:00:39,901 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:00:39,901 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-04 17:00:39,901 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:39,901 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:00:39,902 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:41,960 INFO  L124   PetriNetUnfolderBase]: 3290/5128 cut-off events.
[2024-06-04 17:00:41,960 INFO  L125   PetriNetUnfolderBase]: For 269066/269078 co-relation queries the response was YES.
[2024-06-04 17:00:41,978 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-04 17:00:41,993 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 171 selfloop transitions, 67 changer transitions 0/250 dead transitions.
[2024-06-04 17:00:41,993 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 250 transitions, 3223 flow
[2024-06-04 17:00:41,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:00:41,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:00:41,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-04 17:00:41,996 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43386243386243384
[2024-06-04 17:00:41,996 INFO  L175             Difference]: Start difference. First operand has 182 places, 211 transitions, 2569 flow. Second operand 9 states and 164 transitions.
[2024-06-04 17:00:41,996 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 250 transitions, 3223 flow
[2024-06-04 17:00:42,250 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 250 transitions, 3108 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-04 17:00:42,253 INFO  L231             Difference]: Finished difference. Result has 185 places, 214 transitions, 2674 flow
[2024-06-04 17:00:42,253 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-04 17:00:42,253 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places.
[2024-06-04 17:00:42,253 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 214 transitions, 2674 flow
[2024-06-04 17:00:42,254 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-04 17:00:42,254 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:42,254 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:42,254 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 17:00:42,254 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:42,254 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:42,255 INFO  L85        PathProgramCache]: Analyzing trace with hash 1861409572, now seen corresponding path program 8 times
[2024-06-04 17:00:42,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:42,255 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632529737]
[2024-06-04 17:00:42,255 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:42,255 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:42,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:53,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:53,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:53,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632529737]
[2024-06-04 17:00:53,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632529737] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:53,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:53,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:00:53,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906591442]
[2024-06-04 17:00:53,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:53,589 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:00:53,589 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:53,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:00:53,590 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:00:53,813 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:00:53,813 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-04 17:00:53,813 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:53,813 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:00:53,813 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:56,153 INFO  L124   PetriNetUnfolderBase]: 3332/5200 cut-off events.
[2024-06-04 17:00:56,153 INFO  L125   PetriNetUnfolderBase]: For 273386/273395 co-relation queries the response was YES.
[2024-06-04 17:00:56,174 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-04 17:00:56,192 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 159 selfloop transitions, 94 changer transitions 0/265 dead transitions.
[2024-06-04 17:00:56,192 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 265 transitions, 3384 flow
[2024-06-04 17:00:56,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 17:00:56,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 17:00:56,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions.
[2024-06-04 17:00:56,195 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4329004329004329
[2024-06-04 17:00:56,195 INFO  L175             Difference]: Start difference. First operand has 185 places, 214 transitions, 2674 flow. Second operand 11 states and 200 transitions.
[2024-06-04 17:00:56,195 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 265 transitions, 3384 flow
[2024-06-04 17:00:56,462 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 265 transitions, 3226 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-04 17:00:56,465 INFO  L231             Difference]: Finished difference. Result has 189 places, 217 transitions, 2784 flow
[2024-06-04 17:00:56,466 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-04 17:00:56,466 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 146 predicate places.
[2024-06-04 17:00:56,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 217 transitions, 2784 flow
[2024-06-04 17:00:56,466 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-04 17:00:56,467 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:56,467 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:56,467 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 17:00:56,467 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:56,467 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:56,467 INFO  L85        PathProgramCache]: Analyzing trace with hash 1866771952, now seen corresponding path program 9 times
[2024-06-04 17:00:56,468 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:56,468 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135370378]
[2024-06-04 17:00:56,468 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:56,468 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:56,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:07,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:01:07,792 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:07,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135370378]
[2024-06-04 17:01:07,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135370378] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:07,792 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:07,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:01:07,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028120375]
[2024-06-04 17:01:07,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:07,793 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:01:07,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:07,793 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:01:07,793 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:01:07,998 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:01:07,999 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-04 17:01:07,999 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:07,999 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:01:07,999 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:10,320 INFO  L124   PetriNetUnfolderBase]: 3407/5325 cut-off events.
[2024-06-04 17:01:10,320 INFO  L125   PetriNetUnfolderBase]: For 286557/286566 co-relation queries the response was YES.
[2024-06-04 17:01:10,344 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-04 17:01:10,364 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 166 selfloop transitions, 89 changer transitions 0/267 dead transitions.
[2024-06-04 17:01:10,364 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 267 transitions, 3491 flow
[2024-06-04 17:01:10,366 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 17:01:10,367 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 17:01:10,367 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions.
[2024-06-04 17:01:10,367 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43506493506493504
[2024-06-04 17:01:10,367 INFO  L175             Difference]: Start difference. First operand has 189 places, 217 transitions, 2784 flow. Second operand 11 states and 201 transitions.
[2024-06-04 17:01:10,367 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 267 transitions, 3491 flow
[2024-06-04 17:01:10,635 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 267 transitions, 3275 flow, removed 17 selfloop flow, removed 9 redundant places.
[2024-06-04 17:01:10,640 INFO  L231             Difference]: Finished difference. Result has 191 places, 219 transitions, 2819 flow
[2024-06-04 17:01:10,640 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-04 17:01:10,641 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places.
[2024-06-04 17:01:10,641 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 219 transitions, 2819 flow
[2024-06-04 17:01:10,641 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-04 17:01:10,641 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:10,641 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:10,642 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 17:01:10,642 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:01:10,642 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:10,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 1866981202, now seen corresponding path program 10 times
[2024-06-04 17:01:10,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:10,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574597473]
[2024-06-04 17:01:10,643 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:10,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:10,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:20,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:01:20,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:20,876 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574597473]
[2024-06-04 17:01:20,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574597473] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:20,877 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:20,877 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:01:20,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265947522]
[2024-06-04 17:01:20,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:20,877 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:01:20,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:20,877 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:01:20,878 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:01:21,103 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:01:21,104 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-04 17:01:21,104 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:21,104 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:01:21,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:23,421 INFO  L124   PetriNetUnfolderBase]: 3415/5345 cut-off events.
[2024-06-04 17:01:23,421 INFO  L125   PetriNetUnfolderBase]: For 287715/287724 co-relation queries the response was YES.
[2024-06-04 17:01:23,443 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-04 17:01:23,462 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 209 selfloop transitions, 42 changer transitions 0/263 dead transitions.
[2024-06-04 17:01:23,463 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 263 transitions, 3654 flow
[2024-06-04 17:01:23,465 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:01:23,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:01:23,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions.
[2024-06-04 17:01:23,465 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4238095238095238
[2024-06-04 17:01:23,465 INFO  L175             Difference]: Start difference. First operand has 191 places, 219 transitions, 2819 flow. Second operand 10 states and 178 transitions.
[2024-06-04 17:01:23,465 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 263 transitions, 3654 flow
[2024-06-04 17:01:23,777 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 263 transitions, 3374 flow, removed 21 selfloop flow, removed 11 redundant places.
[2024-06-04 17:01:23,780 INFO  L231             Difference]: Finished difference. Result has 190 places, 220 transitions, 2680 flow
[2024-06-04 17:01:23,781 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-04 17:01:23,781 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-04 17:01:23,781 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 220 transitions, 2680 flow
[2024-06-04 17:01:23,782 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-04 17:01:23,782 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:23,782 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:23,782 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 17:01:23,782 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-04 17:01:23,783 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:23,783 INFO  L85        PathProgramCache]: Analyzing trace with hash -1784426935, now seen corresponding path program 2 times
[2024-06-04 17:01:23,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:23,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352424953]
[2024-06-04 17:01:23,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:23,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:23,816 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:38,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:01:38,448 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:38,448 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352424953]
[2024-06-04 17:01:38,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352424953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:38,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:38,449 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:01:38,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867217988]
[2024-06-04 17:01:38,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:38,449 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:01:38,449 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:38,449 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:01:38,449 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:01:38,583 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 17:01:38,583 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-04 17:01:38,583 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:38,583 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 17:01:38,583 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:40,673 INFO  L124   PetriNetUnfolderBase]: 3527/5459 cut-off events.
[2024-06-04 17:01:40,673 INFO  L125   PetriNetUnfolderBase]: For 281099/281108 co-relation queries the response was YES.
[2024-06-04 17:01:40,701 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-04 17:01:40,723 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 204 selfloop transitions, 27 changer transitions 0/234 dead transitions.
[2024-06-04 17:01:40,724 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 234 transitions, 3298 flow
[2024-06-04 17:01:40,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:01:40,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:01:40,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions.
[2024-06-04 17:01:40,725 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.35714285714285715
[2024-06-04 17:01:40,725 INFO  L175             Difference]: Start difference. First operand has 190 places, 220 transitions, 2680 flow. Second operand 7 states and 105 transitions.
[2024-06-04 17:01:40,725 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 234 transitions, 3298 flow
[2024-06-04 17:01:41,037 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 234 transitions, 3080 flow, removed 22 selfloop flow, removed 10 redundant places.
[2024-06-04 17:01:41,041 INFO  L231             Difference]: Finished difference. Result has 187 places, 223 transitions, 2564 flow
[2024-06-04 17:01:41,041 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-04 17:01:41,041 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 144 predicate places.
[2024-06-04 17:01:41,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 223 transitions, 2564 flow
[2024-06-04 17:01:41,041 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:41,041 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:41,041 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:41,041 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 17:01:41,042 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-04 17:01:41,042 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:41,042 INFO  L85        PathProgramCache]: Analyzing trace with hash -1784842645, now seen corresponding path program 3 times
[2024-06-04 17:01:41,042 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:41,042 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664201044]
[2024-06-04 17:01:41,042 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:41,042 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:41,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:56,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:01:56,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:56,475 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664201044]
[2024-06-04 17:01:56,475 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664201044] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:56,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:56,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:01:56,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046553636]
[2024-06-04 17:01:56,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:56,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:01:56,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:56,476 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:01:56,476 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:01:56,617 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 17:01:56,617 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-04 17:01:56,617 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:56,617 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 17:01:56,617 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:58,603 INFO  L124   PetriNetUnfolderBase]: 3524/5455 cut-off events.
[2024-06-04 17:01:58,603 INFO  L125   PetriNetUnfolderBase]: For 283381/283390 co-relation queries the response was YES.
[2024-06-04 17:01:58,627 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-04 17:01:58,646 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 204 selfloop transitions, 26 changer transitions 0/233 dead transitions.
[2024-06-04 17:01:58,646 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 233 transitions, 3048 flow
[2024-06-04 17:01:58,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:01:58,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:01:58,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions.
[2024-06-04 17:01:58,647 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.35714285714285715
[2024-06-04 17:01:58,647 INFO  L175             Difference]: Start difference. First operand has 187 places, 223 transitions, 2564 flow. Second operand 7 states and 105 transitions.
[2024-06-04 17:01:58,647 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 233 transitions, 3048 flow
[2024-06-04 17:01:58,884 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 233 transitions, 2950 flow, removed 30 selfloop flow, removed 4 redundant places.
[2024-06-04 17:01:58,888 INFO  L231             Difference]: Finished difference. Result has 190 places, 223 transitions, 2524 flow
[2024-06-04 17:01:58,888 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-04 17:01:58,889 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-04 17:01:58,889 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 223 transitions, 2524 flow
[2024-06-04 17:01:58,889 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:58,889 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:58,889 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:58,889 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 17:01:58,890 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-04 17:01:58,890 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:58,890 INFO  L85        PathProgramCache]: Analyzing trace with hash -1784843017, now seen corresponding path program 3 times
[2024-06-04 17:01:58,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:58,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675419914]
[2024-06-04 17:01:58,890 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:58,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:58,935 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:14,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:02:14,524 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:14,524 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675419914]
[2024-06-04 17:02:14,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675419914] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:14,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:14,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:02:14,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906387494]
[2024-06-04 17:02:14,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:14,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:02:14,524 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:14,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:02:14,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:02:14,659 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 17:02:14,660 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-04 17:02:14,660 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:14,660 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 17:02:14,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:16,713 INFO  L124   PetriNetUnfolderBase]: 3518/5447 cut-off events.
[2024-06-04 17:02:16,713 INFO  L125   PetriNetUnfolderBase]: For 292646/292655 co-relation queries the response was YES.
[2024-06-04 17:02:16,737 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-04 17:02:16,755 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 210 selfloop transitions, 30 changer transitions 0/243 dead transitions.
[2024-06-04 17:02:16,756 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 243 transitions, 3056 flow
[2024-06-04 17:02:16,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:02:16,757 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:02:16,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions.
[2024-06-04 17:02:16,758 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3544973544973545
[2024-06-04 17:02:16,758 INFO  L175             Difference]: Start difference. First operand has 190 places, 223 transitions, 2524 flow. Second operand 9 states and 134 transitions.
[2024-06-04 17:02:16,758 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 243 transitions, 3056 flow
[2024-06-04 17:02:17,093 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 243 transitions, 2992 flow, removed 7 selfloop flow, removed 5 redundant places.
[2024-06-04 17:02:17,096 INFO  L231             Difference]: Finished difference. Result has 194 places, 223 transitions, 2526 flow
[2024-06-04 17:02:17,096 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-04 17:02:17,096 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-04 17:02:17,097 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 223 transitions, 2526 flow
[2024-06-04 17:02:17,097 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:17,097 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:17,097 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:17,097 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 17:02:17,097 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:17,097 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:17,097 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961909809, now seen corresponding path program 1 times
[2024-06-04 17:02:17,098 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:17,098 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383544464]
[2024-06-04 17:02:17,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:17,098 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:17,138 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:29,308 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:02:29,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:29,309 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383544464]
[2024-06-04 17:02:29,309 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383544464] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:29,309 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:29,309 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:02:29,309 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924115903]
[2024-06-04 17:02:29,309 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:29,310 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:02:29,310 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:29,310 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:02:29,310 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:02:29,490 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:02:29,491 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-04 17:02:29,491 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:29,491 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:02:29,491 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:31,348 INFO  L124   PetriNetUnfolderBase]: 3352/5276 cut-off events.
[2024-06-04 17:02:31,348 INFO  L125   PetriNetUnfolderBase]: For 263260/263260 co-relation queries the response was YES.
[2024-06-04 17:02:31,371 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-04 17:02:31,389 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 220 selfloop transitions, 14 changer transitions 0/242 dead transitions.
[2024-06-04 17:02:31,389 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 242 transitions, 3084 flow
[2024-06-04 17:02:31,390 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:02:31,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:02:31,390 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-04 17:02:31,390 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3843537414965986
[2024-06-04 17:02:31,390 INFO  L175             Difference]: Start difference. First operand has 194 places, 223 transitions, 2526 flow. Second operand 7 states and 113 transitions.
[2024-06-04 17:02:31,390 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 242 transitions, 3084 flow
[2024-06-04 17:02:31,756 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 242 transitions, 3012 flow, removed 3 selfloop flow, removed 8 redundant places.
[2024-06-04 17:02:31,759 INFO  L231             Difference]: Finished difference. Result has 193 places, 226 transitions, 2544 flow
[2024-06-04 17:02:31,759 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-04 17:02:31,759 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places.
[2024-06-04 17:02:31,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 226 transitions, 2544 flow
[2024-06-04 17:02:31,760 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-04 17:02:31,760 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:31,760 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:31,760 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 17:02:31,760 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:31,760 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:31,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961789839, now seen corresponding path program 2 times
[2024-06-04 17:02:31,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:31,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143109278]
[2024-06-04 17:02:31,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:31,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:31,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:44,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:02:44,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:44,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143109278]
[2024-06-04 17:02:44,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143109278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:44,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:44,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:02:44,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396303083]
[2024-06-04 17:02:44,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:44,612 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:02:44,612 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:44,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:02:44,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:02:44,781 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:02:44,781 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-04 17:02:44,781 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:44,781 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:02:44,781 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:46,665 INFO  L124   PetriNetUnfolderBase]: 3357/5283 cut-off events.
[2024-06-04 17:02:46,666 INFO  L125   PetriNetUnfolderBase]: For 272586/272586 co-relation queries the response was YES.
[2024-06-04 17:02:46,687 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-04 17:02:46,705 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 212 selfloop transitions, 26 changer transitions 0/246 dead transitions.
[2024-06-04 17:02:46,705 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 246 transitions, 3262 flow
[2024-06-04 17:02:46,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:02:46,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:02:46,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-04 17:02:46,706 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.391156462585034
[2024-06-04 17:02:46,706 INFO  L175             Difference]: Start difference. First operand has 193 places, 226 transitions, 2544 flow. Second operand 7 states and 115 transitions.
[2024-06-04 17:02:46,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 246 transitions, 3262 flow
[2024-06-04 17:02:47,005 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 246 transitions, 3194 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-04 17:02:47,009 INFO  L231             Difference]: Finished difference. Result has 195 places, 232 transitions, 2652 flow
[2024-06-04 17:02:47,009 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-04 17:02:47,010 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 152 predicate places.
[2024-06-04 17:02:47,010 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 232 transitions, 2652 flow
[2024-06-04 17:02:47,010 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-04 17:02:47,010 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:47,010 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:47,010 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 17:02:47,010 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:47,011 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:47,011 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961789653, now seen corresponding path program 1 times
[2024-06-04 17:02:47,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:47,011 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471273783]
[2024-06-04 17:02:47,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:47,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:47,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:59,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:02:59,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:59,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471273783]
[2024-06-04 17:02:59,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471273783] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:59,127 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:59,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:02:59,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973499374]
[2024-06-04 17:02:59,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:59,127 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:02:59,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:59,128 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:02:59,128 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:02:59,292 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:02:59,292 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-04 17:02:59,292 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:59,292 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:02:59,293 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:01,204 INFO  L124   PetriNetUnfolderBase]: 3367/5299 cut-off events.
[2024-06-04 17:03:01,204 INFO  L125   PetriNetUnfolderBase]: For 285095/285095 co-relation queries the response was YES.
[2024-06-04 17:03:01,225 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-04 17:03:01,242 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 222 selfloop transitions, 25 changer transitions 0/255 dead transitions.
[2024-06-04 17:03:01,242 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 255 transitions, 3352 flow
[2024-06-04 17:03:01,243 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:03:01,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:03:01,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-04 17:03:01,244 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4013605442176871
[2024-06-04 17:03:01,244 INFO  L175             Difference]: Start difference. First operand has 195 places, 232 transitions, 2652 flow. Second operand 7 states and 118 transitions.
[2024-06-04 17:03:01,244 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 255 transitions, 3352 flow
[2024-06-04 17:03:01,618 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 255 transitions, 3282 flow, removed 27 selfloop flow, removed 3 redundant places.
[2024-06-04 17:03:01,622 INFO  L231             Difference]: Finished difference. Result has 199 places, 238 transitions, 2712 flow
[2024-06-04 17:03:01,622 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-04 17:03:01,622 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places.
[2024-06-04 17:03:01,622 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 238 transitions, 2712 flow
[2024-06-04 17:03:01,622 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-04 17:03:01,622 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:01,622 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:01,622 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 17:03:01,623 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:01,623 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:01,623 INFO  L85        PathProgramCache]: Analyzing trace with hash 1730626151, now seen corresponding path program 2 times
[2024-06-04 17:03:01,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:01,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986116364]
[2024-06-04 17:03:01,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:01,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:01,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:13,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:03:13,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:13,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986116364]
[2024-06-04 17:03:13,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986116364] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:13,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:13,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:03:13,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411751221]
[2024-06-04 17:03:13,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:13,466 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:03:13,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:13,466 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:03:13,466 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:03:13,706 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:03:13,706 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-04 17:03:13,706 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:13,707 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:03:13,707 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:15,693 INFO  L124   PetriNetUnfolderBase]: 3377/5315 cut-off events.
[2024-06-04 17:03:15,693 INFO  L125   PetriNetUnfolderBase]: For 295805/295805 co-relation queries the response was YES.
[2024-06-04 17:03:15,715 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-04 17:03:15,732 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 229 selfloop transitions, 16 changer transitions 0/253 dead transitions.
[2024-06-04 17:03:15,732 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 253 transitions, 3270 flow
[2024-06-04 17:03:15,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:03:15,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:03:15,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-04 17:03:15,733 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3707482993197279
[2024-06-04 17:03:15,733 INFO  L175             Difference]: Start difference. First operand has 199 places, 238 transitions, 2712 flow. Second operand 7 states and 109 transitions.
[2024-06-04 17:03:15,733 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 253 transitions, 3270 flow
[2024-06-04 17:03:16,016 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 253 transitions, 3218 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-06-04 17:03:16,019 INFO  L231             Difference]: Finished difference. Result has 203 places, 241 transitions, 2745 flow
[2024-06-04 17:03:16,019 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-04 17:03:16,020 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places.
[2024-06-04 17:03:16,020 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 241 transitions, 2745 flow
[2024-06-04 17:03:16,020 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-04 17:03:16,020 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:16,020 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:16,020 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 17:03:16,020 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:16,021 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:16,021 INFO  L85        PathProgramCache]: Analyzing trace with hash -1784658133, now seen corresponding path program 3 times
[2024-06-04 17:03:16,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:16,021 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172688991]
[2024-06-04 17:03:16,021 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:16,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:16,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:28,046 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:03:28,046 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:28,046 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172688991]
[2024-06-04 17:03:28,046 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172688991] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:28,046 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:28,046 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:03:28,046 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898490432]
[2024-06-04 17:03:28,046 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:28,046 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:03:28,047 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:28,047 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:03:28,047 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:03:28,293 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:03:28,294 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-04 17:03:28,294 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:28,294 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:03:28,294 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:30,190 INFO  L124   PetriNetUnfolderBase]: 3371/5307 cut-off events.
[2024-06-04 17:03:30,190 INFO  L125   PetriNetUnfolderBase]: For 302913/302913 co-relation queries the response was YES.
[2024-06-04 17:03:30,212 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-04 17:03:30,229 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 225 selfloop transitions, 21 changer transitions 0/254 dead transitions.
[2024-06-04 17:03:30,229 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 254 transitions, 3267 flow
[2024-06-04 17:03:30,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:03:30,230 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:03:30,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-04 17:03:30,230 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38095238095238093
[2024-06-04 17:03:30,230 INFO  L175             Difference]: Start difference. First operand has 203 places, 241 transitions, 2745 flow. Second operand 7 states and 112 transitions.
[2024-06-04 17:03:30,230 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 254 transitions, 3267 flow
[2024-06-04 17:03:30,583 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 254 transitions, 3202 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-04 17:03:30,586 INFO  L231             Difference]: Finished difference. Result has 205 places, 241 transitions, 2728 flow
[2024-06-04 17:03:30,586 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-04 17:03:30,586 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places.
[2024-06-04 17:03:30,586 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 241 transitions, 2728 flow
[2024-06-04 17:03:30,586 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-04 17:03:30,586 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:30,587 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:30,587 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 17:03:30,587 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:30,587 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:30,587 INFO  L85        PathProgramCache]: Analyzing trace with hash -1784658319, now seen corresponding path program 3 times
[2024-06-04 17:03:30,587 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:30,587 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685225385]
[2024-06-04 17:03:30,587 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:30,588 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:30,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:42,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:03:42,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:42,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685225385]
[2024-06-04 17:03:42,363 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685225385] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:42,363 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:42,363 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:03:42,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793421793]
[2024-06-04 17:03:42,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:42,363 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:03:42,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:42,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:03:42,363 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:03:42,534 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:03:42,534 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-04 17:03:42,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:42,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:03:42,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:44,587 INFO  L124   PetriNetUnfolderBase]: 3368/5303 cut-off events.
[2024-06-04 17:03:44,587 INFO  L125   PetriNetUnfolderBase]: For 309676/309676 co-relation queries the response was YES.
[2024-06-04 17:03:44,613 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-04 17:03:44,631 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 229 selfloop transitions, 14 changer transitions 0/251 dead transitions.
[2024-06-04 17:03:44,631 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 251 transitions, 3238 flow
[2024-06-04 17:03:44,631 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:03:44,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:03:44,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions.
[2024-06-04 17:03:44,632 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36394557823129253
[2024-06-04 17:03:44,632 INFO  L175             Difference]: Start difference. First operand has 205 places, 241 transitions, 2728 flow. Second operand 7 states and 107 transitions.
[2024-06-04 17:03:44,632 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 251 transitions, 3238 flow
[2024-06-04 17:03:45,097 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 251 transitions, 3131 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-04 17:03:45,101 INFO  L231             Difference]: Finished difference. Result has 206 places, 241 transitions, 2655 flow
[2024-06-04 17:03:45,101 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-04 17:03:45,101 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 163 predicate places.
[2024-06-04 17:03:45,101 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 241 transitions, 2655 flow
[2024-06-04 17:03:45,102 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-04 17:03:45,102 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:45,102 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:45,102 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 17:03:45,102 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:45,104 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:45,104 INFO  L85        PathProgramCache]: Analyzing trace with hash -1102431609, now seen corresponding path program 1 times
[2024-06-04 17:03:45,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:45,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675988118]
[2024-06-04 17:03:45,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:45,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:45,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:54,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:03:54,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:54,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675988118]
[2024-06-04 17:03:54,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675988118] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:54,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:54,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:03:54,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053137494]
[2024-06-04 17:03:54,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:54,625 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:03:54,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:54,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:03:54,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:03:54,778 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:03:54,778 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-04 17:03:54,778 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:54,778 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:03:54,778 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:57,187 INFO  L124   PetriNetUnfolderBase]: 3602/5639 cut-off events.
[2024-06-04 17:03:57,187 INFO  L125   PetriNetUnfolderBase]: For 383686/383689 co-relation queries the response was YES.
[2024-06-04 17:03:57,214 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-04 17:03:57,232 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 265 selfloop transitions, 30 changer transitions 0/310 dead transitions.
[2024-06-04 17:03:57,232 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 310 transitions, 3630 flow
[2024-06-04 17:03:57,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-04 17:03:57,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-04 17:03:57,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 195 transitions.
[2024-06-04 17:03:57,235 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3869047619047619
[2024-06-04 17:03:57,235 INFO  L175             Difference]: Start difference. First operand has 206 places, 241 transitions, 2655 flow. Second operand 12 states and 195 transitions.
[2024-06-04 17:03:57,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 310 transitions, 3630 flow
[2024-06-04 17:03:57,525 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 310 transitions, 3584 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-04 17:03:57,528 INFO  L231             Difference]: Finished difference. Result has 217 places, 264 transitions, 2977 flow
[2024-06-04 17:03:57,528 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-04 17:03:57,529 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places.
[2024-06-04 17:03:57,529 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 264 transitions, 2977 flow
[2024-06-04 17:03:57,529 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-04 17:03:57,529 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:57,529 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:57,529 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 17:03:57,529 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:57,529 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:57,530 INFO  L85        PathProgramCache]: Analyzing trace with hash -1575050577, now seen corresponding path program 2 times
[2024-06-04 17:03:57,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:57,530 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83903946]
[2024-06-04 17:03:57,530 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:57,530 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:57,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:07,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:04:07,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:07,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83903946]
[2024-06-04 17:04:07,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83903946] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:07,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:07,802 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-04 17:04:07,802 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895004569]
[2024-06-04 17:04:07,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:07,802 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-04 17:04:07,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:07,802 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-04 17:04:07,803 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-06-04 17:04:08,014 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:04:08,015 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-04 17:04:08,015 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:08,015 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:04:08,015 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:10,396 INFO  L124   PetriNetUnfolderBase]: 3783/5933 cut-off events.
[2024-06-04 17:04:10,397 INFO  L125   PetriNetUnfolderBase]: For 404741/404743 co-relation queries the response was YES.
[2024-06-04 17:04:10,425 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-04 17:04:10,445 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 276 selfloop transitions, 42 changer transitions 0/333 dead transitions.
[2024-06-04 17:04:10,445 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 333 transitions, 4054 flow
[2024-06-04 17:04:10,446 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 17:04:10,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 17:04:10,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions.
[2024-06-04 17:04:10,446 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4004329004329004
[2024-06-04 17:04:10,446 INFO  L175             Difference]: Start difference. First operand has 217 places, 264 transitions, 2977 flow. Second operand 11 states and 185 transitions.
[2024-06-04 17:04:10,446 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 333 transitions, 4054 flow
[2024-06-04 17:04:10,859 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 333 transitions, 3952 flow, removed 50 selfloop flow, removed 1 redundant places.
[2024-06-04 17:04:10,862 INFO  L231             Difference]: Finished difference. Result has 232 places, 288 transitions, 3363 flow
[2024-06-04 17:04:10,863 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-04 17:04:10,863 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 189 predicate places.
[2024-06-04 17:04:10,863 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 288 transitions, 3363 flow
[2024-06-04 17:04:10,863 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-04 17:04:10,863 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:10,863 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:10,863 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 17:04:10,864 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:10,864 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:10,864 INFO  L85        PathProgramCache]: Analyzing trace with hash 618708607, now seen corresponding path program 3 times
[2024-06-04 17:04:10,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:10,864 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032085158]
[2024-06-04 17:04:10,864 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:10,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:10,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:20,050 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:04:20,050 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:20,050 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032085158]
[2024-06-04 17:04:20,050 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032085158] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:20,050 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:20,050 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:04:20,050 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501626003]
[2024-06-04 17:04:20,050 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:20,051 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:04:20,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:20,051 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:04:20,051 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:04:20,231 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:04:20,232 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-04 17:04:20,232 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:20,232 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:04:20,232 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:22,767 INFO  L124   PetriNetUnfolderBase]: 3838/6023 cut-off events.
[2024-06-04 17:04:22,767 INFO  L125   PetriNetUnfolderBase]: For 422391/422393 co-relation queries the response was YES.
[2024-06-04 17:04:22,796 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-04 17:04:22,815 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 249 selfloop transitions, 70 changer transitions 0/334 dead transitions.
[2024-06-04 17:04:22,815 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 334 transitions, 4201 flow
[2024-06-04 17:04:22,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:04:22,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:04:22,818 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions.
[2024-06-04 17:04:22,818 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4142857142857143
[2024-06-04 17:04:22,818 INFO  L175             Difference]: Start difference. First operand has 232 places, 288 transitions, 3363 flow. Second operand 10 states and 174 transitions.
[2024-06-04 17:04:22,818 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 334 transitions, 4201 flow
[2024-06-04 17:04:23,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 334 transitions, 4106 flow, removed 38 selfloop flow, removed 3 redundant places.
[2024-06-04 17:04:23,386 INFO  L231             Difference]: Finished difference. Result has 240 places, 293 transitions, 3514 flow
[2024-06-04 17:04:23,387 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-04 17:04:23,387 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places.
[2024-06-04 17:04:23,387 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 293 transitions, 3514 flow
[2024-06-04 17:04:23,387 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-04 17:04:23,387 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:23,387 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:23,388 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 17:04:23,388 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:23,388 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:23,388 INFO  L85        PathProgramCache]: Analyzing trace with hash -1099750419, now seen corresponding path program 4 times
[2024-06-04 17:04:23,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:23,389 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540924663]
[2024-06-04 17:04:23,389 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:23,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:23,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:34,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:04:34,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:34,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540924663]
[2024-06-04 17:04:34,122 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540924663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:34,122 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:34,123 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-04 17:04:34,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220560466]
[2024-06-04 17:04:34,123 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:34,123 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-04 17:04:34,123 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:34,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-04 17:04:34,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132
[2024-06-04 17:04:34,428 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:04:34,429 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-04 17:04:34,429 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:34,429 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:04:34,429 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:37,127 INFO  L124   PetriNetUnfolderBase]: 3879/6094 cut-off events.
[2024-06-04 17:04:37,128 INFO  L125   PetriNetUnfolderBase]: For 422556/422558 co-relation queries the response was YES.
[2024-06-04 17:04:37,157 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-04 17:04:37,177 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 268 selfloop transitions, 55 changer transitions 0/338 dead transitions.
[2024-06-04 17:04:37,178 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 338 transitions, 4372 flow
[2024-06-04 17:04:37,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:04:37,180 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:04:37,180 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-04 17:04:37,181 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4119047619047619
[2024-06-04 17:04:37,181 INFO  L175             Difference]: Start difference. First operand has 240 places, 293 transitions, 3514 flow. Second operand 10 states and 173 transitions.
[2024-06-04 17:04:37,181 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 338 transitions, 4372 flow
[2024-06-04 17:04:37,849 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 338 transitions, 4192 flow, removed 28 selfloop flow, removed 7 redundant places.
[2024-06-04 17:04:37,853 INFO  L231             Difference]: Finished difference. Result has 244 places, 296 transitions, 3542 flow
[2024-06-04 17:04:37,853 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-04 17:04:37,854 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places.
[2024-06-04 17:04:37,854 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 296 transitions, 3542 flow
[2024-06-04 17:04:37,854 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-04 17:04:37,854 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:37,854 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:37,854 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-04 17:04:37,854 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:37,855 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:37,855 INFO  L85        PathProgramCache]: Analyzing trace with hash 2107734544, now seen corresponding path program 1 times
[2024-06-04 17:04:37,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:37,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464080668]
[2024-06-04 17:04:37,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:37,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:37,893 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:50,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:04:50,632 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:50,633 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464080668]
[2024-06-04 17:04:50,633 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464080668] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:50,633 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:50,633 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:04:50,633 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591061325]
[2024-06-04 17:04:50,633 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:50,634 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:04:50,634 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:50,634 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:04:50,634 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:04:50,754 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 17:04:50,756 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-04 17:04:50,756 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:50,756 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 17:04:50,756 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:53,131 INFO  L124   PetriNetUnfolderBase]: 3982/6205 cut-off events.
[2024-06-04 17:04:53,132 INFO  L125   PetriNetUnfolderBase]: For 420890/420892 co-relation queries the response was YES.
[2024-06-04 17:04:53,164 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-04 17:04:53,186 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 287 selfloop transitions, 30 changer transitions 0/320 dead transitions.
[2024-06-04 17:04:53,186 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 320 transitions, 4450 flow
[2024-06-04 17:04:53,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:04:53,188 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:04:53,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-04 17:04:53,188 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3877551020408163
[2024-06-04 17:04:53,189 INFO  L175             Difference]: Start difference. First operand has 244 places, 296 transitions, 3542 flow. Second operand 7 states and 114 transitions.
[2024-06-04 17:04:53,189 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 320 transitions, 4450 flow
[2024-06-04 17:04:53,721 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 320 transitions, 4276 flow, removed 34 selfloop flow, removed 7 redundant places.
[2024-06-04 17:04:53,725 INFO  L231             Difference]: Finished difference. Result has 244 places, 302 transitions, 3548 flow
[2024-06-04 17:04:53,725 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-04 17:04:53,725 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places.
[2024-06-04 17:04:53,725 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 302 transitions, 3548 flow
[2024-06-04 17:04:53,726 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:04:53,726 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:53,726 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:53,726 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-04 17:04:53,726 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:53,726 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:53,726 INFO  L85        PathProgramCache]: Analyzing trace with hash 133548098, now seen corresponding path program 2 times
[2024-06-04 17:04:53,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:53,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139453661]
[2024-06-04 17:04:53,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:53,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:53,767 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:05,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:05:05,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:05,514 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139453661]
[2024-06-04 17:05:05,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139453661] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:05,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:05,514 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:05:05,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698003537]
[2024-06-04 17:05:05,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:05,514 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:05:05,514 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:05,515 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:05:05,515 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:05:05,656 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-04 17:05:05,657 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-04 17:05:05,657 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:05,657 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-04 17:05:05,657 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:08,273 INFO  L124   PetriNetUnfolderBase]: 3987/6212 cut-off events.
[2024-06-04 17:05:08,274 INFO  L125   PetriNetUnfolderBase]: For 431555/431557 co-relation queries the response was YES.
[2024-06-04 17:05:08,317 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-04 17:05:08,340 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 289 selfloop transitions, 27 changer transitions 0/319 dead transitions.
[2024-06-04 17:05:08,340 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 319 transitions, 4280 flow
[2024-06-04 17:05:08,341 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:05:08,341 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:05:08,341 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-04 17:05:08,344 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3707482993197279
[2024-06-04 17:05:08,344 INFO  L175             Difference]: Start difference. First operand has 244 places, 302 transitions, 3548 flow. Second operand 7 states and 109 transitions.
[2024-06-04 17:05:08,344 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 319 transitions, 4280 flow
[2024-06-04 17:05:09,379 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 319 transitions, 4155 flow, removed 50 selfloop flow, removed 3 redundant places.
[2024-06-04 17:05:09,382 INFO  L231             Difference]: Finished difference. Result has 248 places, 305 transitions, 3549 flow
[2024-06-04 17:05:09,383 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-04 17:05:09,383 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 205 predicate places.
[2024-06-04 17:05:09,383 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 305 transitions, 3549 flow
[2024-06-04 17:05:09,383 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:09,383 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:09,384 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:05:09,384 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-04 17:05:09,384 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-04 17:05:09,384 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:09,384 INFO  L85        PathProgramCache]: Analyzing trace with hash -394723951, now seen corresponding path program 5 times
[2024-06-04 17:05:09,384 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:09,385 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827942796]
[2024-06-04 17:05:09,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:09,385 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:09,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:20,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:05:20,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:20,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827942796]
[2024-06-04 17:05:20,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827942796] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:20,137 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:20,138 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:05:20,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231896861]
[2024-06-04 17:05:20,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:20,138 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:05:20,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:20,139 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:05:20,139 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:05:20,423 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:05:20,423 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-04 17:05:20,423 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:20,423 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:05:20,423 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:23,726 INFO  L124   PetriNetUnfolderBase]: 3938/6190 cut-off events.
[2024-06-04 17:05:23,727 INFO  L125   PetriNetUnfolderBase]: For 463368/463370 co-relation queries the response was YES.
[2024-06-04 17:05:23,770 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-04 17:05:23,791 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 256 selfloop transitions, 75 changer transitions 0/349 dead transitions.
[2024-06-04 17:05:23,791 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 349 transitions, 4417 flow
[2024-06-04 17:05:23,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:05:23,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:05:23,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions.
[2024-06-04 17:05:23,794 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4142857142857143
[2024-06-04 17:05:23,794 INFO  L175             Difference]: Start difference. First operand has 248 places, 305 transitions, 3549 flow. Second operand 10 states and 174 transitions.
[2024-06-04 17:05:23,794 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 349 transitions, 4417 flow
[2024-06-04 17:05:24,588 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 349 transitions, 4345 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-04 17:05:24,593 INFO  L231             Difference]: Finished difference. Result has 254 places, 308 transitions, 3740 flow
[2024-06-04 17:05:24,593 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-04 17:05:24,595 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 211 predicate places.
[2024-06-04 17:05:24,595 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 308 transitions, 3740 flow
[2024-06-04 17:05:24,595 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-04 17:05:24,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:24,596 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:05:24,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-04 17:05:24,596 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:05:24,596 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:24,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -1897031657, now seen corresponding path program 1 times
[2024-06-04 17:05:24,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:24,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309173095]
[2024-06-04 17:05:24,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:24,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:24,639 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15