./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix028_power.oepc_pso.oepc_rmo.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/mix028_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix028_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-04 16:59:40,911 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 16:59:40,978 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 16:59:40,981 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 16:59:40,982 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 16:59:41,005 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 16:59:41,006 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 16:59:41,006 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 16:59:41,007 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 16:59:41,011 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 16:59:41,011 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 16:59:41,011 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 16:59:41,012 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 16:59:41,012 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 16:59:41,012 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 16:59:41,012 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 16:59:41,012 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 16:59:41,013 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 16:59:41,013 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 16:59:41,013 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 16:59:41,013 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 16:59:41,014 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 16:59:41,014 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 16:59:41,014 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 16:59:41,014 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 16:59:41,014 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 16:59:41,015 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 16:59:41,015 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 16:59:41,015 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 16:59:41,015 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 16:59:41,015 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 16:59:41,016 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 16:59:41,016 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 16:59:41,016 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 16:59:41,016 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 16:59:41,016 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 16:59:41,016 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 16:59:41,017 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 16:59:41,017 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 16:59:41,017 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 16:59:41,017 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 16:59:41,017 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 16:59:41,017 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 16:59:41,018 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:59:41,211 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 16:59:41,225 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 16:59:41,227 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 16:59:41,227 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 16:59:41,228 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 16:59:41,229 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-04 16:59:42,148 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 16:59:42,356 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 16:59:42,356 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-04 16:59:42,373 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3be3e1f0/ac7fa3082fc3452cb30314cdd9c51c30/FLAG47af197bc
[2024-06-04 16:59:42,383 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3be3e1f0/ac7fa3082fc3452cb30314cdd9c51c30
[2024-06-04 16:59:42,385 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 16:59:42,385 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 16:59:42,386 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/mix028_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml
[2024-06-04 16:59:42,528 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 16:59:42,529 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 16:59:42,530 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 16:59:42,530 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 16:59:42,537 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 16:59:42,538 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:59:42" (1/2) ...
[2024-06-04 16:59:42,539 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63aaa643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:59:42, skipping insertion in model container
[2024-06-04 16:59:42,539 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:59:42" (1/2) ...
[2024-06-04 16:59:42,540 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1369bc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:59:42, skipping insertion in model container
[2024-06-04 16:59:42,540 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:59:42" (2/2) ...
[2024-06-04 16:59:42,540 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63aaa643 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:59:42, skipping insertion in model container
[2024-06-04 16:59:42,540 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:59:42" (2/2) ...
[2024-06-04 16:59:42,541 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 16:59:42,628 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 16:59:42,629 INFO  L97    edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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 )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))
[2024-06-04 16:59:42,630 INFO  L97    edCorrectnessWitness]: Location invariant before [L842-L842] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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 )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))
[2024-06-04 16:59:42,631 INFO  L97    edCorrectnessWitness]: Location invariant before [L841-L841] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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 )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 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 )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))
[2024-06-04 16:59:42,631 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 16:59:42,631 INFO  L106   edCorrectnessWitness]: ghost_update [L837-L837] multithreaded = 1;
[2024-06-04 16:59:42,675 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 16:59:42,939 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 16:59:42,947 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:59:43,287 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 16:59:43,351 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 16:59:43,353 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:59:43 WrapperNode
[2024-06-04 16:59:43,354 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 16:59:43,354 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 16:59:43,355 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 16:59:43,355 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 16:59:43,360 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:59:43" (1/1) ...
[2024-06-04 16:59:43,431 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:59:43" (1/1) ...
[2024-06-04 16:59:43,529 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125
[2024-06-04 16:59:43,530 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 16:59:43,531 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 16:59:43,531 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 16:59:43,532 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 16:59:43,540 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:59:43" (1/1) ...
[2024-06-04 16:59:43,540 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:59:43" (1/1) ...
[2024-06-04 16:59:43,572 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:59:43" (1/1) ...
[2024-06-04 16:59:43,625 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:59:43,626 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:59:43" (1/1) ...
[2024-06-04 16:59:43,627 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:59:43" (1/1) ...
[2024-06-04 16:59:43,665 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:59:43" (1/1) ...
[2024-06-04 16:59:43,667 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:59:43" (1/1) ...
[2024-06-04 16:59:43,686 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:59:43" (1/1) ...
[2024-06-04 16:59:43,691 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:59:43" (1/1) ...
[2024-06-04 16:59:43,722 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 16:59:43,723 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 16:59:43,723 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 16:59:43,723 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 16:59:43,724 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:59:43" (1/1) ...
[2024-06-04 16:59:43,727 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 16:59:43,734 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 16:59:43,747 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:59:43,752 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:59:43,776 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 16:59:43,776 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 16:59:43,776 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 16:59:43,776 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 16:59:43,776 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 16:59:43,776 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 16:59:43,776 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 16:59:43,777 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 16:59:43,777 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 16:59:43,777 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 16:59:43,777 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 16:59:43,777 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 16:59:43,778 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:59:43,980 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 16:59:43,982 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 16:59:45,102 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 16:59:45,104 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 16:59:45,415 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 16:59:45,416 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 16:59:45,417 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:59:45 BoogieIcfgContainer
[2024-06-04 16:59:45,417 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 16:59:45,420 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 16:59:45,420 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 16:59:45,422 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 16:59:45,423 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:59:42" (1/4) ...
[2024-06-04 16:59:45,424 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60adef30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:59:45, skipping insertion in model container
[2024-06-04 16:59:45,424 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:59:42" (2/4) ...
[2024-06-04 16:59:45,424 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60adef30 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:59:45, skipping insertion in model container
[2024-06-04 16:59:45,424 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:59:43" (3/4) ...
[2024-06-04 16:59:45,425 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60adef30 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:59:45, skipping insertion in model container
[2024-06-04 16:59:45,425 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:59:45" (4/4) ...
[2024-06-04 16:59:45,426 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-04 16:59:45,439 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 16:59:45,440 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 16:59:45,440 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 16:59:45,540 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 16:59:45,567 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-04 16:59:45,613 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-04 16:59:45,613 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 16:59:45,615 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 60 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:59:45,616 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-04 16:59:45,618 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-04 16:59:45,630 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 16:59:45,636 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;@7fc14082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 16:59:45,637 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 16:59:45,645 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 16:59:45,645 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-04 16:59:45,645 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 16:59:45,645 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:45,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:45,646 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:59:45,650 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:45,650 INFO  L85        PathProgramCache]: Analyzing trace with hash -1481508285, now seen corresponding path program 1 times
[2024-06-04 16:59:45,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:45,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542356380]
[2024-06-04 16:59:45,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:45,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:45,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:51,431 INFO  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:51,432 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:51,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542356380]
[2024-06-04 16:59:51,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542356380] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:51,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:51,434 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 16:59:51,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228573076]
[2024-06-04 16:59:51,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:51,441 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 16:59:51,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:51,468 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 16:59:51,468 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 16:59:51,535 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 16:59:51,538 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:51,538 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:51,538 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 16:59:51,538 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:52,557 INFO  L124   PetriNetUnfolderBase]: 1659/2538 cut-off events.
[2024-06-04 16:59:52,558 INFO  L125   PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-06-04 16:59:52,563 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5104 conditions, 2538 events. 1659/2538 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12026 event pairs, 1184 based on Foata normal form. 1/2498 useless extension candidates. Maximal degree in co-relation 5089. Up to 2465 conditions per place. 
[2024-06-04 16:59:52,574 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 35 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-04 16:59:52,574 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 179 flow
[2024-06-04 16:59:52,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 16:59:52,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 16:59:52,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions.
[2024-06-04 16:59:52,584 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-06-04 16:59:52,585 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 72 transitions.
[2024-06-04 16:59:52,586 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 179 flow
[2024-06-04 16:59:52,587 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 16:59:52,589 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-04 16:59:52,590 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:59:52,592 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-04 16:59:52,592 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-04 16:59:52,593 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:52,593 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:52,593 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:52,593 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 16:59:52,593 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:59:52,594 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:52,594 INFO  L85        PathProgramCache]: Analyzing trace with hash -2095269470, now seen corresponding path program 1 times
[2024-06-04 16:59:52,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:52,594 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597713646]
[2024-06-04 16:59:52,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:52,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:52,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:56,821 INFO  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:56,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:56,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597713646]
[2024-06-04 16:59:56,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597713646] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:56,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:56,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 16:59:56,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835761653]
[2024-06-04 16:59:56,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:56,824 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 16:59:56,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:56,825 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 16:59:56,825 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-04 16:59:56,946 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 16:59:56,947 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:59:56,947 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:56,947 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 16:59:56,947 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:57,783 INFO  L124   PetriNetUnfolderBase]: 1653/2529 cut-off events.
[2024-06-04 16:59:57,783 INFO  L125   PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES.
[2024-06-04 16:59:57,786 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 2529 events. 1653/2529 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12029 event pairs, 1038 based on Foata normal form. 3/2531 useless extension candidates. Maximal degree in co-relation 5705. Up to 2441 conditions per place. 
[2024-06-04 16:59:57,793 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 42 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-04 16:59:57,793 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 246 flow
[2024-06-04 16:59:57,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 16:59:57,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 16:59:57,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions.
[2024-06-04 16:59:57,795 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5476190476190477
[2024-06-04 16:59:57,795 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 92 transitions.
[2024-06-04 16:59:57,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 246 flow
[2024-06-04 16:59:57,796 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 16:59:57,797 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-04 16:59:57,797 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:59:57,798 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-04 16:59:57,798 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-04 16:59:57,798 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:59:57,798 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:57,799 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:57,799 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 16:59:57,799 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:59:57,799 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:57,799 INFO  L85        PathProgramCache]: Analyzing trace with hash -528843524, now seen corresponding path program 1 times
[2024-06-04 16:59:57,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:57,800 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112502200]
[2024-06-04 16:59:57,800 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:57,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:57,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:02,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:02,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:02,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112502200]
[2024-06-04 17:00:02,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112502200] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:02,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:02,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-04 17:00:02,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154140745]
[2024-06-04 17:00:02,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:02,284 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-04 17:00:02,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:02,284 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-04 17:00:02,285 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-04 17:00:02,406 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:00:02,406 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 17:00:02,406 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:02,406 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:00:02,406 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:03,318 INFO  L124   PetriNetUnfolderBase]: 1661/2559 cut-off events.
[2024-06-04 17:00:03,319 INFO  L125   PetriNetUnfolderBase]: For 1306/1306 co-relation queries the response was YES.
[2024-06-04 17:00:03,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6387 conditions, 2559 events. 1661/2559 cut-off events. For 1306/1306 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12225 event pairs, 812 based on Foata normal form. 5/2563 useless extension candidates. Maximal degree in co-relation 6370. Up to 2387 conditions per place. 
[2024-06-04 17:00:03,331 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 55 selfloop transitions, 16 changer transitions 0/75 dead transitions.
[2024-06-04 17:00:03,331 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 400 flow
[2024-06-04 17:00:03,332 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:00:03,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:00:03,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions.
[2024-06-04 17:00:03,334 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-06-04 17:00:03,334 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 120 transitions.
[2024-06-04 17:00:03,334 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 400 flow
[2024-06-04 17:00:03,335 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 386 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-04 17:00:03,336 INFO  L231             Difference]: Finished difference. Result has 51 places, 50 transitions, 237 flow
[2024-06-04 17:00:03,337 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=50}
[2024-06-04 17:00:03,337 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-04 17:00:03,337 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 237 flow
[2024-06-04 17:00:03,337 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 17:00:03,338 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:03,338 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:03,338 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 17:00:03,338 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:03,338 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:03,338 INFO  L85        PathProgramCache]: Analyzing trace with hash 1395244437, now seen corresponding path program 1 times
[2024-06-04 17:00:03,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:03,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736511]
[2024-06-04 17:00:03,339 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:03,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:03,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:08,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:08,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:08,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736511]
[2024-06-04 17:00:08,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736511] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:08,499 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:08,499 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:00:08,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755363310]
[2024-06-04 17:00:08,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:08,499 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:00:08,500 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:08,500 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:00:08,500 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:00:08,655 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:00:08,656 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 237 flow. Second operand  has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:08,656 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:08,656 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:00:08,656 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:09,762 INFO  L124   PetriNetUnfolderBase]: 1669/2571 cut-off events.
[2024-06-04 17:00:09,763 INFO  L125   PetriNetUnfolderBase]: For 3038/3040 co-relation queries the response was YES.
[2024-06-04 17:00:09,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7506 conditions, 2571 events. 1669/2571 cut-off events. For 3038/3040 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12272 event pairs, 666 based on Foata normal form. 7/2577 useless extension candidates. Maximal degree in co-relation 7486. Up to 2373 conditions per place. 
[2024-06-04 17:00:09,774 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 61 selfloop transitions, 21 changer transitions 0/86 dead transitions.
[2024-06-04 17:00:09,774 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 527 flow
[2024-06-04 17:00:09,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:00:09,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:00:09,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions.
[2024-06-04 17:00:09,776 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5136054421768708
[2024-06-04 17:00:09,776 INFO  L175             Difference]: Start difference. First operand has 51 places, 50 transitions, 237 flow. Second operand 7 states and 151 transitions.
[2024-06-04 17:00:09,776 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 527 flow
[2024-06-04 17:00:09,778 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 86 transitions, 519 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-06-04 17:00:09,779 INFO  L231             Difference]: Finished difference. Result has 58 places, 54 transitions, 312 flow
[2024-06-04 17:00:09,779 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=58, PETRI_TRANSITIONS=54}
[2024-06-04 17:00:09,780 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places.
[2024-06-04 17:00:09,780 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 312 flow
[2024-06-04 17:00:09,780 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:09,780 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:09,780 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:09,781 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 17:00:09,781 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:09,781 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:09,781 INFO  L85        PathProgramCache]: Analyzing trace with hash 302905255, now seen corresponding path program 1 times
[2024-06-04 17:00:09,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:09,781 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872507563]
[2024-06-04 17:00:09,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:09,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:09,822 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:15,131 INFO  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,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:15,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872507563]
[2024-06-04 17:00:15,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872507563] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:15,132 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:15,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:00:15,133 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351964965]
[2024-06-04 17:00:15,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:15,133 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:00:15,133 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:15,134 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:00:15,134 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:00:15,267 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:00:15,268 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 312 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 17:00:15,268 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:15,268 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:00:15,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:16,365 INFO  L124   PetriNetUnfolderBase]: 1681/2591 cut-off events.
[2024-06-04 17:00:16,365 INFO  L125   PetriNetUnfolderBase]: For 4787/4789 co-relation queries the response was YES.
[2024-06-04 17:00:16,370 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8378 conditions, 2591 events. 1681/2591 cut-off events. For 4787/4789 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12361 event pairs, 502 based on Foata normal form. 12/2602 useless extension candidates. Maximal degree in co-relation 8354. Up to 2341 conditions per place. 
[2024-06-04 17:00:16,380 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 66 selfloop transitions, 23 changer transitions 0/93 dead transitions.
[2024-06-04 17:00:16,380 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 93 transitions, 630 flow
[2024-06-04 17:00:16,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:00:16,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:00:16,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions.
[2024-06-04 17:00:16,381 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5374149659863946
[2024-06-04 17:00:16,381 INFO  L175             Difference]: Start difference. First operand has 58 places, 54 transitions, 312 flow. Second operand 7 states and 158 transitions.
[2024-06-04 17:00:16,381 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 93 transitions, 630 flow
[2024-06-04 17:00:16,386 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 579 flow, removed 7 selfloop flow, removed 5 redundant places.
[2024-06-04 17:00:16,387 INFO  L231             Difference]: Finished difference. Result has 59 places, 56 transitions, 337 flow
[2024-06-04 17:00:16,387 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=59, PETRI_TRANSITIONS=56}
[2024-06-04 17:00:16,387 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places.
[2024-06-04 17:00:16,388 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 337 flow
[2024-06-04 17:00:16,388 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 17:00:16,388 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:16,388 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:16,388 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 17:00:16,388 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:16,389 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:16,389 INFO  L85        PathProgramCache]: Analyzing trace with hash -1537941434, now seen corresponding path program 1 times
[2024-06-04 17:00:16,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:16,389 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104139679]
[2024-06-04 17:00:16,389 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:16,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:16,414 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:26,203 INFO  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:26,203 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:26,203 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104139679]
[2024-06-04 17:00:26,204 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104139679] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:26,204 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:26,204 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:00:26,204 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648433832]
[2024-06-04 17:00:26,204 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:26,204 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:00:26,204 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:26,205 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:00:26,205 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:00:26,314 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:00:26,314 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 337 flow. Second operand  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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:26,315 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:26,315 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:00:26,315 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:27,262 INFO  L124   PetriNetUnfolderBase]: 1676/2580 cut-off events.
[2024-06-04 17:00:27,262 INFO  L125   PetriNetUnfolderBase]: For 6458/6458 co-relation queries the response was YES.
[2024-06-04 17:00:27,267 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8899 conditions, 2580 events. 1676/2580 cut-off events. For 6458/6458 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12279 event pairs, 659 based on Foata normal form. 2/2581 useless extension candidates. Maximal degree in co-relation 8875. Up to 2484 conditions per place. 
[2024-06-04 17:00:27,277 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 55 selfloop transitions, 8 changer transitions 0/67 dead transitions.
[2024-06-04 17:00:27,277 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 491 flow
[2024-06-04 17:00:27,278 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:00:27,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:00:27,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions.
[2024-06-04 17:00:27,278 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4380952380952381
[2024-06-04 17:00:27,278 INFO  L175             Difference]: Start difference. First operand has 59 places, 56 transitions, 337 flow. Second operand 5 states and 92 transitions.
[2024-06-04 17:00:27,279 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 491 flow
[2024-06-04 17:00:27,282 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 427 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-04 17:00:27,283 INFO  L231             Difference]: Finished difference. Result has 59 places, 56 transitions, 297 flow
[2024-06-04 17:00:27,283 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=59, PETRI_TRANSITIONS=56}
[2024-06-04 17:00:27,284 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places.
[2024-06-04 17:00:27,284 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 297 flow
[2024-06-04 17:00:27,284 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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:27,284 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:27,284 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:27,284 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 17:00:27,284 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:27,285 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:27,285 INFO  L85        PathProgramCache]: Analyzing trace with hash -431946306, now seen corresponding path program 1 times
[2024-06-04 17:00:27,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:27,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937161389]
[2024-06-04 17:00:27,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:27,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:27,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:37,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 17:00:37,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:37,796 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937161389]
[2024-06-04 17:00:37,796 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937161389] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:37,796 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:37,796 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:00:37,796 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450091050]
[2024-06-04 17:00:37,797 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:37,797 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:00:37,797 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:37,797 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:00:37,798 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:00:37,967 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:00:37,968 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 297 flow. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call 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:37,968 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:37,968 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:00:37,968 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:39,132 INFO  L124   PetriNetUnfolderBase]: 1932/2872 cut-off events.
[2024-06-04 17:00:39,132 INFO  L125   PetriNetUnfolderBase]: For 8815/8815 co-relation queries the response was YES.
[2024-06-04 17:00:39,136 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10015 conditions, 2872 events. 1932/2872 cut-off events. For 8815/8815 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13056 event pairs, 727 based on Foata normal form. 6/2877 useless extension candidates. Maximal degree in co-relation 9989. Up to 2802 conditions per place. 
[2024-06-04 17:00:39,143 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 66 selfloop transitions, 17 changer transitions 0/86 dead transitions.
[2024-06-04 17:00:39,144 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 593 flow
[2024-06-04 17:00:39,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:00:39,144 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:00:39,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-04 17:00:39,145 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-04 17:00:39,145 INFO  L175             Difference]: Start difference. First operand has 59 places, 56 transitions, 297 flow. Second operand 6 states and 111 transitions.
[2024-06-04 17:00:39,145 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 593 flow
[2024-06-04 17:00:39,148 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 571 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-04 17:00:39,149 INFO  L231             Difference]: Finished difference. Result has 63 places, 67 transitions, 406 flow
[2024-06-04 17:00:39,150 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=406, PETRI_PLACES=63, PETRI_TRANSITIONS=67}
[2024-06-04 17:00:39,150 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places.
[2024-06-04 17:00:39,150 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 406 flow
[2024-06-04 17:00:39,151 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call 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,151 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:39,151 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:39,151 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 17:00:39,151 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:39,151 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:39,151 INFO  L85        PathProgramCache]: Analyzing trace with hash -871327101, now seen corresponding path program 1 times
[2024-06-04 17:00:39,152 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:39,152 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282696569]
[2024-06-04 17:00:39,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:39,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:39,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:47,074 INFO  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:47,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:47,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282696569]
[2024-06-04 17:00:47,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282696569] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:47,075 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:47,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:00:47,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081231133]
[2024-06-04 17:00:47,075 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:47,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:00:47,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:47,076 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:00:47,076 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:00:47,230 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:00:47,230 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 406 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 17:00:47,230 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:47,231 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:00:47,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:48,100 INFO  L124   PetriNetUnfolderBase]: 1744/2687 cut-off events.
[2024-06-04 17:00:48,100 INFO  L125   PetriNetUnfolderBase]: For 10848/10862 co-relation queries the response was YES.
[2024-06-04 17:00:48,106 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10192 conditions, 2687 events. 1744/2687 cut-off events. For 10848/10862 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12861 event pairs, 651 based on Foata normal form. 8/2679 useless extension candidates. Maximal degree in co-relation 10164. Up to 2489 conditions per place. 
[2024-06-04 17:00:48,113 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 64 selfloop transitions, 19 changer transitions 0/90 dead transitions.
[2024-06-04 17:00:48,113 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 90 transitions, 672 flow
[2024-06-04 17:00:48,114 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:00:48,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:00:48,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-04 17:00:48,115 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-04 17:00:48,115 INFO  L175             Difference]: Start difference. First operand has 63 places, 67 transitions, 406 flow. Second operand 6 states and 117 transitions.
[2024-06-04 17:00:48,115 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 90 transitions, 672 flow
[2024-06-04 17:00:48,121 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 654 flow, removed 8 selfloop flow, removed 1 redundant places.
[2024-06-04 17:00:48,122 INFO  L231             Difference]: Finished difference. Result has 68 places, 70 transitions, 460 flow
[2024-06-04 17:00:48,122 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=460, PETRI_PLACES=68, PETRI_TRANSITIONS=70}
[2024-06-04 17:00:48,123 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places.
[2024-06-04 17:00:48,123 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 460 flow
[2024-06-04 17:00:48,123 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 17:00:48,123 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:48,123 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:48,123 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 17:00:48,123 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:48,124 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:48,124 INFO  L85        PathProgramCache]: Analyzing trace with hash -492927771, now seen corresponding path program 2 times
[2024-06-04 17:00:48,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:48,124 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654555689]
[2024-06-04 17:00:48,124 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:48,124 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:48,162 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:55,828 INFO  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:55,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:55,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654555689]
[2024-06-04 17:00:55,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654555689] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:55,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:55,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:00:55,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924361404]
[2024-06-04 17:00:55,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:55,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:00:55,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:55,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:00:55,830 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:00:55,951 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:00:55,951 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 460 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 17:00:55,951 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:55,951 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:00:55,951 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:56,975 INFO  L124   PetriNetUnfolderBase]: 1729/2661 cut-off events.
[2024-06-04 17:00:56,975 INFO  L125   PetriNetUnfolderBase]: For 12020/12030 co-relation queries the response was YES.
[2024-06-04 17:00:56,981 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10272 conditions, 2661 events. 1729/2661 cut-off events. For 12020/12030 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12724 event pairs, 647 based on Foata normal form. 2/2647 useless extension candidates. Maximal degree in co-relation 10241. Up to 2530 conditions per place. 
[2024-06-04 17:00:56,990 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 67 selfloop transitions, 11 changer transitions 0/85 dead transitions.
[2024-06-04 17:00:56,990 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 85 transitions, 654 flow
[2024-06-04 17:00:56,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:00:56,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:00:56,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-04 17:00:56,992 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 17:00:56,992 INFO  L175             Difference]: Start difference. First operand has 68 places, 70 transitions, 460 flow. Second operand 6 states and 108 transitions.
[2024-06-04 17:00:56,992 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 85 transitions, 654 flow
[2024-06-04 17:00:57,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 625 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 17:00:57,005 INFO  L231             Difference]: Finished difference. Result has 71 places, 70 transitions, 461 flow
[2024-06-04 17:00:57,006 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=461, PETRI_PLACES=71, PETRI_TRANSITIONS=70}
[2024-06-04 17:00:57,007 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places.
[2024-06-04 17:00:57,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 461 flow
[2024-06-04 17:00:57,007 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 17:00:57,007 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:57,007 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:57,008 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 17:00:57,008 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:57,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:57,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -1241334843, now seen corresponding path program 1 times
[2024-06-04 17:00:57,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:57,014 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968737846]
[2024-06-04 17:00:57,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:57,014 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:57,061 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:05,708 INFO  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:05,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:05,708 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968737846]
[2024-06-04 17:01:05,708 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968737846] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:05,708 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:05,708 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:01:05,709 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932191509]
[2024-06-04 17:01:05,709 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:05,709 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:01:05,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:05,710 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:01:05,710 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:01:05,877 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:01:05,878 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 461 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:05,878 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:05,878 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:01:05,878 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:07,096 INFO  L124   PetriNetUnfolderBase]: 2091/3095 cut-off events.
[2024-06-04 17:01:07,096 INFO  L125   PetriNetUnfolderBase]: For 17186/17190 co-relation queries the response was YES.
[2024-06-04 17:01:07,102 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12369 conditions, 3095 events. 2091/3095 cut-off events. For 17186/17190 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14126 event pairs, 649 based on Foata normal form. 13/3107 useless extension candidates. Maximal degree in co-relation 12337. Up to 2721 conditions per place. 
[2024-06-04 17:01:07,111 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 88 selfloop transitions, 31 changer transitions 0/122 dead transitions.
[2024-06-04 17:01:07,111 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 989 flow
[2024-06-04 17:01:07,112 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:01:07,112 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:01:07,112 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions.
[2024-06-04 17:01:07,113 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-04 17:01:07,113 INFO  L175             Difference]: Start difference. First operand has 71 places, 70 transitions, 461 flow. Second operand 7 states and 140 transitions.
[2024-06-04 17:01:07,113 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 989 flow
[2024-06-04 17:01:07,122 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 122 transitions, 942 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-04 17:01:07,124 INFO  L231             Difference]: Finished difference. Result has 75 places, 89 transitions, 662 flow
[2024-06-04 17:01:07,124 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=662, PETRI_PLACES=75, PETRI_TRANSITIONS=89}
[2024-06-04 17:01:07,124 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places.
[2024-06-04 17:01:07,125 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 89 transitions, 662 flow
[2024-06-04 17:01:07,125 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:07,125 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:07,125 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:07,125 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 17:01:07,125 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:01:07,126 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:07,126 INFO  L85        PathProgramCache]: Analyzing trace with hash 1905365905, now seen corresponding path program 2 times
[2024-06-04 17:01:07,126 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:07,126 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852081548]
[2024-06-04 17:01:07,126 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:07,126 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:07,165 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:15,416 INFO  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:15,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:15,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852081548]
[2024-06-04 17:01:15,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852081548] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:15,417 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:15,417 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:01:15,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422186805]
[2024-06-04 17:01:15,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:15,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:01:15,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:15,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:01:15,418 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:01:15,568 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:01:15,568 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 89 transitions, 662 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:15,568 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:15,569 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:01:15,569 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:16,789 INFO  L124   PetriNetUnfolderBase]: 2127/3146 cut-off events.
[2024-06-04 17:01:16,789 INFO  L125   PetriNetUnfolderBase]: For 22973/22973 co-relation queries the response was YES.
[2024-06-04 17:01:16,796 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14509 conditions, 3146 events. 2127/3146 cut-off events. For 22973/22973 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14318 event pairs, 690 based on Foata normal form. 6/3151 useless extension candidates. Maximal degree in co-relation 14473. Up to 3007 conditions per place. 
[2024-06-04 17:01:16,807 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 98 selfloop transitions, 23 changer transitions 0/124 dead transitions.
[2024-06-04 17:01:16,807 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 124 transitions, 1146 flow
[2024-06-04 17:01:16,808 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:01:16,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:01:16,808 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-04 17:01:16,809 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4421768707482993
[2024-06-04 17:01:16,809 INFO  L175             Difference]: Start difference. First operand has 75 places, 89 transitions, 662 flow. Second operand 7 states and 130 transitions.
[2024-06-04 17:01:16,809 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 124 transitions, 1146 flow
[2024-06-04 17:01:16,824 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 124 transitions, 1102 flow, removed 21 selfloop flow, removed 1 redundant places.
[2024-06-04 17:01:16,825 INFO  L231             Difference]: Finished difference. Result has 82 places, 97 transitions, 770 flow
[2024-06-04 17:01:16,826 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=770, PETRI_PLACES=82, PETRI_TRANSITIONS=97}
[2024-06-04 17:01:16,826 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places.
[2024-06-04 17:01:16,826 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 97 transitions, 770 flow
[2024-06-04 17:01:16,826 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:16,827 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:16,827 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:16,827 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 17:01:16,827 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:01:16,827 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:16,827 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063966173, now seen corresponding path program 3 times
[2024-06-04 17:01:16,827 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:16,828 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434091139]
[2024-06-04 17:01:16,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:16,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:16,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:24,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:24,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:24,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434091139]
[2024-06-04 17:01:24,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434091139] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:24,877 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:24,877 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:01:24,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565359834]
[2024-06-04 17:01:24,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:24,877 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:01:24,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:24,878 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:01:24,878 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:01:24,998 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:01:24,999 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 97 transitions, 770 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:24,999 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:24,999 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:01:24,999 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:26,349 INFO  L124   PetriNetUnfolderBase]: 2131/3152 cut-off events.
[2024-06-04 17:01:26,349 INFO  L125   PetriNetUnfolderBase]: For 27428/27428 co-relation queries the response was YES.
[2024-06-04 17:01:26,357 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15157 conditions, 3152 events. 2131/3152 cut-off events. For 27428/27428 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14356 event pairs, 689 based on Foata normal form. 6/3157 useless extension candidates. Maximal degree in co-relation 15117. Up to 3076 conditions per place. 
[2024-06-04 17:01:26,372 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 101 selfloop transitions, 21 changer transitions 0/125 dead transitions.
[2024-06-04 17:01:26,373 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 1174 flow
[2024-06-04 17:01:26,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:01:26,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:01:26,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-04 17:01:26,374 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 17:01:26,374 INFO  L175             Difference]: Start difference. First operand has 82 places, 97 transitions, 770 flow. Second operand 7 states and 126 transitions.
[2024-06-04 17:01:26,374 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 125 transitions, 1174 flow
[2024-06-04 17:01:26,392 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 125 transitions, 1125 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-04 17:01:26,394 INFO  L231             Difference]: Finished difference. Result has 87 places, 103 transitions, 848 flow
[2024-06-04 17:01:26,394 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=848, PETRI_PLACES=87, PETRI_TRANSITIONS=103}
[2024-06-04 17:01:26,396 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places.
[2024-06-04 17:01:26,396 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 848 flow
[2024-06-04 17:01:26,396 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:26,396 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:26,396 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:26,396 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 17:01:26,396 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:01:26,397 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:26,397 INFO  L85        PathProgramCache]: Analyzing trace with hash 1511477053, now seen corresponding path program 1 times
[2024-06-04 17:01:26,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:26,397 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750483302]
[2024-06-04 17:01:26,397 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:26,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:26,433 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:37,383 INFO  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:37,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:37,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750483302]
[2024-06-04 17:01:37,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750483302] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:37,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:37,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:01:37,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824688065]
[2024-06-04 17:01:37,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:37,384 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:01:37,384 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:37,385 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:01:37,385 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:01:37,566 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:01:37,567 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 848 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:37,567 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:37,567 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:01:37,567 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:38,876 INFO  L124   PetriNetUnfolderBase]: 2134/3157 cut-off events.
[2024-06-04 17:01:38,877 INFO  L125   PetriNetUnfolderBase]: For 30219/30219 co-relation queries the response was YES.
[2024-06-04 17:01:38,884 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15528 conditions, 3157 events. 2134/3157 cut-off events. For 30219/30219 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14391 event pairs, 668 based on Foata normal form. 6/3162 useless extension candidates. Maximal degree in co-relation 15486. Up to 3061 conditions per place. 
[2024-06-04 17:01:38,891 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 100 selfloop transitions, 25 changer transitions 0/128 dead transitions.
[2024-06-04 17:01:38,891 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 128 transitions, 1232 flow
[2024-06-04 17:01:38,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:01:38,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:01:38,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-04 17:01:38,892 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-04 17:01:38,892 INFO  L175             Difference]: Start difference. First operand has 87 places, 103 transitions, 848 flow. Second operand 7 states and 127 transitions.
[2024-06-04 17:01:38,892 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 128 transitions, 1232 flow
[2024-06-04 17:01:38,908 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 128 transitions, 1179 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-04 17:01:38,910 INFO  L231             Difference]: Finished difference. Result has 90 places, 106 transitions, 891 flow
[2024-06-04 17:01:38,910 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=891, PETRI_PLACES=90, PETRI_TRANSITIONS=106}
[2024-06-04 17:01:38,910 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places.
[2024-06-04 17:01:38,910 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 106 transitions, 891 flow
[2024-06-04 17:01:38,911 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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,911 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:38,911 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:38,911 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 17:01:38,911 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:01:38,911 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:38,912 INFO  L85        PathProgramCache]: Analyzing trace with hash -2050156111, now seen corresponding path program 1 times
[2024-06-04 17:01:38,912 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:38,912 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991024651]
[2024-06-04 17:01:38,912 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:38,912 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:38,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:51,063 INFO  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:51,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:51,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991024651]
[2024-06-04 17:01:51,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991024651] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:51,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:51,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:01:51,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540829045]
[2024-06-04 17:01:51,064 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:51,064 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:01:51,064 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:51,065 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:01:51,065 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:01:51,129 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:01:51,129 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 106 transitions, 891 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 17:01:51,129 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:51,129 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:01:51,129 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:52,279 INFO  L124   PetriNetUnfolderBase]: 2131/3153 cut-off events.
[2024-06-04 17:01:52,279 INFO  L125   PetriNetUnfolderBase]: For 32999/32999 co-relation queries the response was YES.
[2024-06-04 17:01:52,287 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15973 conditions, 3153 events. 2131/3153 cut-off events. For 32999/32999 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14370 event pairs, 692 based on Foata normal form. 1/3153 useless extension candidates. Maximal degree in co-relation 15930. Up to 3137 conditions per place. 
[2024-06-04 17:01:52,296 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 103 selfloop transitions, 8 changer transitions 0/114 dead transitions.
[2024-06-04 17:01:52,296 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 114 transitions, 1133 flow
[2024-06-04 17:01:52,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:01:52,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:01:52,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions.
[2024-06-04 17:01:52,297 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-04 17:01:52,297 INFO  L175             Difference]: Start difference. First operand has 90 places, 106 transitions, 891 flow. Second operand 5 states and 84 transitions.
[2024-06-04 17:01:52,297 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 114 transitions, 1133 flow
[2024-06-04 17:01:52,314 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 114 transitions, 1053 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-04 17:01:52,315 INFO  L231             Difference]: Finished difference. Result has 90 places, 106 transitions, 833 flow
[2024-06-04 17:01:52,316 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=833, PETRI_PLACES=90, PETRI_TRANSITIONS=106}
[2024-06-04 17:01:52,316 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places.
[2024-06-04 17:01:52,316 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 106 transitions, 833 flow
[2024-06-04 17:01:52,316 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 17:01:52,317 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:52,317 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:52,317 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 17:01:52,317 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:01:52,317 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:52,317 INFO  L85        PathProgramCache]: Analyzing trace with hash -1532581170, now seen corresponding path program 1 times
[2024-06-04 17:01:52,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:52,318 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251295219]
[2024-06-04 17:01:52,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:52,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:52,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:01,599 INFO  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:01,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:01,600 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251295219]
[2024-06-04 17:02:01,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251295219] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:01,600 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:01,600 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:02:01,600 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165660750]
[2024-06-04 17:02:01,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:01,601 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:02:01,601 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:01,601 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:02:01,602 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:02:01,737 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:02:01,737 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 106 transitions, 833 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:01,737 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:01,738 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:02:01,738 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:02,954 INFO  L124   PetriNetUnfolderBase]: 2008/3036 cut-off events.
[2024-06-04 17:02:02,954 INFO  L125   PetriNetUnfolderBase]: For 35233/35269 co-relation queries the response was YES.
[2024-06-04 17:02:02,963 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15404 conditions, 3036 events. 2008/3036 cut-off events. For 35233/35269 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14354 event pairs, 607 based on Foata normal form. 14/3029 useless extension candidates. Maximal degree in co-relation 15360. Up to 2758 conditions per place. 
[2024-06-04 17:02:02,972 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 97 selfloop transitions, 26 changer transitions 0/139 dead transitions.
[2024-06-04 17:02:02,972 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 139 transitions, 1281 flow
[2024-06-04 17:02:02,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:02:02,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:02:02,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-04 17:02:02,975 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46258503401360546
[2024-06-04 17:02:02,975 INFO  L175             Difference]: Start difference. First operand has 90 places, 106 transitions, 833 flow. Second operand 7 states and 136 transitions.
[2024-06-04 17:02:02,975 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 139 transitions, 1281 flow
[2024-06-04 17:02:02,996 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 139 transitions, 1257 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-06-04 17:02:03,001 INFO  L231             Difference]: Finished difference. Result has 93 places, 112 transitions, 955 flow
[2024-06-04 17:02:03,002 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=955, PETRI_PLACES=93, PETRI_TRANSITIONS=112}
[2024-06-04 17:02:03,003 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places.
[2024-06-04 17:02:03,003 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 112 transitions, 955 flow
[2024-06-04 17:02:03,004 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:03,004 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:03,004 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:03,004 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 17:02:03,004 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:03,004 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:03,004 INFO  L85        PathProgramCache]: Analyzing trace with hash 169602052, now seen corresponding path program 2 times
[2024-06-04 17:02:03,005 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:03,005 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698965209]
[2024-06-04 17:02:03,005 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:03,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:03,054 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:13,302 INFO  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:13,305 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:13,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698965209]
[2024-06-04 17:02:13,307 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698965209] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:13,307 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:13,307 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:02:13,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009306300]
[2024-06-04 17:02:13,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:13,308 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:02:13,324 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:13,324 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:02:13,324 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:02:13,446 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:02:13,447 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 112 transitions, 955 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:13,447 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:13,447 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:02:13,447 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:14,626 INFO  L124   PetriNetUnfolderBase]: 2003/3029 cut-off events.
[2024-06-04 17:02:14,626 INFO  L125   PetriNetUnfolderBase]: For 39893/39929 co-relation queries the response was YES.
[2024-06-04 17:02:14,633 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15999 conditions, 3029 events. 2003/3029 cut-off events. For 39893/39929 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14290 event pairs, 607 based on Foata normal form. 14/3022 useless extension candidates. Maximal degree in co-relation 15955. Up to 2786 conditions per place. 
[2024-06-04 17:02:14,641 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 96 selfloop transitions, 22 changer transitions 0/134 dead transitions.
[2024-06-04 17:02:14,641 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 134 transitions, 1247 flow
[2024-06-04 17:02:14,643 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:02:14,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:02:14,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-04 17:02:14,644 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445578231292517
[2024-06-04 17:02:14,644 INFO  L175             Difference]: Start difference. First operand has 93 places, 112 transitions, 955 flow. Second operand 7 states and 131 transitions.
[2024-06-04 17:02:14,644 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 134 transitions, 1247 flow
[2024-06-04 17:02:14,669 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 134 transitions, 1166 flow, removed 31 selfloop flow, removed 3 redundant places.
[2024-06-04 17:02:14,671 INFO  L231             Difference]: Finished difference. Result has 97 places, 112 transitions, 926 flow
[2024-06-04 17:02:14,671 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=926, PETRI_PLACES=97, PETRI_TRANSITIONS=112}
[2024-06-04 17:02:14,671 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places.
[2024-06-04 17:02:14,671 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 112 transitions, 926 flow
[2024-06-04 17:02:14,672 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:14,672 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:14,672 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:14,672 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 17:02:14,672 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:14,672 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:14,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -1528771735, now seen corresponding path program 1 times
[2024-06-04 17:02:14,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:14,673 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599810483]
[2024-06-04 17:02:14,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:14,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:14,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:23,208 INFO  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:23,208 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:23,208 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599810483]
[2024-06-04 17:02:23,208 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599810483] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:23,208 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:23,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:02:23,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721730821]
[2024-06-04 17:02:23,209 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:23,209 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:02:23,209 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:23,210 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:02:23,210 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:02:23,343 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:02:23,343 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 112 transitions, 926 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:23,343 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:23,343 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:02:23,343 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:24,486 INFO  L124   PetriNetUnfolderBase]: 2173/3215 cut-off events.
[2024-06-04 17:02:24,486 INFO  L125   PetriNetUnfolderBase]: For 45850/45856 co-relation queries the response was YES.
[2024-06-04 17:02:24,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17293 conditions, 3215 events. 2173/3215 cut-off events. For 45850/45856 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14676 event pairs, 638 based on Foata normal form. 8/3222 useless extension candidates. Maximal degree in co-relation 17247. Up to 2785 conditions per place. 
[2024-06-04 17:02:24,503 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 103 selfloop transitions, 47 changer transitions 0/153 dead transitions.
[2024-06-04 17:02:24,503 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 153 transitions, 1556 flow
[2024-06-04 17:02:24,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:02:24,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:02:24,504 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-04 17:02:24,505 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48299319727891155
[2024-06-04 17:02:24,505 INFO  L175             Difference]: Start difference. First operand has 97 places, 112 transitions, 926 flow. Second operand 7 states and 142 transitions.
[2024-06-04 17:02:24,505 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 153 transitions, 1556 flow
[2024-06-04 17:02:24,528 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 153 transitions, 1501 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-04 17:02:24,530 INFO  L231             Difference]: Finished difference. Result has 100 places, 120 transitions, 1127 flow
[2024-06-04 17:02:24,530 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1127, PETRI_PLACES=100, PETRI_TRANSITIONS=120}
[2024-06-04 17:02:24,531 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places.
[2024-06-04 17:02:24,531 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 120 transitions, 1127 flow
[2024-06-04 17:02:24,531 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:24,531 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:24,531 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:24,531 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 17:02:24,531 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:24,532 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:24,532 INFO  L85        PathProgramCache]: Analyzing trace with hash 173326857, now seen corresponding path program 2 times
[2024-06-04 17:02:24,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:24,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728010268]
[2024-06-04 17:02:24,532 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:24,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:24,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:33,793 INFO  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:33,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:33,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728010268]
[2024-06-04 17:02:33,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728010268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:33,794 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:33,794 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:02:33,795 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800189424]
[2024-06-04 17:02:33,795 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:33,795 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:02:33,795 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:33,795 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:02:33,795 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:02:33,953 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:02:33,953 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 120 transitions, 1127 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:33,953 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:33,953 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:02:33,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:35,157 INFO  L124   PetriNetUnfolderBase]: 2209/3267 cut-off events.
[2024-06-04 17:02:35,157 INFO  L125   PetriNetUnfolderBase]: For 53310/53316 co-relation queries the response was YES.
[2024-06-04 17:02:35,168 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18752 conditions, 3267 events. 2209/3267 cut-off events. For 53310/53316 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15004 event pairs, 637 based on Foata normal form. 8/3274 useless extension candidates. Maximal degree in co-relation 18703. Up to 2815 conditions per place. 
[2024-06-04 17:02:35,178 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 102 selfloop transitions, 48 changer transitions 0/153 dead transitions.
[2024-06-04 17:02:35,179 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 153 transitions, 1683 flow
[2024-06-04 17:02:35,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:02:35,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:02:35,180 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-04 17:02:35,180 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-04 17:02:35,180 INFO  L175             Difference]: Start difference. First operand has 100 places, 120 transitions, 1127 flow. Second operand 7 states and 137 transitions.
[2024-06-04 17:02:35,180 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 153 transitions, 1683 flow
[2024-06-04 17:02:35,220 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 153 transitions, 1596 flow, removed 22 selfloop flow, removed 3 redundant places.
[2024-06-04 17:02:35,222 INFO  L231             Difference]: Finished difference. Result has 104 places, 124 transitions, 1204 flow
[2024-06-04 17:02:35,222 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1204, PETRI_PLACES=104, PETRI_TRANSITIONS=124}
[2024-06-04 17:02:35,222 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places.
[2024-06-04 17:02:35,223 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 124 transitions, 1204 flow
[2024-06-04 17:02:35,223 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:35,223 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:35,223 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:35,223 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 17:02:35,223 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:35,223 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:35,223 INFO  L85        PathProgramCache]: Analyzing trace with hash -1249785523, now seen corresponding path program 3 times
[2024-06-04 17:02:35,223 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:35,223 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795503574]
[2024-06-04 17:02:35,224 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:35,224 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:35,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:43,946 INFO  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:43,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:43,946 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795503574]
[2024-06-04 17:02:43,946 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795503574] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:43,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:43,947 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:02:43,947 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052361702]
[2024-06-04 17:02:43,947 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:43,947 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:02:43,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:43,947 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:02:43,948 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:02:44,125 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:02:44,125 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 124 transitions, 1204 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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,125 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:44,125 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:02:44,125 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:45,412 INFO  L124   PetriNetUnfolderBase]: 2213/3273 cut-off events.
[2024-06-04 17:02:45,413 INFO  L125   PetriNetUnfolderBase]: For 57784/57790 co-relation queries the response was YES.
[2024-06-04 17:02:45,421 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18949 conditions, 3273 events. 2213/3273 cut-off events. For 57784/57790 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14995 event pairs, 678 based on Foata normal form. 12/3284 useless extension candidates. Maximal degree in co-relation 18899. Up to 3164 conditions per place. 
[2024-06-04 17:02:45,430 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 124 selfloop transitions, 23 changer transitions 0/150 dead transitions.
[2024-06-04 17:02:45,430 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 150 transitions, 1649 flow
[2024-06-04 17:02:45,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:02:45,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:02:45,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-04 17:02:45,433 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-04 17:02:45,433 INFO  L175             Difference]: Start difference. First operand has 104 places, 124 transitions, 1204 flow. Second operand 7 states and 127 transitions.
[2024-06-04 17:02:45,433 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 150 transitions, 1649 flow
[2024-06-04 17:02:45,468 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 150 transitions, 1558 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-04 17:02:45,470 INFO  L231             Difference]: Finished difference. Result has 107 places, 128 transitions, 1233 flow
[2024-06-04 17:02:45,470 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1233, PETRI_PLACES=107, PETRI_TRANSITIONS=128}
[2024-06-04 17:02:45,470 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places.
[2024-06-04 17:02:45,470 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 128 transitions, 1233 flow
[2024-06-04 17:02:45,471 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:45,471 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:45,471 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:45,471 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 17:02:45,471 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:45,472 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:45,472 INFO  L85        PathProgramCache]: Analyzing trace with hash 1578646960, now seen corresponding path program 1 times
[2024-06-04 17:02:45,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:45,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560553550]
[2024-06-04 17:02:45,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:45,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:45,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:53,760 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:02:53,761 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:53,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560553550]
[2024-06-04 17:02:53,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560553550] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:53,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:53,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:02:53,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394399560]
[2024-06-04 17:02:53,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:53,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:02:53,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:53,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:02:53,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:02:53,922 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:02:53,922 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 128 transitions, 1233 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 17:02:53,922 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:53,922 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:02:53,922 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:55,196 INFO  L124   PetriNetUnfolderBase]: 2215/3275 cut-off events.
[2024-06-04 17:02:55,197 INFO  L125   PetriNetUnfolderBase]: For 61801/61801 co-relation queries the response was YES.
[2024-06-04 17:02:55,207 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19060 conditions, 3275 events. 2215/3275 cut-off events. For 61801/61801 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15024 event pairs, 665 based on Foata normal form. 3/3277 useless extension candidates. Maximal degree in co-relation 19009. Up to 3168 conditions per place. 
[2024-06-04 17:02:55,217 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 120 selfloop transitions, 30 changer transitions 0/153 dead transitions.
[2024-06-04 17:02:55,218 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 153 transitions, 1681 flow
[2024-06-04 17:02:55,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:02:55,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:02:55,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-04 17:02:55,220 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-04 17:02:55,220 INFO  L175             Difference]: Start difference. First operand has 107 places, 128 transitions, 1233 flow. Second operand 7 states and 127 transitions.
[2024-06-04 17:02:55,220 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 153 transitions, 1681 flow
[2024-06-04 17:02:55,266 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 153 transitions, 1612 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-04 17:02:55,268 INFO  L231             Difference]: Finished difference. Result has 109 places, 132 transitions, 1302 flow
[2024-06-04 17:02:55,268 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1302, PETRI_PLACES=109, PETRI_TRANSITIONS=132}
[2024-06-04 17:02:55,268 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places.
[2024-06-04 17:02:55,268 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 132 transitions, 1302 flow
[2024-06-04 17:02:55,268 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 17:02:55,268 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:55,269 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:55,269 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 17:02:55,269 INFO  L420      AbstractCegarLoop]: === Iteration 21 === 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:55,269 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:55,269 INFO  L85        PathProgramCache]: Analyzing trace with hash 869671367, now seen corresponding path program 1 times
[2024-06-04 17:02:55,269 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:55,269 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923370264]
[2024-06-04 17:02:55,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:55,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:55,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:09,443 INFO  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:09,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:09,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923370264]
[2024-06-04 17:03:09,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923370264] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:09,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:09,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:03:09,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56111520]
[2024-06-04 17:03:09,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:09,444 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:03:09,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:09,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:03:09,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:03:09,535 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:03:09,535 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 132 transitions, 1302 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 17:03:09,536 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:09,536 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:03:09,536 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:10,790 INFO  L124   PetriNetUnfolderBase]: 2206/3263 cut-off events.
[2024-06-04 17:03:10,790 INFO  L125   PetriNetUnfolderBase]: For 66112/66112 co-relation queries the response was YES.
[2024-06-04 17:03:10,802 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19605 conditions, 3263 events. 2206/3263 cut-off events. For 66112/66112 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14844 event pairs, 674 based on Foata normal form. 3/3265 useless extension candidates. Maximal degree in co-relation 19553. Up to 3238 conditions per place. 
[2024-06-04 17:03:10,814 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 132 selfloop transitions, 11 changer transitions 0/146 dead transitions.
[2024-06-04 17:03:10,814 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 146 transitions, 1640 flow
[2024-06-04 17:03:10,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:03:10,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:03:10,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions.
[2024-06-04 17:03:10,815 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-04 17:03:10,815 INFO  L175             Difference]: Start difference. First operand has 109 places, 132 transitions, 1302 flow. Second operand 6 states and 98 transitions.
[2024-06-04 17:03:10,815 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 146 transitions, 1640 flow
[2024-06-04 17:03:10,861 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 146 transitions, 1552 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-04 17:03:10,863 INFO  L231             Difference]: Finished difference. Result has 110 places, 135 transitions, 1274 flow
[2024-06-04 17:03:10,863 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1274, PETRI_PLACES=110, PETRI_TRANSITIONS=135}
[2024-06-04 17:03:10,864 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places.
[2024-06-04 17:03:10,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 135 transitions, 1274 flow
[2024-06-04 17:03:10,864 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 17:03:10,864 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:10,864 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:10,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 17:03:10,864 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:10,865 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:10,865 INFO  L85        PathProgramCache]: Analyzing trace with hash 959840744, now seen corresponding path program 1 times
[2024-06-04 17:03:10,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:10,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133675862]
[2024-06-04 17:03:10,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:10,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:10,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:21,420 INFO  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:21,420 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:21,421 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133675862]
[2024-06-04 17:03:21,421 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133675862] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:21,421 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:21,421 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:03:21,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991699902]
[2024-06-04 17:03:21,421 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:21,422 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:03:21,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:21,422 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:03:21,422 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:03:21,657 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:03:21,657 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 135 transitions, 1274 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 17:03:21,657 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:21,657 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:03:21,657 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:22,893 INFO  L124   PetriNetUnfolderBase]: 2085/3151 cut-off events.
[2024-06-04 17:03:22,893 INFO  L125   PetriNetUnfolderBase]: For 69311/69362 co-relation queries the response was YES.
[2024-06-04 17:03:22,903 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19290 conditions, 3151 events. 2085/3151 cut-off events. For 69311/69362 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15027 event pairs, 452 based on Foata normal form. 15/3146 useless extension candidates. Maximal degree in co-relation 19237. Up to 2758 conditions per place. 
[2024-06-04 17:03:22,912 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 119 selfloop transitions, 32 changer transitions 0/172 dead transitions.
[2024-06-04 17:03:22,912 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 172 transitions, 1838 flow
[2024-06-04 17:03:22,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:03:22,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:03:22,913 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 17:03:22,913 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-04 17:03:22,913 INFO  L175             Difference]: Start difference. First operand has 110 places, 135 transitions, 1274 flow. Second operand 8 states and 153 transitions.
[2024-06-04 17:03:22,914 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 172 transitions, 1838 flow
[2024-06-04 17:03:22,950 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 172 transitions, 1800 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-04 17:03:22,952 INFO  L231             Difference]: Finished difference. Result has 114 places, 139 transitions, 1411 flow
[2024-06-04 17:03:22,952 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1411, PETRI_PLACES=114, PETRI_TRANSITIONS=139}
[2024-06-04 17:03:22,953 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places.
[2024-06-04 17:03:22,953 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 139 transitions, 1411 flow
[2024-06-04 17:03:22,953 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 17:03:22,953 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:22,953 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:22,953 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 17:03:22,954 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:22,954 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:22,954 INFO  L85        PathProgramCache]: Analyzing trace with hash -1294086404, now seen corresponding path program 1 times
[2024-06-04 17:03:22,954 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:22,954 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097213734]
[2024-06-04 17:03:22,954 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:22,955 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:23,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:33,139 INFO  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:33,139 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:33,139 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097213734]
[2024-06-04 17:03:33,140 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097213734] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:33,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:33,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:03:33,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126666772]
[2024-06-04 17:03:33,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:33,140 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:03:33,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:33,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:03:33,141 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:03:33,300 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:03:33,300 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 139 transitions, 1411 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 17:03:33,300 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:33,300 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:03:33,300 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:34,778 INFO  L124   PetriNetUnfolderBase]: 2307/3410 cut-off events.
[2024-06-04 17:03:34,778 INFO  L125   PetriNetUnfolderBase]: For 80576/80582 co-relation queries the response was YES.
[2024-06-04 17:03:34,790 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21424 conditions, 3410 events. 2307/3410 cut-off events. For 80576/80582 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15881 event pairs, 550 based on Foata normal form. 8/3417 useless extension candidates. Maximal degree in co-relation 21370. Up to 2735 conditions per place. 
[2024-06-04 17:03:34,802 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 132 selfloop transitions, 67 changer transitions 0/202 dead transitions.
[2024-06-04 17:03:34,802 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 202 transitions, 2397 flow
[2024-06-04 17:03:34,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:03:34,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:03:34,803 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions.
[2024-06-04 17:03:34,803 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4738095238095238
[2024-06-04 17:03:34,804 INFO  L175             Difference]: Start difference. First operand has 114 places, 139 transitions, 1411 flow. Second operand 10 states and 199 transitions.
[2024-06-04 17:03:34,804 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 202 transitions, 2397 flow
[2024-06-04 17:03:34,862 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 202 transitions, 2305 flow, removed 31 selfloop flow, removed 4 redundant places.
[2024-06-04 17:03:34,865 INFO  L231             Difference]: Finished difference. Result has 122 places, 151 transitions, 1645 flow
[2024-06-04 17:03:34,865 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1645, PETRI_PLACES=122, PETRI_TRANSITIONS=151}
[2024-06-04 17:03:34,865 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places.
[2024-06-04 17:03:34,865 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 151 transitions, 1645 flow
[2024-06-04 17:03:34,865 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 17:03:34,865 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:34,866 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:34,866 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 17:03:34,866 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:34,866 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:34,866 INFO  L85        PathProgramCache]: Analyzing trace with hash -1294086528, now seen corresponding path program 2 times
[2024-06-04 17:03:34,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:34,867 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275648377]
[2024-06-04 17:03:34,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:34,867 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:34,914 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:45,774 INFO  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:45,774 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:45,774 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275648377]
[2024-06-04 17:03:45,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275648377] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:45,774 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:45,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:03:45,774 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987581663]
[2024-06-04 17:03:45,774 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:45,775 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:03:45,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:45,775 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:03:45,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:03:45,941 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:03:45,941 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 151 transitions, 1645 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 17:03:45,941 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:45,942 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:03:45,942 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:47,269 INFO  L124   PetriNetUnfolderBase]: 2212/3323 cut-off events.
[2024-06-04 17:03:47,270 INFO  L125   PetriNetUnfolderBase]: For 87685/87736 co-relation queries the response was YES.
[2024-06-04 17:03:47,281 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21951 conditions, 3323 events. 2212/3323 cut-off events. For 87685/87736 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15898 event pairs, 576 based on Foata normal form. 15/3318 useless extension candidates. Maximal degree in co-relation 21893. Up to 2997 conditions per place. 
[2024-06-04 17:03:47,291 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 131 selfloop transitions, 28 changer transitions 0/183 dead transitions.
[2024-06-04 17:03:47,292 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 183 transitions, 2077 flow
[2024-06-04 17:03:47,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:03:47,294 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:03:47,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-04 17:03:47,294 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-04 17:03:47,294 INFO  L175             Difference]: Start difference. First operand has 122 places, 151 transitions, 1645 flow. Second operand 8 states and 150 transitions.
[2024-06-04 17:03:47,294 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 183 transitions, 2077 flow
[2024-06-04 17:03:47,354 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 183 transitions, 1932 flow, removed 40 selfloop flow, removed 5 redundant places.
[2024-06-04 17:03:47,356 INFO  L231             Difference]: Finished difference. Result has 125 places, 153 transitions, 1605 flow
[2024-06-04 17:03:47,356 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1605, PETRI_PLACES=125, PETRI_TRANSITIONS=153}
[2024-06-04 17:03:47,357 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places.
[2024-06-04 17:03:47,357 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 153 transitions, 1605 flow
[2024-06-04 17:03:47,357 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 17:03:47,357 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:47,357 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:47,357 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 17:03:47,357 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:47,357 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:47,358 INFO  L85        PathProgramCache]: Analyzing trace with hash 1073520224, now seen corresponding path program 3 times
[2024-06-04 17:03:47,358 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:47,358 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950939592]
[2024-06-04 17:03:47,358 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:47,358 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:47,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:57,190 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:03:57,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:57,191 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950939592]
[2024-06-04 17:03:57,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950939592] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:57,191 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:57,191 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:03:57,191 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029487762]
[2024-06-04 17:03:57,191 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:57,191 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:03:57,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:57,192 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:03:57,192 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:03:57,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:03:57,404 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 153 transitions, 1605 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 17:03:57,404 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:57,404 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:03:57,404 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:58,717 INFO  L124   PetriNetUnfolderBase]: 2204/3311 cut-off events.
[2024-06-04 17:03:58,717 INFO  L125   PetriNetUnfolderBase]: For 91308/91359 co-relation queries the response was YES.
[2024-06-04 17:03:58,729 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21896 conditions, 3311 events. 2204/3311 cut-off events. For 91308/91359 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15826 event pairs, 574 based on Foata normal form. 15/3306 useless extension candidates. Maximal degree in co-relation 21836. Up to 3018 conditions per place. 
[2024-06-04 17:03:58,739 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 132 selfloop transitions, 24 changer transitions 0/180 dead transitions.
[2024-06-04 17:03:58,739 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 180 transitions, 1985 flow
[2024-06-04 17:03:58,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:03:58,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:03:58,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-04 17:03:58,741 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-04 17:03:58,741 INFO  L175             Difference]: Start difference. First operand has 125 places, 153 transitions, 1605 flow. Second operand 8 states and 147 transitions.
[2024-06-04 17:03:58,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 180 transitions, 1985 flow
[2024-06-04 17:03:58,804 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 180 transitions, 1876 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-04 17:03:58,806 INFO  L231             Difference]: Finished difference. Result has 127 places, 153 transitions, 1551 flow
[2024-06-04 17:03:58,806 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1551, PETRI_PLACES=127, PETRI_TRANSITIONS=153}
[2024-06-04 17:03:58,807 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places.
[2024-06-04 17:03:58,807 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 153 transitions, 1551 flow
[2024-06-04 17:03:58,807 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 17:03:58,807 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:58,807 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:58,807 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 17:03:58,807 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:58,807 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:58,808 INFO  L85        PathProgramCache]: Analyzing trace with hash 1077988998, now seen corresponding path program 2 times
[2024-06-04 17:03:58,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:58,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367218643]
[2024-06-04 17:03:58,808 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:58,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:58,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:09,272 INFO  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:09,272 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:09,272 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367218643]
[2024-06-04 17:04:09,272 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367218643] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:09,272 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:09,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:04:09,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049404200]
[2024-06-04 17:04:09,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:09,273 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:04:09,273 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:09,273 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:04:09,274 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:04:09,502 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:04:09,502 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 153 transitions, 1551 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 17:04:09,502 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:09,502 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:04:09,502 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:10,942 INFO  L124   PetriNetUnfolderBase]: 2352/3477 cut-off events.
[2024-06-04 17:04:10,943 INFO  L125   PetriNetUnfolderBase]: For 100734/100740 co-relation queries the response was YES.
[2024-06-04 17:04:10,955 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23166 conditions, 3477 events. 2352/3477 cut-off events. For 100734/100740 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16245 event pairs, 536 based on Foata normal form. 8/3484 useless extension candidates. Maximal degree in co-relation 23105. Up to 2874 conditions per place. 
[2024-06-04 17:04:10,966 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 135 selfloop transitions, 62 changer transitions 0/200 dead transitions.
[2024-06-04 17:04:10,966 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 200 transitions, 2418 flow
[2024-06-04 17:04:10,967 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:04:10,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:04:10,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions.
[2024-06-04 17:04:10,967 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49107142857142855
[2024-06-04 17:04:10,968 INFO  L175             Difference]: Start difference. First operand has 127 places, 153 transitions, 1551 flow. Second operand 8 states and 165 transitions.
[2024-06-04 17:04:10,968 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 200 transitions, 2418 flow
[2024-06-04 17:04:11,046 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 200 transitions, 2355 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-04 17:04:11,048 INFO  L231             Difference]: Finished difference. Result has 129 places, 158 transitions, 1723 flow
[2024-06-04 17:04:11,048 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1723, PETRI_PLACES=129, PETRI_TRANSITIONS=158}
[2024-06-04 17:04:11,049 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places.
[2024-06-04 17:04:11,049 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 158 transitions, 1723 flow
[2024-06-04 17:04:11,049 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 17:04:11,049 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:11,050 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:11,050 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 17:04:11,050 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:11,050 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:11,050 INFO  L85        PathProgramCache]: Analyzing trace with hash 1077993648, now seen corresponding path program 3 times
[2024-06-04 17:04:11,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:11,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575617923]
[2024-06-04 17:04:11,050 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:11,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:11,094 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:21,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:04:21,288 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:21,288 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575617923]
[2024-06-04 17:04:21,288 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575617923] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:21,288 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:21,288 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:04:21,288 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799450836]
[2024-06-04 17:04:21,289 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:21,289 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:04:21,289 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:21,289 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:04:21,290 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:04:21,456 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:04:21,456 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 158 transitions, 1723 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 17:04:21,456 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:21,456 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:04:21,456 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:22,864 INFO  L124   PetriNetUnfolderBase]: 2388/3529 cut-off events.
[2024-06-04 17:04:22,865 INFO  L125   PetriNetUnfolderBase]: For 110717/110723 co-relation queries the response was YES.
[2024-06-04 17:04:22,877 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24402 conditions, 3529 events. 2388/3529 cut-off events. For 110717/110723 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 16527 event pairs, 537 based on Foata normal form. 8/3536 useless extension candidates. Maximal degree in co-relation 24339. Up to 3046 conditions per place. 
[2024-06-04 17:04:22,888 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 138 selfloop transitions, 57 changer transitions 0/198 dead transitions.
[2024-06-04 17:04:22,889 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 198 transitions, 2437 flow
[2024-06-04 17:04:22,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:04:22,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:04:22,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-04 17:04:22,890 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47023809523809523
[2024-06-04 17:04:22,890 INFO  L175             Difference]: Start difference. First operand has 129 places, 158 transitions, 1723 flow. Second operand 8 states and 158 transitions.
[2024-06-04 17:04:22,890 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 198 transitions, 2437 flow
[2024-06-04 17:04:22,970 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 198 transitions, 2259 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-04 17:04:22,975 INFO  L231             Difference]: Finished difference. Result has 131 places, 162 transitions, 1748 flow
[2024-06-04 17:04:22,976 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1748, PETRI_PLACES=131, PETRI_TRANSITIONS=162}
[2024-06-04 17:04:22,976 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places.
[2024-06-04 17:04:22,976 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 162 transitions, 1748 flow
[2024-06-04 17:04:22,976 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 17:04:22,976 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:22,976 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:22,976 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 17:04:22,977 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:22,977 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:22,977 INFO  L85        PathProgramCache]: Analyzing trace with hash 1078173572, now seen corresponding path program 1 times
[2024-06-04 17:04:22,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:22,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37299114]
[2024-06-04 17:04:22,977 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:22,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:23,033 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:33,691 INFO  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:33,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:33,691 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37299114]
[2024-06-04 17:04:33,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37299114] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:33,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:33,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:04:33,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473800194]
[2024-06-04 17:04:33,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:33,692 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:04:33,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:33,693 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:04:33,693 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:04:33,849 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:04:33,849 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 162 transitions, 1748 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 17:04:33,849 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:33,849 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:04:33,849 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:35,337 INFO  L124   PetriNetUnfolderBase]: 2444/3617 cut-off events.
[2024-06-04 17:04:35,338 INFO  L125   PetriNetUnfolderBase]: For 122105/122111 co-relation queries the response was YES.
[2024-06-04 17:04:35,350 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25105 conditions, 3617 events. 2444/3617 cut-off events. For 122105/122111 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17025 event pairs, 555 based on Foata normal form. 14/3630 useless extension candidates. Maximal degree in co-relation 25041. Up to 3116 conditions per place. 
[2024-06-04 17:04:35,360 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 143 selfloop transitions, 53 changer transitions 0/199 dead transitions.
[2024-06-04 17:04:35,361 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 199 transitions, 2460 flow
[2024-06-04 17:04:35,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:04:35,361 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:04:35,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-04 17:04:35,362 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-04 17:04:35,362 INFO  L175             Difference]: Start difference. First operand has 131 places, 162 transitions, 1748 flow. Second operand 8 states and 156 transitions.
[2024-06-04 17:04:35,362 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 199 transitions, 2460 flow
[2024-06-04 17:04:35,444 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 199 transitions, 2305 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-04 17:04:35,446 INFO  L231             Difference]: Finished difference. Result has 133 places, 166 transitions, 1788 flow
[2024-06-04 17:04:35,446 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1788, PETRI_PLACES=133, PETRI_TRANSITIONS=166}
[2024-06-04 17:04:35,447 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places.
[2024-06-04 17:04:35,447 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 166 transitions, 1788 flow
[2024-06-04 17:04:35,447 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 17:04:35,447 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:35,447 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:35,447 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 17:04:35,448 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:35,448 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:35,448 INFO  L85        PathProgramCache]: Analyzing trace with hash -147109192, now seen corresponding path program 4 times
[2024-06-04 17:04:35,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:35,448 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653706669]
[2024-06-04 17:04:35,448 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:35,449 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:35,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:44,276 INFO  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:44,276 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:44,276 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653706669]
[2024-06-04 17:04:44,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653706669] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:44,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:44,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:04:44,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277770442]
[2024-06-04 17:04:44,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:44,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:04:44,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:44,294 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:04:44,294 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:04:44,449 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:04:44,450 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 166 transitions, 1788 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 17:04:44,450 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:44,450 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:04:44,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:45,972 INFO  L124   PetriNetUnfolderBase]: 2480/3669 cut-off events.
[2024-06-04 17:04:45,973 INFO  L125   PetriNetUnfolderBase]: For 127742/127748 co-relation queries the response was YES.
[2024-06-04 17:04:45,985 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26015 conditions, 3669 events. 2480/3669 cut-off events. For 127742/127748 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17333 event pairs, 521 based on Foata normal form. 8/3676 useless extension candidates. Maximal degree in co-relation 25950. Up to 3124 conditions per place. 
[2024-06-04 17:04:45,997 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 141 selfloop transitions, 64 changer transitions 0/208 dead transitions.
[2024-06-04 17:04:45,997 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 208 transitions, 2616 flow
[2024-06-04 17:04:46,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:04:46,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:04:46,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-04 17:04:46,001 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-04 17:04:46,001 INFO  L175             Difference]: Start difference. First operand has 133 places, 166 transitions, 1788 flow. Second operand 8 states and 155 transitions.
[2024-06-04 17:04:46,001 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 208 transitions, 2616 flow
[2024-06-04 17:04:46,086 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 208 transitions, 2451 flow, removed 32 selfloop flow, removed 6 redundant places.
[2024-06-04 17:04:46,089 INFO  L231             Difference]: Finished difference. Result has 136 places, 173 transitions, 1920 flow
[2024-06-04 17:04:46,089 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1623, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1920, PETRI_PLACES=136, PETRI_TRANSITIONS=173}
[2024-06-04 17:04:46,089 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places.
[2024-06-04 17:04:46,089 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 173 transitions, 1920 flow
[2024-06-04 17:04:46,090 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 17:04:46,090 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:46,090 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:46,090 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 17:04:46,090 INFO  L420      AbstractCegarLoop]: === Iteration 30 === 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:46,090 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:46,090 INFO  L85        PathProgramCache]: Analyzing trace with hash -223694098, now seen corresponding path program 1 times
[2024-06-04 17:04:46,090 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:46,091 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989832262]
[2024-06-04 17:04:46,091 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:46,091 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:46,132 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:57,760 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:04:57,761 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:57,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989832262]
[2024-06-04 17:04:57,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989832262] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:57,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:57,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:04:57,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935621144]
[2024-06-04 17:04:57,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:57,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:04:57,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:57,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:04:57,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:04:57,860 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:04:57,861 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 173 transitions, 1920 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 17:04:57,861 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:57,861 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:04:57,861 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:59,106 INFO  L124   PetriNetUnfolderBase]: 2485/3675 cut-off events.
[2024-06-04 17:04:59,106 INFO  L125   PetriNetUnfolderBase]: For 134044/134044 co-relation queries the response was YES.
[2024-06-04 17:04:59,123 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26701 conditions, 3675 events. 2485/3675 cut-off events. For 134044/134044 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17295 event pairs, 634 based on Foata normal form. 1/3675 useless extension candidates. Maximal degree in co-relation 26634. Up to 3637 conditions per place. 
[2024-06-04 17:04:59,137 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 173 selfloop transitions, 16 changer transitions 0/192 dead transitions.
[2024-06-04 17:04:59,137 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 192 transitions, 2444 flow
[2024-06-04 17:04:59,138 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:04:59,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:04:59,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-04 17:04:59,138 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-04 17:04:59,138 INFO  L175             Difference]: Start difference. First operand has 136 places, 173 transitions, 1920 flow. Second operand 6 states and 105 transitions.
[2024-06-04 17:04:59,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 192 transitions, 2444 flow
[2024-06-04 17:04:59,245 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 192 transitions, 2298 flow, removed 30 selfloop flow, removed 5 redundant places.
[2024-06-04 17:04:59,247 INFO  L231             Difference]: Finished difference. Result has 137 places, 176 transitions, 1860 flow
[2024-06-04 17:04:59,248 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1860, PETRI_PLACES=137, PETRI_TRANSITIONS=176}
[2024-06-04 17:04:59,248 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 94 predicate places.
[2024-06-04 17:04:59,248 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 176 transitions, 1860 flow
[2024-06-04 17:04:59,248 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 17:04:59,248 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:59,248 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:59,249 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 17:04:59,249 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:59,249 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:59,249 INFO  L85        PathProgramCache]: Analyzing trace with hash -1741122390, now seen corresponding path program 2 times
[2024-06-04 17:04:59,249 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:59,249 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925980768]
[2024-06-04 17:04:59,249 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:59,249 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:59,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:08,496 INFO  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:08,497 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:08,497 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925980768]
[2024-06-04 17:05:08,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925980768] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:08,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:08,497 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:05:08,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685489615]
[2024-06-04 17:05:08,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:08,497 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:05:08,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:08,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:05:08,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:05:08,628 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:05:08,628 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 176 transitions, 1860 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 17:05:08,628 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:08,628 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:05:08,628 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:10,131 INFO  L124   PetriNetUnfolderBase]: 2513/3719 cut-off events.
[2024-06-04 17:05:10,131 INFO  L125   PetriNetUnfolderBase]: For 143928/143928 co-relation queries the response was YES.
[2024-06-04 17:05:10,145 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26741 conditions, 3719 events. 2513/3719 cut-off events. For 143928/143928 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17601 event pairs, 624 based on Foata normal form. 6/3724 useless extension candidates. Maximal degree in co-relation 26673. Up to 3619 conditions per place. 
[2024-06-04 17:05:10,158 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 178 selfloop transitions, 24 changer transitions 0/205 dead transitions.
[2024-06-04 17:05:10,158 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 205 transitions, 2466 flow
[2024-06-04 17:05:10,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:05:10,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:05:10,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-04 17:05:10,159 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41964285714285715
[2024-06-04 17:05:10,159 INFO  L175             Difference]: Start difference. First operand has 137 places, 176 transitions, 1860 flow. Second operand 8 states and 141 transitions.
[2024-06-04 17:05:10,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 205 transitions, 2466 flow
[2024-06-04 17:05:10,276 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 205 transitions, 2348 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-04 17:05:10,278 INFO  L231             Difference]: Finished difference. Result has 140 places, 179 transitions, 1880 flow
[2024-06-04 17:05:10,279 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1880, PETRI_PLACES=140, PETRI_TRANSITIONS=179}
[2024-06-04 17:05:10,279 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places.
[2024-06-04 17:05:10,279 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 179 transitions, 1880 flow
[2024-06-04 17:05:10,279 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 17:05:10,279 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:10,279 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:05:10,279 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 17:05:10,280 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:05:10,280 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:10,280 INFO  L85        PathProgramCache]: Analyzing trace with hash 18536886, now seen corresponding path program 3 times
[2024-06-04 17:05:10,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:10,280 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447160523]
[2024-06-04 17:05:10,280 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:10,280 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:10,326 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:20,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:05:20,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:20,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447160523]
[2024-06-04 17:05:20,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447160523] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:20,470 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:20,470 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:05:20,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572206414]
[2024-06-04 17:05:20,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:20,470 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:05:20,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:20,471 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:05:20,471 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:05:20,596 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:05:20,596 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 179 transitions, 1880 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 17:05:20,596 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:20,596 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:05:20,596 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:22,090 INFO  L124   PetriNetUnfolderBase]: 2541/3763 cut-off events.
[2024-06-04 17:05:22,091 INFO  L125   PetriNetUnfolderBase]: For 153516/153516 co-relation queries the response was YES.
[2024-06-04 17:05:22,106 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27573 conditions, 3763 events. 2541/3763 cut-off events. For 153516/153516 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17875 event pairs, 621 based on Foata normal form. 6/3768 useless extension candidates. Maximal degree in co-relation 27504. Up to 3603 conditions per place. 
[2024-06-04 17:05:22,118 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 177 selfloop transitions, 30 changer transitions 0/210 dead transitions.
[2024-06-04 17:05:22,118 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 210 transitions, 2572 flow
[2024-06-04 17:05:22,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:05:22,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:05:22,119 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-04 17:05:22,119 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 17:05:22,119 INFO  L175             Difference]: Start difference. First operand has 140 places, 179 transitions, 1880 flow. Second operand 8 states and 144 transitions.
[2024-06-04 17:05:22,120 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 210 transitions, 2572 flow
[2024-06-04 17:05:22,229 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 210 transitions, 2458 flow, removed 35 selfloop flow, removed 6 redundant places.
[2024-06-04 17:05:22,232 INFO  L231             Difference]: Finished difference. Result has 142 places, 182 transitions, 1922 flow
[2024-06-04 17:05:22,232 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1922, PETRI_PLACES=142, PETRI_TRANSITIONS=182}
[2024-06-04 17:05:22,232 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 99 predicate places.
[2024-06-04 17:05:22,232 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 182 transitions, 1922 flow
[2024-06-04 17:05:22,232 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 17:05:22,233 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:22,233 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:05:22,233 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 17:05:22,233 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:05:22,233 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:22,233 INFO  L85        PathProgramCache]: Analyzing trace with hash 830245694, now seen corresponding path program 4 times
[2024-06-04 17:05:22,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:22,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129483278]
[2024-06-04 17:05:22,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:22,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:22,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:31,117 INFO  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:31,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:31,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129483278]
[2024-06-04 17:05:31,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129483278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:31,117 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:31,117 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:05:31,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453283240]
[2024-06-04 17:05:31,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:31,118 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:05:31,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:31,118 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:05:31,118 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:05:31,248 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:05:31,248 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 182 transitions, 1922 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 17:05:31,248 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:31,248 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:05:31,248 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:32,804 INFO  L124   PetriNetUnfolderBase]: 2569/3807 cut-off events.
[2024-06-04 17:05:32,804 INFO  L125   PetriNetUnfolderBase]: For 163502/163502 co-relation queries the response was YES.
[2024-06-04 17:05:32,820 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28296 conditions, 3807 events. 2569/3807 cut-off events. For 163502/163502 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18135 event pairs, 626 based on Foata normal form. 6/3812 useless extension candidates. Maximal degree in co-relation 28226. Up to 3648 conditions per place. 
[2024-06-04 17:05:32,833 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 172 selfloop transitions, 36 changer transitions 0/211 dead transitions.
[2024-06-04 17:05:32,833 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 211 transitions, 2556 flow
[2024-06-04 17:05:32,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:05:32,834 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:05:32,834 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-04 17:05:32,834 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4255952380952381
[2024-06-04 17:05:32,834 INFO  L175             Difference]: Start difference. First operand has 142 places, 182 transitions, 1922 flow. Second operand 8 states and 143 transitions.
[2024-06-04 17:05:32,834 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 211 transitions, 2556 flow
[2024-06-04 17:05:32,936 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 211 transitions, 2424 flow, removed 38 selfloop flow, removed 6 redundant places.
[2024-06-04 17:05:32,939 INFO  L231             Difference]: Finished difference. Result has 144 places, 185 transitions, 1968 flow
[2024-06-04 17:05:32,939 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1968, PETRI_PLACES=144, PETRI_TRANSITIONS=185}
[2024-06-04 17:05:32,939 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places.
[2024-06-04 17:05:32,939 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 185 transitions, 1968 flow
[2024-06-04 17:05:32,939 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 17:05:32,939 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:32,939 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:05:32,940 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 17:05:32,940 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:05:32,940 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:32,940 INFO  L85        PathProgramCache]: Analyzing trace with hash 830245446, now seen corresponding path program 1 times
[2024-06-04 17:05:32,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:32,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416954889]
[2024-06-04 17:05:32,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:32,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:32,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:41,913 INFO  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:41,913 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:41,913 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416954889]
[2024-06-04 17:05:41,913 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416954889] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:41,913 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:41,913 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:05:41,913 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315604858]
[2024-06-04 17:05:41,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:41,914 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:05:41,914 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:41,914 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:05:41,914 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:05:42,052 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:05:42,052 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 185 transitions, 1968 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 17:05:42,052 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:42,052 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:05:42,052 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:43,433 INFO  L124   PetriNetUnfolderBase]: 2571/3811 cut-off events.
[2024-06-04 17:05:43,434 INFO  L125   PetriNetUnfolderBase]: For 169302/169308 co-relation queries the response was YES.
[2024-06-04 17:05:43,450 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28541 conditions, 3811 events. 2571/3811 cut-off events. For 169302/169308 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18158 event pairs, 622 based on Foata normal form. 9/3819 useless extension candidates. Maximal degree in co-relation 28470. Up to 3656 conditions per place. 
[2024-06-04 17:05:43,464 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 172 selfloop transitions, 36 changer transitions 0/211 dead transitions.
[2024-06-04 17:05:43,465 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 211 transitions, 2592 flow
[2024-06-04 17:05:43,465 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:05:43,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:05:43,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-04 17:05:43,466 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4387755102040816
[2024-06-04 17:05:43,466 INFO  L175             Difference]: Start difference. First operand has 144 places, 185 transitions, 1968 flow. Second operand 7 states and 129 transitions.
[2024-06-04 17:05:43,466 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 211 transitions, 2592 flow
[2024-06-04 17:05:43,608 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 211 transitions, 2438 flow, removed 45 selfloop flow, removed 6 redundant places.
[2024-06-04 17:05:43,610 INFO  L231             Difference]: Finished difference. Result has 145 places, 189 transitions, 1994 flow
[2024-06-04 17:05:43,611 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1994, PETRI_PLACES=145, PETRI_TRANSITIONS=189}
[2024-06-04 17:05:43,611 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places.
[2024-06-04 17:05:43,611 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 189 transitions, 1994 flow
[2024-06-04 17:05:43,611 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 17:05:43,611 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:43,611 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:05:43,611 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 17:05:43,612 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:05:43,612 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:43,612 INFO  L85        PathProgramCache]: Analyzing trace with hash -88644192, now seen corresponding path program 5 times
[2024-06-04 17:05:43,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:43,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164037525]
[2024-06-04 17:05:43,612 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:43,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:43,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:53,355 INFO  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:53,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:53,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164037525]
[2024-06-04 17:05:53,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164037525] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:53,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:53,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:05:53,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993127870]
[2024-06-04 17:05:53,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:53,356 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:05:53,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:53,356 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:05:53,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:05:53,555 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:05:53,555 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 189 transitions, 1994 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 17:05:53,555 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:53,555 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:05:53,555 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:55,018 INFO  L124   PetriNetUnfolderBase]: 2575/3817 cut-off events.
[2024-06-04 17:05:55,018 INFO  L125   PetriNetUnfolderBase]: For 165875/165881 co-relation queries the response was YES.
[2024-06-04 17:05:55,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28083 conditions, 3817 events. 2575/3817 cut-off events. For 165875/165881 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18200 event pairs, 622 based on Foata normal form. 12/3828 useless extension candidates. Maximal degree in co-relation 28011. Up to 3674 conditions per place. 
[2024-06-04 17:05:55,047 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 190 selfloop transitions, 27 changer transitions 0/220 dead transitions.
[2024-06-04 17:05:55,048 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 220 transitions, 2656 flow
[2024-06-04 17:05:55,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:05:55,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:05:55,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-04 17:05:55,050 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 17:05:55,050 INFO  L175             Difference]: Start difference. First operand has 145 places, 189 transitions, 1994 flow. Second operand 8 states and 144 transitions.
[2024-06-04 17:05:55,051 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 220 transitions, 2656 flow
[2024-06-04 17:05:55,183 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 220 transitions, 2538 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-04 17:05:55,185 INFO  L231             Difference]: Finished difference. Result has 148 places, 193 transitions, 2037 flow
[2024-06-04 17:05:55,185 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1876, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2037, PETRI_PLACES=148, PETRI_TRANSITIONS=193}
[2024-06-04 17:05:55,186 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places.
[2024-06-04 17:05:55,186 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 193 transitions, 2037 flow
[2024-06-04 17:05:55,186 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 17:05:55,186 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:55,186 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:05:55,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 17:05:55,186 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:05:55,186 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:55,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 1693425448, now seen corresponding path program 5 times
[2024-06-04 17:05:55,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:55,187 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136444096]
[2024-06-04 17:05:55,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:55,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:55,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:06:03,906 INFO  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:06:03,906 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:06:03,906 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136444096]
[2024-06-04 17:06:03,906 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136444096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:06:03,906 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:06:03,906 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:06:03,906 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739484152]
[2024-06-04 17:06:03,906 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:06:03,906 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:06:03,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:06:03,907 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:06:03,907 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:06:04,117 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:06:04,117 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 193 transitions, 2037 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 17:06:04,118 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:06:04,118 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:06:04,118 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:06:05,543 INFO  L124   PetriNetUnfolderBase]: 2578/3821 cut-off events.
[2024-06-04 17:06:05,544 INFO  L125   PetriNetUnfolderBase]: For 173156/173156 co-relation queries the response was YES.
[2024-06-04 17:06:05,559 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28265 conditions, 3821 events. 2578/3821 cut-off events. For 173156/173156 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18223 event pairs, 606 based on Foata normal form. 6/3826 useless extension candidates. Maximal degree in co-relation 28192. Up to 3693 conditions per place. 
[2024-06-04 17:06:05,572 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 191 selfloop transitions, 28 changer transitions 0/222 dead transitions.
[2024-06-04 17:06:05,573 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 222 transitions, 2699 flow
[2024-06-04 17:06:05,573 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:06:05,573 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:06:05,573 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-04 17:06:05,574 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-04 17:06:05,574 INFO  L175             Difference]: Start difference. First operand has 148 places, 193 transitions, 2037 flow. Second operand 8 states and 142 transitions.
[2024-06-04 17:06:05,574 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 222 transitions, 2699 flow
[2024-06-04 17:06:05,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 222 transitions, 2580 flow, removed 35 selfloop flow, removed 6 redundant places.
[2024-06-04 17:06:05,683 INFO  L231             Difference]: Finished difference. Result has 150 places, 196 transitions, 2080 flow
[2024-06-04 17:06:05,684 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2080, PETRI_PLACES=150, PETRI_TRANSITIONS=196}
[2024-06-04 17:06:05,684 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places.
[2024-06-04 17:06:05,684 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 196 transitions, 2080 flow
[2024-06-04 17:06:05,684 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 17:06:05,684 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:06:05,684 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:06:05,684 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 17:06:05,685 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 17:06:05,685 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:06:05,685 INFO  L85        PathProgramCache]: Analyzing trace with hash 1191062822, now seen corresponding path program 2 times
[2024-06-04 17:06:05,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:06:05,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584976662]
[2024-06-04 17:06:05,685 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:06:05,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:06:05,722 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:06:16,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:06:16,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:06:16,295 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584976662]
[2024-06-04 17:06:16,295 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584976662] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:06:16,295 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:06:16,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:06:16,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159072944]
[2024-06-04 17:06:16,295 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:06:16,296 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:06:16,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:06:16,296 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:06:16,296 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:06:16,430 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:06:16,430 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 196 transitions, 2080 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 17:06:16,430 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:06:16,430 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:06:16,430 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:06:17,694 INFO  L124   PetriNetUnfolderBase]: 2575/3817 cut-off events.
[2024-06-04 17:06:17,694 INFO  L125   PetriNetUnfolderBase]: For 176758/176758 co-relation queries the response was YES.
[2024-06-04 17:06:17,710 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28467 conditions, 3817 events. 2575/3817 cut-off events. For 176758/176758 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18178 event pairs, 634 based on Foata normal form. 1/3817 useless extension candidates. Maximal degree in co-relation 28393. Up to 3798 conditions per place. 
[2024-06-04 17:06:17,723 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 191 selfloop transitions, 11 changer transitions 0/205 dead transitions.
[2024-06-04 17:06:17,723 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 205 transitions, 2506 flow
[2024-06-04 17:06:17,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:06:17,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:06:17,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-04 17:06:17,724 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38095238095238093
[2024-06-04 17:06:17,724 INFO  L175             Difference]: Start difference. First operand has 150 places, 196 transitions, 2080 flow. Second operand 6 states and 96 transitions.
[2024-06-04 17:06:17,724 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 205 transitions, 2506 flow
[2024-06-04 17:06:17,861 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 205 transitions, 2356 flow, removed 49 selfloop flow, removed 6 redundant places.
[2024-06-04 17:06:17,864 INFO  L231             Difference]: Finished difference. Result has 150 places, 196 transitions, 1958 flow
[2024-06-04 17:06:17,864 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1958, PETRI_PLACES=150, PETRI_TRANSITIONS=196}
[2024-06-04 17:06:17,864 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places.
[2024-06-04 17:06:17,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 196 transitions, 1958 flow
[2024-06-04 17:06:17,864 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 17:06:17,865 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:06:17,865 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:06:17,865 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 17:06:17,865 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:06:17,865 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:06:17,865 INFO  L85        PathProgramCache]: Analyzing trace with hash -217974226, now seen corresponding path program 1 times
[2024-06-04 17:06:17,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:06:17,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41913397]
[2024-06-04 17:06:17,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:06:17,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:06:17,894 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:06:31,009 INFO  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:06:31,009 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:06:31,010 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41913397]
[2024-06-04 17:06:31,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41913397] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:06:31,010 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:06:31,010 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:06:31,010 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848737547]
[2024-06-04 17:06:31,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:06:31,011 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:06:31,011 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:06:31,012 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:06:31,012 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:06:31,133 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:06:31,133 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 196 transitions, 1958 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 17:06:31,133 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:06:31,133 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:06:31,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:06:32,501 INFO  L124   PetriNetUnfolderBase]: 2574/3816 cut-off events.
[2024-06-04 17:06:32,501 INFO  L125   PetriNetUnfolderBase]: For 182468/182468 co-relation queries the response was YES.
[2024-06-04 17:06:32,517 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28240 conditions, 3816 events. 2574/3816 cut-off events. For 182468/182468 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18146 event pairs, 632 based on Foata normal form. 3/3818 useless extension candidates. Maximal degree in co-relation 28165. Up to 3748 conditions per place. 
[2024-06-04 17:06:32,529 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 185 selfloop transitions, 24 changer transitions 0/212 dead transitions.
[2024-06-04 17:06:32,529 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 212 transitions, 2523 flow
[2024-06-04 17:06:32,529 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:06:32,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:06:32,530 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-04 17:06:32,530 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42063492063492064
[2024-06-04 17:06:32,530 INFO  L175             Difference]: Start difference. First operand has 150 places, 196 transitions, 1958 flow. Second operand 6 states and 106 transitions.
[2024-06-04 17:06:32,530 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 212 transitions, 2523 flow
[2024-06-04 17:06:32,643 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 212 transitions, 2491 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-04 17:06:32,646 INFO  L231             Difference]: Finished difference. Result has 151 places, 199 transitions, 2030 flow
[2024-06-04 17:06:32,646 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1926, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2030, PETRI_PLACES=151, PETRI_TRANSITIONS=199}
[2024-06-04 17:06:32,646 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 108 predicate places.
[2024-06-04 17:06:32,646 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 199 transitions, 2030 flow
[2024-06-04 17:06:32,646 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 17:06:32,646 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:06:32,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:06:32,647 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 17:06:32,647 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:06:32,647 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:06:32,647 INFO  L85        PathProgramCache]: Analyzing trace with hash 1190002064, now seen corresponding path program 2 times
[2024-06-04 17:06:32,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:06:32,647 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760510422]
[2024-06-04 17:06:32,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:06:32,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:06:32,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:06:46,009 INFO  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:06:46,010 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:06:46,010 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760510422]
[2024-06-04 17:06:46,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760510422] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:06:46,010 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:06:46,010 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:06:46,010 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420863595]
[2024-06-04 17:06:46,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:06:46,010 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:06:46,010 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:06:46,011 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:06:46,011 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:06:46,140 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:06:46,140 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 199 transitions, 2030 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 17:06:46,140 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:06:46,140 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:06:46,140 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:06:47,487 INFO  L124   PetriNetUnfolderBase]: 2539/3763 cut-off events.
[2024-06-04 17:06:47,487 INFO  L125   PetriNetUnfolderBase]: For 188935/188941 co-relation queries the response was YES.
[2024-06-04 17:06:47,503 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28178 conditions, 3763 events. 2539/3763 cut-off events. For 188935/188941 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17850 event pairs, 642 based on Foata normal form. 3/3765 useless extension candidates. Maximal degree in co-relation 28102. Up to 3697 conditions per place. 
[2024-06-04 17:06:47,516 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 180 selfloop transitions, 25 changer transitions 0/208 dead transitions.
[2024-06-04 17:06:47,516 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 208 transitions, 2462 flow
[2024-06-04 17:06:47,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:06:47,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:06:47,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-04 17:06:47,517 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4087301587301587
[2024-06-04 17:06:47,517 INFO  L175             Difference]: Start difference. First operand has 151 places, 199 transitions, 2030 flow. Second operand 6 states and 103 transitions.
[2024-06-04 17:06:47,517 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 208 transitions, 2462 flow
[2024-06-04 17:06:47,663 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 208 transitions, 2402 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-04 17:06:47,665 INFO  L231             Difference]: Finished difference. Result has 153 places, 199 transitions, 2026 flow
[2024-06-04 17:06:47,665 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2026, PETRI_PLACES=153, PETRI_TRANSITIONS=199}
[2024-06-04 17:06:47,666 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places.
[2024-06-04 17:06:47,666 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 199 transitions, 2026 flow
[2024-06-04 17:06:47,666 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 17:06:47,666 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:06:47,666 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:06:47,666 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 17:06:47,666 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:06:47,666 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:06:47,667 INFO  L85        PathProgramCache]: Analyzing trace with hash -309706496, now seen corresponding path program 1 times
[2024-06-04 17:06:47,667 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:06:47,667 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586609519]
[2024-06-04 17:06:47,667 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:06:47,667 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:06:47,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:06:58,181 INFO  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:06:58,181 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:06:58,181 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586609519]
[2024-06-04 17:06:58,181 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586609519] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:06:58,182 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:06:58,182 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:06:58,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002572825]
[2024-06-04 17:06:58,182 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:06:58,182 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:06:58,182 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:06:58,182 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:06:58,183 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:06:58,463 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:06:58,464 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 199 transitions, 2026 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:06:58,464 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:06:58,464 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:06:58,464 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:07:00,364 INFO  L124   PetriNetUnfolderBase]: 2826/4224 cut-off events.
[2024-06-04 17:07:00,364 INFO  L125   PetriNetUnfolderBase]: For 240013/240019 co-relation queries the response was YES.
[2024-06-04 17:07:00,383 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32773 conditions, 4224 events. 2826/4224 cut-off events. For 240013/240019 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 20952 event pairs, 433 based on Foata normal form. 26/4249 useless extension candidates. Maximal degree in co-relation 32696. Up to 2720 conditions per place. 
[2024-06-04 17:07:00,397 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 183 selfloop transitions, 74 changer transitions 0/260 dead transitions.
[2024-06-04 17:07:00,397 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 260 transitions, 3320 flow
[2024-06-04 17:07:00,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:07:00,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:07:00,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-04 17:07:00,398 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48677248677248675
[2024-06-04 17:07:00,398 INFO  L175             Difference]: Start difference. First operand has 153 places, 199 transitions, 2026 flow. Second operand 9 states and 184 transitions.
[2024-06-04 17:07:00,398 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 260 transitions, 3320 flow
[2024-06-04 17:07:00,549 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 260 transitions, 3248 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-04 17:07:00,552 INFO  L231             Difference]: Finished difference. Result has 158 places, 205 transitions, 2308 flow
[2024-06-04 17:07:00,552 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2308, PETRI_PLACES=158, PETRI_TRANSITIONS=205}
[2024-06-04 17:07:00,552 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places.
[2024-06-04 17:07:00,552 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 205 transitions, 2308 flow
[2024-06-04 17:07:00,553 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:07:00,553 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:07:00,553 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:07:00,553 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 17:07:00,553 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:07:00,553 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:07:00,554 INFO  L85        PathProgramCache]: Analyzing trace with hash -307828826, now seen corresponding path program 2 times
[2024-06-04 17:07:00,554 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:07:00,554 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354940247]
[2024-06-04 17:07:00,554 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:07:00,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:07:00,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:07:12,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:07:12,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:07:12,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354940247]
[2024-06-04 17:07:12,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354940247] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:07:12,096 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:07:12,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:07:12,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178607618]
[2024-06-04 17:07:12,096 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:07:12,096 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:07:12,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:07:12,097 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:07:12,097 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:07:12,315 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:07:12,316 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 205 transitions, 2308 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:07:12,316 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:07:12,316 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:07:12,316 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:07:14,188 INFO  L124   PetriNetUnfolderBase]: 3010/4513 cut-off events.
[2024-06-04 17:07:14,188 INFO  L125   PetriNetUnfolderBase]: For 275347/275353 co-relation queries the response was YES.
[2024-06-04 17:07:14,209 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36022 conditions, 4513 events. 3010/4513 cut-off events. For 275347/275353 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 22917 event pairs, 651 based on Foata normal form. 32/4544 useless extension candidates. Maximal degree in co-relation 35943. Up to 3494 conditions per place. 
[2024-06-04 17:07:14,227 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 169 selfloop transitions, 94 changer transitions 0/266 dead transitions.
[2024-06-04 17:07:14,227 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 266 transitions, 3549 flow
[2024-06-04 17:07:14,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:07:14,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:07:14,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-04 17:07:14,228 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-04 17:07:14,228 INFO  L175             Difference]: Start difference. First operand has 158 places, 205 transitions, 2308 flow. Second operand 9 states and 180 transitions.
[2024-06-04 17:07:14,228 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 266 transitions, 3549 flow
[2024-06-04 17:07:14,447 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 266 transitions, 3380 flow, removed 41 selfloop flow, removed 4 redundant places.
[2024-06-04 17:07:14,450 INFO  L231             Difference]: Finished difference. Result has 166 places, 218 transitions, 2603 flow
[2024-06-04 17:07:14,450 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2603, PETRI_PLACES=166, PETRI_TRANSITIONS=218}
[2024-06-04 17:07:14,450 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 123 predicate places.
[2024-06-04 17:07:14,450 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 218 transitions, 2603 flow
[2024-06-04 17:07:14,451 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:07:14,451 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:07:14,451 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:07:14,451 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 17:07:14,451 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:07:14,451 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:07:14,451 INFO  L85        PathProgramCache]: Analyzing trace with hash -307832546, now seen corresponding path program 3 times
[2024-06-04 17:07:14,451 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:07:14,451 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615004869]
[2024-06-04 17:07:14,451 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:07:14,451 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:07:14,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:07:26,740 INFO  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:07:26,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:07:26,740 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615004869]
[2024-06-04 17:07:26,740 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615004869] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:07:26,741 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:07:26,741 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:07:26,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096634634]
[2024-06-04 17:07:26,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:07:26,741 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:07:26,741 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:07:26,741 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:07:26,741 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:07:26,951 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:07:26,952 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 218 transitions, 2603 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:07:26,952 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:07:26,952 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:07:26,952 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:07:28,961 INFO  L124   PetriNetUnfolderBase]: 3178/4781 cut-off events.
[2024-06-04 17:07:28,961 INFO  L125   PetriNetUnfolderBase]: For 292981/292987 co-relation queries the response was YES.
[2024-06-04 17:07:28,985 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39641 conditions, 4781 events. 3178/4781 cut-off events. For 292981/292987 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 24797 event pairs, 679 based on Foata normal form. 26/4806 useless extension candidates. Maximal degree in co-relation 39557. Up to 3565 conditions per place. 
[2024-06-04 17:07:29,003 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 188 selfloop transitions, 80 changer transitions 0/271 dead transitions.
[2024-06-04 17:07:29,003 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 271 transitions, 3755 flow
[2024-06-04 17:07:29,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:07:29,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:07:29,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-04 17:07:29,004 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47883597883597884
[2024-06-04 17:07:29,005 INFO  L175             Difference]: Start difference. First operand has 166 places, 218 transitions, 2603 flow. Second operand 9 states and 181 transitions.
[2024-06-04 17:07:29,005 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 271 transitions, 3755 flow
[2024-06-04 17:07:29,333 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 271 transitions, 3554 flow, removed 35 selfloop flow, removed 4 redundant places.
[2024-06-04 17:07:29,336 INFO  L231             Difference]: Finished difference. Result has 172 places, 222 transitions, 2724 flow
[2024-06-04 17:07:29,337 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2402, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2724, PETRI_PLACES=172, PETRI_TRANSITIONS=222}
[2024-06-04 17:07:29,337 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places.
[2024-06-04 17:07:29,337 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 222 transitions, 2724 flow
[2024-06-04 17:07:29,337 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:07:29,337 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:07:29,338 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:07:29,338 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 17:07:29,338 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:07:29,338 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:07:29,338 INFO  L85        PathProgramCache]: Analyzing trace with hash 450162378, now seen corresponding path program 4 times
[2024-06-04 17:07:29,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:07:29,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776808504]
[2024-06-04 17:07:29,339 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:07:29,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:07:29,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:07:40,914 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:07:40,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:07:40,915 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776808504]
[2024-06-04 17:07:40,915 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776808504] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:07:40,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:07:40,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:07:40,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638833003]
[2024-06-04 17:07:40,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:07:40,917 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:07:40,917 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:07:40,917 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:07:40,917 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:07:41,129 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:07:41,130 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 222 transitions, 2724 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:07:41,130 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:07:41,130 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:07:41,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:07:43,102 INFO  L124   PetriNetUnfolderBase]: 3298/4965 cut-off events.
[2024-06-04 17:07:43,102 INFO  L125   PetriNetUnfolderBase]: For 307718/307724 co-relation queries the response was YES.
[2024-06-04 17:07:43,129 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41061 conditions, 4965 events. 3298/4965 cut-off events. For 307718/307724 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 25972 event pairs, 763 based on Foata normal form. 20/4984 useless extension candidates. Maximal degree in co-relation 40975. Up to 4337 conditions per place. 
[2024-06-04 17:07:43,148 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 194 selfloop transitions, 73 changer transitions 0/270 dead transitions.
[2024-06-04 17:07:43,149 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 270 transitions, 3701 flow
[2024-06-04 17:07:43,149 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:07:43,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:07:43,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-04 17:07:43,150 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46296296296296297
[2024-06-04 17:07:43,150 INFO  L175             Difference]: Start difference. First operand has 172 places, 222 transitions, 2724 flow. Second operand 9 states and 175 transitions.
[2024-06-04 17:07:43,150 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 270 transitions, 3701 flow
[2024-06-04 17:07:43,486 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 270 transitions, 3561 flow, removed 41 selfloop flow, removed 4 redundant places.
[2024-06-04 17:07:43,490 INFO  L231             Difference]: Finished difference. Result has 178 places, 230 transitions, 2914 flow
[2024-06-04 17:07:43,490 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2584, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2914, PETRI_PLACES=178, PETRI_TRANSITIONS=230}
[2024-06-04 17:07:43,491 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 135 predicate places.
[2024-06-04 17:07:43,491 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 230 transitions, 2914 flow
[2024-06-04 17:07:43,491 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:07:43,491 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:07:43,491 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:07:43,491 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 17:07:43,491 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:07:43,492 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:07:43,492 INFO  L85        PathProgramCache]: Analyzing trace with hash -221137016, now seen corresponding path program 5 times
[2024-06-04 17:07:43,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:07:43,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623271466]
[2024-06-04 17:07:43,492 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:07:43,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:07:43,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:07:54,442 INFO  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:07:54,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:07:54,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623271466]
[2024-06-04 17:07:54,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623271466] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:07:54,443 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:07:54,443 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:07:54,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769247170]
[2024-06-04 17:07:54,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:07:54,443 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:07:54,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:07:54,444 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:07:54,444 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:07:54,620 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:07:54,621 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 230 transitions, 2914 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:07:54,621 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:07:54,621 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:07:54,621 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:07:56,678 INFO  L124   PetriNetUnfolderBase]: 3422/5169 cut-off events.
[2024-06-04 17:07:56,678 INFO  L125   PetriNetUnfolderBase]: For 338395/338401 co-relation queries the response was YES.
[2024-06-04 17:07:56,703 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43477 conditions, 5169 events. 3422/5169 cut-off events. For 338395/338401 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 27312 event pairs, 796 based on Foata normal form. 32/5200 useless extension candidates. Maximal degree in co-relation 43388. Up to 4394 conditions per place. 
[2024-06-04 17:07:56,723 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 195 selfloop transitions, 77 changer transitions 0/275 dead transitions.
[2024-06-04 17:07:56,723 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 275 transitions, 3959 flow
[2024-06-04 17:07:56,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:07:56,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:07:56,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-04 17:07:56,724 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-04 17:07:56,724 INFO  L175             Difference]: Start difference. First operand has 178 places, 230 transitions, 2914 flow. Second operand 9 states and 176 transitions.
[2024-06-04 17:07:56,724 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 275 transitions, 3959 flow
[2024-06-04 17:07:57,011 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 275 transitions, 3765 flow, removed 52 selfloop flow, removed 5 redundant places.
[2024-06-04 17:07:57,014 INFO  L231             Difference]: Finished difference. Result has 182 places, 232 transitions, 2979 flow
[2024-06-04 17:07:57,015 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2720, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2979, PETRI_PLACES=182, PETRI_TRANSITIONS=232}
[2024-06-04 17:07:57,015 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-04 17:07:57,015 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 232 transitions, 2979 flow
[2024-06-04 17:07:57,015 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:07:57,015 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:07:57,015 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:07:57,016 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 17:07:57,016 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:07:57,016 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:07:57,016 INFO  L85        PathProgramCache]: Analyzing trace with hash -221140736, now seen corresponding path program 6 times
[2024-06-04 17:07:57,016 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:07:57,016 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848785769]
[2024-06-04 17:07:57,017 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:07:57,017 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:07:57,058 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:08:08,166 INFO  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:08:08,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:08:08,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848785769]
[2024-06-04 17:08:08,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848785769] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:08:08,167 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:08:08,167 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:08:08,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950342691]
[2024-06-04 17:08:08,167 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:08:08,167 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:08:08,167 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:08:08,167 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:08:08,167 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:08:08,453 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:08:08,453 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 232 transitions, 2979 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:08:08,453 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:08:08,453 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:08:08,453 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:08:10,539 INFO  L124   PetriNetUnfolderBase]: 3626/5501 cut-off events.
[2024-06-04 17:08:10,539 INFO  L125   PetriNetUnfolderBase]: For 369372/369378 co-relation queries the response was YES.
[2024-06-04 17:08:10,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46971 conditions, 5501 events. 3626/5501 cut-off events. For 369372/369378 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29628 event pairs, 867 based on Foata normal form. 26/5526 useless extension candidates. Maximal degree in co-relation 46881. Up to 4252 conditions per place. 
[2024-06-04 17:08:10,594 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 203 selfloop transitions, 79 changer transitions 0/285 dead transitions.
[2024-06-04 17:08:10,594 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 285 transitions, 4363 flow
[2024-06-04 17:08:10,594 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:08:10,595 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:08:10,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-04 17:08:10,595 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-04 17:08:10,595 INFO  L175             Difference]: Start difference. First operand has 182 places, 232 transitions, 2979 flow. Second operand 9 states and 180 transitions.
[2024-06-04 17:08:10,595 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 285 transitions, 4363 flow
[2024-06-04 17:08:10,986 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 285 transitions, 4081 flow, removed 39 selfloop flow, removed 10 redundant places.
[2024-06-04 17:08:10,990 INFO  L231             Difference]: Finished difference. Result has 182 places, 236 transitions, 3040 flow
[2024-06-04 17:08:10,990 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2697, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3040, PETRI_PLACES=182, PETRI_TRANSITIONS=236}
[2024-06-04 17:08:10,990 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-04 17:08:10,990 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 236 transitions, 3040 flow
[2024-06-04 17:08:10,991 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:08:10,991 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:08:10,991 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:08:10,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 17:08:10,991 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:08:10,991 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:08:10,992 INFO  L85        PathProgramCache]: Analyzing trace with hash 813907252, now seen corresponding path program 1 times
[2024-06-04 17:08:10,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:08:10,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280022112]
[2024-06-04 17:08:10,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:08:10,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:08:11,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:08:22,745 INFO  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:08:22,745 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:08:22,745 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280022112]
[2024-06-04 17:08:22,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280022112] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:08:22,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:08:22,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:08:22,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586704145]
[2024-06-04 17:08:22,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:08:22,746 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:08:22,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:08:22,746 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:08:22,746 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:08:22,957 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:08:22,957 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 236 transitions, 3040 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:08:22,957 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:08:22,957 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:08:22,958 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:08:24,816 INFO  L124   PetriNetUnfolderBase]: 3646/5529 cut-off events.
[2024-06-04 17:08:24,817 INFO  L125   PetriNetUnfolderBase]: For 363076/363082 co-relation queries the response was YES.
[2024-06-04 17:08:24,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47028 conditions, 5529 events. 3646/5529 cut-off events. For 363076/363082 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 29907 event pairs, 900 based on Foata normal form. 6/5534 useless extension candidates. Maximal degree in co-relation 46939. Up to 5073 conditions per place. 
[2024-06-04 17:08:24,869 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 202 selfloop transitions, 63 changer transitions 0/268 dead transitions.
[2024-06-04 17:08:24,869 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 268 transitions, 3911 flow
[2024-06-04 17:08:24,870 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:08:24,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:08:24,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-04 17:08:24,870 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-04 17:08:24,870 INFO  L175             Difference]: Start difference. First operand has 182 places, 236 transitions, 3040 flow. Second operand 7 states and 137 transitions.
[2024-06-04 17:08:24,870 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 268 transitions, 3911 flow
[2024-06-04 17:08:25,288 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 268 transitions, 3722 flow, removed 46 selfloop flow, removed 5 redundant places.
[2024-06-04 17:08:25,292 INFO  L231             Difference]: Finished difference. Result has 184 places, 241 transitions, 3083 flow
[2024-06-04 17:08:25,292 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2856, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3083, PETRI_PLACES=184, PETRI_TRANSITIONS=241}
[2024-06-04 17:08:25,292 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 141 predicate places.
[2024-06-04 17:08:25,293 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 241 transitions, 3083 flow
[2024-06-04 17:08:25,293 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:08:25,293 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:08:25,293 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:08:25,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 17:08:25,293 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:08:25,294 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:08:25,294 INFO  L85        PathProgramCache]: Analyzing trace with hash -942081762, now seen corresponding path program 7 times
[2024-06-04 17:08:25,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:08:25,294 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892045130]
[2024-06-04 17:08:25,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:08:25,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:08:25,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:08:36,185 INFO  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:08:36,185 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:08:36,185 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892045130]
[2024-06-04 17:08:36,185 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892045130] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:08:36,185 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:08:36,185 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:08:36,185 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181890384]
[2024-06-04 17:08:36,185 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:08:36,186 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:08:36,186 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:08:36,186 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:08:36,186 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:08:36,488 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:08:36,488 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 241 transitions, 3083 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:08:36,488 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:08:36,488 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:08:36,488 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:08:38,872 INFO  L124   PetriNetUnfolderBase]: 3836/5843 cut-off events.
[2024-06-04 17:08:38,872 INFO  L125   PetriNetUnfolderBase]: For 415877/415883 co-relation queries the response was YES.
[2024-06-04 17:08:38,901 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50280 conditions, 5843 events. 3836/5843 cut-off events. For 415877/415883 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 32249 event pairs, 757 based on Foata normal form. 26/5868 useless extension candidates. Maximal degree in co-relation 50189. Up to 4334 conditions per place. 
[2024-06-04 17:08:38,924 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 198 selfloop transitions, 103 changer transitions 0/304 dead transitions.
[2024-06-04 17:08:38,924 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 304 transitions, 4716 flow
[2024-06-04 17:08:38,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:08:38,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:08:38,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-04 17:08:38,925 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-04 17:08:38,925 INFO  L175             Difference]: Start difference. First operand has 184 places, 241 transitions, 3083 flow. Second operand 9 states and 189 transitions.
[2024-06-04 17:08:38,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 304 transitions, 4716 flow
[2024-06-04 17:08:39,294 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 304 transitions, 4603 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-04 17:08:39,297 INFO  L231             Difference]: Finished difference. Result has 191 places, 248 transitions, 3465 flow
[2024-06-04 17:08:39,297 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2970, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3465, PETRI_PLACES=191, PETRI_TRANSITIONS=248}
[2024-06-04 17:08:39,298 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places.
[2024-06-04 17:08:39,298 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 248 transitions, 3465 flow
[2024-06-04 17:08:39,298 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:08:39,298 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:08:39,298 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:08:39,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 17:08:39,298 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:08:39,298 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:08:39,298 INFO  L85        PathProgramCache]: Analyzing trace with hash -942078042, now seen corresponding path program 8 times
[2024-06-04 17:08:39,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:08:39,299 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689033969]
[2024-06-04 17:08:39,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:08:39,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:08:39,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:08:50,393 INFO  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:08:50,394 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:08:50,394 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689033969]
[2024-06-04 17:08:50,394 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689033969] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:08:50,394 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:08:50,394 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:08:50,394 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873739840]
[2024-06-04 17:08:50,394 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:08:50,395 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:08:50,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:08:50,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:08:50,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:08:50,551 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:08:50,552 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 248 transitions, 3465 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:08:50,552 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:08:50,552 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:08:50,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:08:52,888 INFO  L124   PetriNetUnfolderBase]: 3960/6047 cut-off events.
[2024-06-04 17:08:52,888 INFO  L125   PetriNetUnfolderBase]: For 454096/454102 co-relation queries the response was YES.
[2024-06-04 17:08:52,925 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53598 conditions, 6047 events. 3960/6047 cut-off events. For 454096/454102 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 33717 event pairs, 976 based on Foata normal form. 32/6078 useless extension candidates. Maximal degree in co-relation 53504. Up to 5213 conditions per place. 
[2024-06-04 17:08:52,951 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 214 selfloop transitions, 81 changer transitions 0/298 dead transitions.
[2024-06-04 17:08:52,952 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 298 transitions, 4587 flow
[2024-06-04 17:08:52,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:08:52,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:08:52,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions.
[2024-06-04 17:08:52,953 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48148148148148145
[2024-06-04 17:08:52,953 INFO  L175             Difference]: Start difference. First operand has 191 places, 248 transitions, 3465 flow. Second operand 9 states and 182 transitions.
[2024-06-04 17:08:52,953 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 298 transitions, 4587 flow
[2024-06-04 17:08:53,632 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 298 transitions, 4250 flow, removed 53 selfloop flow, removed 6 redundant places.
[2024-06-04 17:08:53,636 INFO  L231             Difference]: Finished difference. Result has 194 places, 250 transitions, 3408 flow
[2024-06-04 17:08:53,636 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3133, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3408, PETRI_PLACES=194, PETRI_TRANSITIONS=250}
[2024-06-04 17:08:53,636 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-04 17:08:53,636 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 250 transitions, 3408 flow
[2024-06-04 17:08:53,637 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:08:53,637 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:08:53,637 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:08:53,637 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 17:08:53,637 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:08:53,637 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:08:53,637 INFO  L85        PathProgramCache]: Analyzing trace with hash -1319724252, now seen corresponding path program 9 times
[2024-06-04 17:08:53,637 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:08:53,637 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579812774]
[2024-06-04 17:08:53,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:08:53,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:08:53,679 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:09:04,955 INFO  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:09:04,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:09:04,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579812774]
[2024-06-04 17:09:04,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579812774] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:09:04,956 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:09:04,956 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:09:04,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297498291]
[2024-06-04 17:09:04,956 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:09:04,956 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:09:04,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:09:04,957 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:09:04,957 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:09:05,180 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:09:05,181 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 250 transitions, 3408 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:09:05,181 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:09:05,181 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:09:05,181 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:09:07,555 INFO  L124   PetriNetUnfolderBase]: 4044/6179 cut-off events.
[2024-06-04 17:09:07,555 INFO  L125   PetriNetUnfolderBase]: For 464041/464047 co-relation queries the response was YES.
[2024-06-04 17:09:07,591 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53467 conditions, 6179 events. 4044/6179 cut-off events. For 464041/464047 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 34619 event pairs, 993 based on Foata normal form. 20/6198 useless extension candidates. Maximal degree in co-relation 53374. Up to 5541 conditions per place. 
[2024-06-04 17:09:07,616 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 207 selfloop transitions, 86 changer transitions 0/296 dead transitions.
[2024-06-04 17:09:07,616 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 296 transitions, 4427 flow
[2024-06-04 17:09:07,617 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:09:07,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:09:07,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-04 17:09:07,617 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46825396825396826
[2024-06-04 17:09:07,617 INFO  L175             Difference]: Start difference. First operand has 194 places, 250 transitions, 3408 flow. Second operand 9 states and 177 transitions.
[2024-06-04 17:09:07,617 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 296 transitions, 4427 flow
[2024-06-04 17:09:08,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 296 transitions, 4197 flow, removed 36 selfloop flow, removed 7 redundant places.
[2024-06-04 17:09:08,250 INFO  L231             Difference]: Finished difference. Result has 196 places, 254 transitions, 3501 flow
[2024-06-04 17:09:08,251 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3178, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3501, PETRI_PLACES=196, PETRI_TRANSITIONS=254}
[2024-06-04 17:09:08,251 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 153 predicate places.
[2024-06-04 17:09:08,251 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 254 transitions, 3501 flow
[2024-06-04 17:09:08,251 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:09:08,251 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:09:08,251 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:09:08,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 17:09:08,251 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:09:08,252 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:09:08,252 INFO  L85        PathProgramCache]: Analyzing trace with hash -941927940, now seen corresponding path program 1 times
[2024-06-04 17:09:08,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:09:08,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622649130]
[2024-06-04 17:09:08,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:09:08,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:09:08,300 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:09:18,335 INFO  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:09:18,335 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:09:18,335 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622649130]
[2024-06-04 17:09:18,335 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622649130] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:09:18,335 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:09:18,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:09:18,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389272208]
[2024-06-04 17:09:18,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:09:18,336 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:09:18,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:09:18,336 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:09:18,336 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:09:18,521 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:09:18,522 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 254 transitions, 3501 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:09:18,522 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:09:18,522 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:09:18,522 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:09:20,700 INFO  L124   PetriNetUnfolderBase]: 4072/6223 cut-off events.
[2024-06-04 17:09:20,700 INFO  L125   PetriNetUnfolderBase]: For 462811/462817 co-relation queries the response was YES.
[2024-06-04 17:09:20,736 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54024 conditions, 6223 events. 4072/6223 cut-off events. For 462811/462817 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 34938 event pairs, 996 based on Foata normal form. 8/6230 useless extension candidates. Maximal degree in co-relation 53930. Up to 5741 conditions per place. 
[2024-06-04 17:09:20,761 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 224 selfloop transitions, 65 changer transitions 0/292 dead transitions.
[2024-06-04 17:09:20,761 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 292 transitions, 4473 flow
[2024-06-04 17:09:20,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:09:20,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:09:20,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-04 17:09:20,762 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-04 17:09:20,762 INFO  L175             Difference]: Start difference. First operand has 196 places, 254 transitions, 3501 flow. Second operand 8 states and 156 transitions.
[2024-06-04 17:09:20,762 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 292 transitions, 4473 flow
[2024-06-04 17:09:21,409 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 292 transitions, 4188 flow, removed 60 selfloop flow, removed 7 redundant places.
[2024-06-04 17:09:21,413 INFO  L231             Difference]: Finished difference. Result has 197 places, 257 transitions, 3470 flow
[2024-06-04 17:09:21,413 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3216, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3470, PETRI_PLACES=197, PETRI_TRANSITIONS=257}
[2024-06-04 17:09:21,414 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 154 predicate places.
[2024-06-04 17:09:21,414 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 257 transitions, 3470 flow
[2024-06-04 17:09:21,414 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:09:21,414 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:09:21,414 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:09:21,414 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 17:09:21,414 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:09:21,414 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:09:21,414 INFO  L85        PathProgramCache]: Analyzing trace with hash -936363750, now seen corresponding path program 2 times
[2024-06-04 17:09:21,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:09:21,415 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824960777]
[2024-06-04 17:09:21,415 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:09:21,415 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:09:21,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:09:32,166 INFO  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:09:32,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:09:32,166 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824960777]
[2024-06-04 17:09:32,166 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824960777] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:09:32,166 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:09:32,166 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:09:32,166 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352540937]
[2024-06-04 17:09:32,166 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:09:32,166 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:09:32,167 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:09:32,167 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:09:32,167 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:09:32,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:09:32,318 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 257 transitions, 3470 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:09:32,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:09:32,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:09:32,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:09:34,648 INFO  L124   PetriNetUnfolderBase]: 4100/6267 cut-off events.
[2024-06-04 17:09:34,648 INFO  L125   PetriNetUnfolderBase]: For 474125/474131 co-relation queries the response was YES.
[2024-06-04 17:09:34,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54066 conditions, 6267 events. 4100/6267 cut-off events. For 474125/474131 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 35275 event pairs, 998 based on Foata normal form. 8/6274 useless extension candidates. Maximal degree in co-relation 53971. Up to 5785 conditions per place. 
[2024-06-04 17:09:34,713 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 227 selfloop transitions, 61 changer transitions 0/291 dead transitions.
[2024-06-04 17:09:34,713 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 291 transitions, 4342 flow
[2024-06-04 17:09:34,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:09:34,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:09:34,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-04 17:09:34,714 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494047619047619
[2024-06-04 17:09:34,714 INFO  L175             Difference]: Start difference. First operand has 197 places, 257 transitions, 3470 flow. Second operand 8 states and 151 transitions.
[2024-06-04 17:09:34,714 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 291 transitions, 4342 flow
[2024-06-04 17:09:35,290 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 291 transitions, 4112 flow, removed 52 selfloop flow, removed 6 redundant places.
[2024-06-04 17:09:35,294 INFO  L231             Difference]: Finished difference. Result has 199 places, 260 transitions, 3492 flow
[2024-06-04 17:09:35,294 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3240, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3492, PETRI_PLACES=199, PETRI_TRANSITIONS=260}
[2024-06-04 17:09:35,295 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places.
[2024-06-04 17:09:35,295 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 260 transitions, 3492 flow
[2024-06-04 17:09:35,295 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:09:35,295 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:09:35,295 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:09:35,295 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 17:09:35,295 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:09:35,295 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:09:35,295 INFO  L85        PathProgramCache]: Analyzing trace with hash -1314361872, now seen corresponding path program 10 times
[2024-06-04 17:09:35,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:09:35,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776650326]
[2024-06-04 17:09:35,296 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:09:35,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:09:35,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:09:47,104 INFO  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:09:47,104 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:09:47,104 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776650326]
[2024-06-04 17:09:47,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776650326] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:09:47,104 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:09:47,104 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:09:47,104 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260449790]
[2024-06-04 17:09:47,104 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:09:47,105 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:09:47,105 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:09:47,105 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:09:47,105 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:09:47,338 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:09:47,344 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 260 transitions, 3492 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:09:47,344 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:09:47,344 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:09:47,344 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:09:49,759 INFO  L124   PetriNetUnfolderBase]: 4184/6399 cut-off events.
[2024-06-04 17:09:49,759 INFO  L125   PetriNetUnfolderBase]: For 515131/515137 co-relation queries the response was YES.
[2024-06-04 17:09:49,795 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55651 conditions, 6399 events. 4184/6399 cut-off events. For 515131/515137 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 36252 event pairs, 980 based on Foata normal form. 20/6418 useless extension candidates. Maximal degree in co-relation 55555. Up to 5761 conditions per place. 
[2024-06-04 17:09:49,820 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 219 selfloop transitions, 80 changer transitions 0/302 dead transitions.
[2024-06-04 17:09:49,820 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 302 transitions, 4437 flow
[2024-06-04 17:09:49,821 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:09:49,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:09:49,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-04 17:09:49,821 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-04 17:09:49,821 INFO  L175             Difference]: Start difference. First operand has 199 places, 260 transitions, 3492 flow. Second operand 9 states and 172 transitions.
[2024-06-04 17:09:49,821 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 302 transitions, 4437 flow
[2024-06-04 17:09:50,331 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 302 transitions, 4209 flow, removed 55 selfloop flow, removed 6 redundant places.
[2024-06-04 17:09:50,334 INFO  L231             Difference]: Finished difference. Result has 202 places, 264 transitions, 3587 flow
[2024-06-04 17:09:50,335 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3264, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3587, PETRI_PLACES=202, PETRI_TRANSITIONS=264}
[2024-06-04 17:09:50,335 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 159 predicate places.
[2024-06-04 17:09:50,335 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 264 transitions, 3587 flow
[2024-06-04 17:09:50,336 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:09:50,336 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:09:50,336 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:09:50,336 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 17:09:50,336 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:09:50,336 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:09:50,336 INFO  L85        PathProgramCache]: Analyzing trace with hash -265201066, now seen corresponding path program 3 times
[2024-06-04 17:09:50,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:09:50,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837112028]
[2024-06-04 17:09:50,336 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:09:50,336 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:09:50,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:10:00,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:10:00,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:10:00,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837112028]
[2024-06-04 17:10:00,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837112028] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:10:00,332 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:10:00,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:10:00,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715071243]
[2024-06-04 17:10:00,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:10:00,332 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:10:00,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:10:00,332 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:10:00,333 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:10:00,669 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:10:00,669 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 264 transitions, 3587 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:10:00,670 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:10:00,670 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:10:00,670 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:10:02,977 INFO  L124   PetriNetUnfolderBase]: 4212/6443 cut-off events.
[2024-06-04 17:10:02,977 INFO  L125   PetriNetUnfolderBase]: For 522712/522718 co-relation queries the response was YES.
[2024-06-04 17:10:03,015 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56905 conditions, 6443 events. 4212/6443 cut-off events. For 522712/522718 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 36610 event pairs, 968 based on Foata normal form. 8/6450 useless extension candidates. Maximal degree in co-relation 56808. Up to 5807 conditions per place. 
[2024-06-04 17:10:03,041 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 223 selfloop transitions, 72 changer transitions 0/298 dead transitions.
[2024-06-04 17:10:03,041 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 298 transitions, 4483 flow
[2024-06-04 17:10:03,042 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:10:03,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:10:03,042 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-04 17:10:03,042 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494047619047619
[2024-06-04 17:10:03,043 INFO  L175             Difference]: Start difference. First operand has 202 places, 264 transitions, 3587 flow. Second operand 8 states and 151 transitions.
[2024-06-04 17:10:03,043 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 298 transitions, 4483 flow
[2024-06-04 17:10:03,729 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 298 transitions, 4197 flow, removed 66 selfloop flow, removed 7 redundant places.
[2024-06-04 17:10:03,733 INFO  L231             Difference]: Finished difference. Result has 203 places, 267 transitions, 3584 flow
[2024-06-04 17:10:03,733 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3301, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3584, PETRI_PLACES=203, PETRI_TRANSITIONS=267}
[2024-06-04 17:10:03,733 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places.
[2024-06-04 17:10:03,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 267 transitions, 3584 flow
[2024-06-04 17:10:03,734 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:10:03,734 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:10:03,734 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:10:03,734 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 17:10:03,734 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:10:03,734 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:10:03,734 INFO  L85        PathProgramCache]: Analyzing trace with hash -2136962836, now seen corresponding path program 2 times
[2024-06-04 17:10:03,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:10:03,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937827119]
[2024-06-04 17:10:03,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:10:03,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:10:03,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:10:15,268 INFO  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:10:15,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:10:15,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937827119]
[2024-06-04 17:10:15,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937827119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:10:15,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:10:15,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:10:15,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004492458]
[2024-06-04 17:10:15,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:10:15,269 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:10:15,269 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:10:15,269 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:10:15,270 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:10:15,445 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:10:15,445 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 267 transitions, 3584 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:15,445 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:10:15,445 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:10:15,445 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:10:17,615 INFO  L124   PetriNetUnfolderBase]: 4278/6535 cut-off events.
[2024-06-04 17:10:17,615 INFO  L125   PetriNetUnfolderBase]: For 535460/535466 co-relation queries the response was YES.
[2024-06-04 17:10:17,654 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57667 conditions, 6535 events. 4278/6535 cut-off events. For 535460/535466 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 37087 event pairs, 1014 based on Foata normal form. 6/6540 useless extension candidates. Maximal degree in co-relation 57569. Up to 6033 conditions per place. 
[2024-06-04 17:10:17,679 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 228 selfloop transitions, 70 changer transitions 0/301 dead transitions.
[2024-06-04 17:10:17,680 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 301 transitions, 4693 flow
[2024-06-04 17:10:17,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:10:17,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:10:17,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-04 17:10:17,681 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445578231292517
[2024-06-04 17:10:17,681 INFO  L175             Difference]: Start difference. First operand has 203 places, 267 transitions, 3584 flow. Second operand 7 states and 131 transitions.
[2024-06-04 17:10:17,681 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 301 transitions, 4693 flow
[2024-06-04 17:10:18,397 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 301 transitions, 4416 flow, removed 59 selfloop flow, removed 6 redundant places.
[2024-06-04 17:10:18,401 INFO  L231             Difference]: Finished difference. Result has 205 places, 280 transitions, 3744 flow
[2024-06-04 17:10:18,401 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3327, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3744, PETRI_PLACES=205, PETRI_TRANSITIONS=280}
[2024-06-04 17:10:18,401 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places.
[2024-06-04 17:10:18,401 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 280 transitions, 3744 flow
[2024-06-04 17:10:18,401 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:18,402 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:10:18,402 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:10:18,402 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 17:10:18,402 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:10:18,402 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:10:18,402 INFO  L85        PathProgramCache]: Analyzing trace with hash -2136962464, now seen corresponding path program 1 times
[2024-06-04 17:10:18,402 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:10:18,402 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823581840]
[2024-06-04 17:10:18,402 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:10:18,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:10:18,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:10:29,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:10:29,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:10:29,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823581840]
[2024-06-04 17:10:29,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823581840] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:10:29,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:10:29,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:10:29,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90569653]
[2024-06-04 17:10:29,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:10:29,757 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:10:29,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:10:29,758 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:10:29,758 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:10:29,907 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:10:29,908 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 280 transitions, 3744 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:29,908 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:10:29,908 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:10:29,908 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:10:32,072 INFO  L124   PetriNetUnfolderBase]: 4309/6577 cut-off events.
[2024-06-04 17:10:32,072 INFO  L125   PetriNetUnfolderBase]: For 549476/549476 co-relation queries the response was YES.
[2024-06-04 17:10:32,109 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58113 conditions, 6577 events. 4309/6577 cut-off events. For 549476/549476 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 37230 event pairs, 1157 based on Foata normal form. 3/6579 useless extension candidates. Maximal degree in co-relation 58013. Up to 6512 conditions per place. 
[2024-06-04 17:10:32,133 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 284 selfloop transitions, 23 changer transitions 0/310 dead transitions.
[2024-06-04 17:10:32,133 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 310 transitions, 4620 flow
[2024-06-04 17:10:32,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:10:32,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:10:32,134 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-04 17:10:32,134 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-04 17:10:32,134 INFO  L175             Difference]: Start difference. First operand has 205 places, 280 transitions, 3744 flow. Second operand 7 states and 123 transitions.
[2024-06-04 17:10:32,134 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 310 transitions, 4620 flow
[2024-06-04 17:10:32,722 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 310 transitions, 4522 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-04 17:10:32,726 INFO  L231             Difference]: Finished difference. Result has 210 places, 289 transitions, 3824 flow
[2024-06-04 17:10:32,726 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3646, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3824, PETRI_PLACES=210, PETRI_TRANSITIONS=289}
[2024-06-04 17:10:32,726 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places.
[2024-06-04 17:10:32,726 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 289 transitions, 3824 flow
[2024-06-04 17:10:32,726 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:32,727 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:10:32,727 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:10:32,727 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 17:10:32,727 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:10:32,727 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:10:32,727 INFO  L85        PathProgramCache]: Analyzing trace with hash 251059763, now seen corresponding path program 1 times
[2024-06-04 17:10:32,727 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:10:32,727 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638107131]
[2024-06-04 17:10:32,727 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:10:32,727 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:10:32,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:10:42,834 INFO  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:10:42,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:10:42,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638107131]
[2024-06-04 17:10:42,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638107131] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:10:42,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:10:42,835 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:10:42,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025754664]
[2024-06-04 17:10:42,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:10:42,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:10:42,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:10:42,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:10:42,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:10:43,087 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:10:43,087 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 289 transitions, 3824 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:10:43,087 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:10:43,087 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:10:43,087 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:10:45,468 INFO  L124   PetriNetUnfolderBase]: 4309/6578 cut-off events.
[2024-06-04 17:10:45,468 INFO  L125   PetriNetUnfolderBase]: For 564160/564166 co-relation queries the response was YES.
[2024-06-04 17:10:45,507 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58388 conditions, 6578 events. 4309/6578 cut-off events. For 564160/564166 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 37269 event pairs, 1132 based on Foata normal form. 9/6586 useless extension candidates. Maximal degree in co-relation 58286. Up to 6390 conditions per place. 
[2024-06-04 17:10:45,533 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 269 selfloop transitions, 47 changer transitions 0/319 dead transitions.
[2024-06-04 17:10:45,533 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 319 transitions, 4648 flow
[2024-06-04 17:10:45,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:10:45,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:10:45,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-04 17:10:45,535 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43154761904761907
[2024-06-04 17:10:45,535 INFO  L175             Difference]: Start difference. First operand has 210 places, 289 transitions, 3824 flow. Second operand 8 states and 145 transitions.
[2024-06-04 17:10:45,535 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 319 transitions, 4648 flow
[2024-06-04 17:10:46,175 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 319 transitions, 4582 flow, removed 27 selfloop flow, removed 3 redundant places.
[2024-06-04 17:10:46,179 INFO  L231             Difference]: Finished difference. Result has 215 places, 293 transitions, 3996 flow
[2024-06-04 17:10:46,179 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3758, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3996, PETRI_PLACES=215, PETRI_TRANSITIONS=293}
[2024-06-04 17:10:46,179 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 172 predicate places.
[2024-06-04 17:10:46,179 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 293 transitions, 3996 flow
[2024-06-04 17:10:46,180 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:10:46,180 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:10:46,180 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:10:46,180 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 17:10:46,180 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:10:46,180 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:10:46,180 INFO  L85        PathProgramCache]: Analyzing trace with hash 1803707004, now seen corresponding path program 4 times
[2024-06-04 17:10:46,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:10:46,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240974661]
[2024-06-04 17:10:46,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:10:46,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:10:46,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:10:56,357 INFO  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:10:56,358 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:10:56,358 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240974661]
[2024-06-04 17:10:56,358 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240974661] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:10:56,358 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:10:56,358 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:10:56,358 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911707510]
[2024-06-04 17:10:56,358 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:10:56,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:10:56,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:10:56,359 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:10:56,359 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:10:56,559 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:10:56,559 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 293 transitions, 3996 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:10:56,559 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:10:56,559 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:10:56,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:10:58,818 INFO  L124   PetriNetUnfolderBase]: 4334/6617 cut-off events.
[2024-06-04 17:10:58,818 INFO  L125   PetriNetUnfolderBase]: For 589499/589505 co-relation queries the response was YES.
[2024-06-04 17:10:58,860 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59226 conditions, 6617 events. 4334/6617 cut-off events. For 589499/589505 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 37542 event pairs, 1142 based on Foata normal form. 12/6628 useless extension candidates. Maximal degree in co-relation 59122. Up to 6441 conditions per place. 
[2024-06-04 17:10:58,989 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 277 selfloop transitions, 42 changer transitions 0/322 dead transitions.
[2024-06-04 17:10:58,989 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 322 transitions, 4834 flow
[2024-06-04 17:10:58,990 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:10:58,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:10:58,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-04 17:10:58,990 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 17:10:58,990 INFO  L175             Difference]: Start difference. First operand has 215 places, 293 transitions, 3996 flow. Second operand 8 states and 144 transitions.
[2024-06-04 17:10:58,990 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 322 transitions, 4834 flow
[2024-06-04 17:10:59,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 322 transitions, 4656 flow, removed 47 selfloop flow, removed 6 redundant places.
[2024-06-04 17:10:59,697 INFO  L231             Difference]: Finished difference. Result has 217 places, 296 transitions, 4049 flow
[2024-06-04 17:10:59,697 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3818, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4049, PETRI_PLACES=217, PETRI_TRANSITIONS=296}
[2024-06-04 17:10:59,697 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places.
[2024-06-04 17:10:59,697 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 296 transitions, 4049 flow
[2024-06-04 17:10:59,697 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:10:59,698 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:10:59,698 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:10:59,698 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 17:10:59,698 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:10:59,698 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:10:59,698 INFO  L85        PathProgramCache]: Analyzing trace with hash 1547213934, now seen corresponding path program 5 times
[2024-06-04 17:10:59,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:10:59,698 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024434959]
[2024-06-04 17:10:59,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:10:59,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:10:59,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:09,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:11:09,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:09,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024434959]
[2024-06-04 17:11:09,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024434959] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:09,494 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:09,494 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:11:09,494 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397797513]
[2024-06-04 17:11:09,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:09,495 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:11:09,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:09,495 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:11:09,495 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:11:09,760 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:11:09,760 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 296 transitions, 4049 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:11:09,760 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:09,760 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:11:09,760 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:11:12,222 INFO  L124   PetriNetUnfolderBase]: 4384/6695 cut-off events.
[2024-06-04 17:11:12,223 INFO  L125   PetriNetUnfolderBase]: For 618784/618790 co-relation queries the response was YES.
[2024-06-04 17:11:12,263 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60584 conditions, 6695 events. 4384/6695 cut-off events. For 618784/618790 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 38097 event pairs, 1148 based on Foata normal form. 12/6706 useless extension candidates. Maximal degree in co-relation 60479. Up to 6512 conditions per place. 
[2024-06-04 17:11:12,288 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 291 selfloop transitions, 34 changer transitions 0/328 dead transitions.
[2024-06-04 17:11:12,288 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 328 transitions, 5044 flow
[2024-06-04 17:11:12,289 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:11:12,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:11:12,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-04 17:11:12,289 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4255952380952381
[2024-06-04 17:11:12,289 INFO  L175             Difference]: Start difference. First operand has 217 places, 296 transitions, 4049 flow. Second operand 8 states and 143 transitions.
[2024-06-04 17:11:12,289 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 328 transitions, 5044 flow
[2024-06-04 17:11:13,152 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 328 transitions, 4710 flow, removed 126 selfloop flow, removed 6 redundant places.
[2024-06-04 17:11:13,156 INFO  L231             Difference]: Finished difference. Result has 220 places, 302 transitions, 4090 flow
[2024-06-04 17:11:13,157 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3844, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4090, PETRI_PLACES=220, PETRI_TRANSITIONS=302}
[2024-06-04 17:11:13,157 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places.
[2024-06-04 17:11:13,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 302 transitions, 4090 flow
[2024-06-04 17:11:13,157 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:11:13,157 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:11:13,157 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:11:13,157 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 17:11:13,157 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:11:13,158 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:11:13,158 INFO  L85        PathProgramCache]: Analyzing trace with hash 1803714444, now seen corresponding path program 6 times
[2024-06-04 17:11:13,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:11:13,158 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702698692]
[2024-06-04 17:11:13,158 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:11:13,158 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:11:13,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:22,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:11:22,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:22,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702698692]
[2024-06-04 17:11:22,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702698692] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:22,494 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:22,494 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:11:22,494 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397437506]
[2024-06-04 17:11:22,494 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:22,494 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:11:22,494 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:22,495 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:11:22,495 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:11:22,709 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:11:22,709 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 302 transitions, 4090 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:11:22,709 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:22,709 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:11:22,709 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:11:25,164 INFO  L124   PetriNetUnfolderBase]: 4409/6734 cut-off events.
[2024-06-04 17:11:25,164 INFO  L125   PetriNetUnfolderBase]: For 636761/636767 co-relation queries the response was YES.
[2024-06-04 17:11:25,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61023 conditions, 6734 events. 4409/6734 cut-off events. For 636761/636767 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 38412 event pairs, 1149 based on Foata normal form. 12/6745 useless extension candidates. Maximal degree in co-relation 60916. Up to 6431 conditions per place. 
[2024-06-04 17:11:25,230 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 273 selfloop transitions, 55 changer transitions 0/331 dead transitions.
[2024-06-04 17:11:25,231 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 331 transitions, 4956 flow
[2024-06-04 17:11:25,231 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:11:25,231 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:11:25,232 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-04 17:11:25,232 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43154761904761907
[2024-06-04 17:11:25,232 INFO  L175             Difference]: Start difference. First operand has 220 places, 302 transitions, 4090 flow. Second operand 8 states and 145 transitions.
[2024-06-04 17:11:25,232 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 331 transitions, 4956 flow
[2024-06-04 17:11:25,980 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 331 transitions, 4768 flow, removed 66 selfloop flow, removed 5 redundant places.
[2024-06-04 17:11:25,984 INFO  L231             Difference]: Finished difference. Result has 223 places, 305 transitions, 4174 flow
[2024-06-04 17:11:25,985 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3902, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4174, PETRI_PLACES=223, PETRI_TRANSITIONS=305}
[2024-06-04 17:11:25,985 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 180 predicate places.
[2024-06-04 17:11:25,985 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 305 transitions, 4174 flow
[2024-06-04 17:11:25,985 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:11:25,985 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:11:25,985 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:11:25,985 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 17:11:25,985 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:11:25,986 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:11:25,986 INFO  L85        PathProgramCache]: Analyzing trace with hash 1812911214, now seen corresponding path program 7 times
[2024-06-04 17:11:25,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:11:25,986 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630157661]
[2024-06-04 17:11:25,986 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:11:25,986 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:11:26,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:35,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:11:35,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:35,164 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630157661]
[2024-06-04 17:11:35,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630157661] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:35,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:35,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:11:35,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043783735]
[2024-06-04 17:11:35,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:35,165 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:11:35,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:35,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:11:35,165 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:11:35,389 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:11:35,389 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 305 transitions, 4174 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:11:35,389 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:35,389 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:11:35,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:11:37,866 INFO  L124   PetriNetUnfolderBase]: 4409/6734 cut-off events.
[2024-06-04 17:11:37,867 INFO  L125   PetriNetUnfolderBase]: For 649447/649453 co-relation queries the response was YES.
[2024-06-04 17:11:37,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61212 conditions, 6734 events. 4409/6734 cut-off events. For 649447/649453 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 38288 event pairs, 1140 based on Foata normal form. 12/6745 useless extension candidates. Maximal degree in co-relation 61104. Up to 6582 conditions per place. 
[2024-06-04 17:11:37,943 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 299 selfloop transitions, 32 changer transitions 0/334 dead transitions.
[2024-06-04 17:11:37,943 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 334 transitions, 5050 flow
[2024-06-04 17:11:37,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:11:37,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:11:37,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-04 17:11:37,944 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-04 17:11:37,944 INFO  L175             Difference]: Start difference. First operand has 223 places, 305 transitions, 4174 flow. Second operand 8 states and 142 transitions.
[2024-06-04 17:11:37,945 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 334 transitions, 5050 flow
[2024-06-04 17:11:38,944 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 334 transitions, 4800 flow, removed 74 selfloop flow, removed 6 redundant places.
[2024-06-04 17:11:38,948 INFO  L231             Difference]: Finished difference. Result has 225 places, 308 transitions, 4152 flow
[2024-06-04 17:11:38,949 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3930, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4152, PETRI_PLACES=225, PETRI_TRANSITIONS=308}
[2024-06-04 17:11:38,949 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places.
[2024-06-04 17:11:38,949 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 308 transitions, 4152 flow
[2024-06-04 17:11:38,949 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:11:38,949 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:11:38,949 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:11:38,949 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 17:11:38,949 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:11:38,950 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:11:38,950 INFO  L85        PathProgramCache]: Analyzing trace with hash 1546998732, now seen corresponding path program 11 times
[2024-06-04 17:11:38,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:11:38,950 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164429897]
[2024-06-04 17:11:38,950 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:11:38,950 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:11:39,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:49,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:11:49,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:49,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164429897]
[2024-06-04 17:11:49,680 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164429897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:49,680 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:49,680 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:11:49,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475733536]
[2024-06-04 17:11:49,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:49,681 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:11:49,681 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:49,681 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:11:49,682 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:11:49,846 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:11:49,846 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 308 transitions, 4152 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:11:49,846 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:49,846 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:11:49,846 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:11:52,357 INFO  L124   PetriNetUnfolderBase]: 4445/6798 cut-off events.
[2024-06-04 17:11:52,357 INFO  L125   PetriNetUnfolderBase]: For 696063/696069 co-relation queries the response was YES.
[2024-06-04 17:11:52,404 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59726 conditions, 6798 events. 4445/6798 cut-off events. For 696063/696069 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 38847 event pairs, 1120 based on Foata normal form. 60/6857 useless extension candidates. Maximal degree in co-relation 59617. Up to 6324 conditions per place. 
[2024-06-04 17:11:52,433 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 293 selfloop transitions, 50 changer transitions 0/346 dead transitions.
[2024-06-04 17:11:52,433 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 346 transitions, 5117 flow
[2024-06-04 17:11:52,434 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:11:52,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:11:52,434 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-04 17:11:52,434 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43386243386243384
[2024-06-04 17:11:52,434 INFO  L175             Difference]: Start difference. First operand has 225 places, 308 transitions, 4152 flow. Second operand 9 states and 164 transitions.
[2024-06-04 17:11:52,434 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 346 transitions, 5117 flow
[2024-06-04 17:11:53,536 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 346 transitions, 4919 flow, removed 69 selfloop flow, removed 6 redundant places.
[2024-06-04 17:11:53,541 INFO  L231             Difference]: Finished difference. Result has 228 places, 311 transitions, 4226 flow
[2024-06-04 17:11:53,541 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3954, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4226, PETRI_PLACES=228, PETRI_TRANSITIONS=311}
[2024-06-04 17:11:53,541 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-04 17:11:53,541 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 311 transitions, 4226 flow
[2024-06-04 17:11:53,541 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:11:53,542 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:11:53,542 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:11:53,542 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-04 17:11:53,542 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:11:53,542 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:11:53,542 INFO  L85        PathProgramCache]: Analyzing trace with hash -1764824824, now seen corresponding path program 2 times
[2024-06-04 17:11:53,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:11:53,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464886973]
[2024-06-04 17:11:53,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:11:53,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:11:53,581 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:12:04,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:12:04,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:12:04,308 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464886973]
[2024-06-04 17:12:04,308 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464886973] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:12:04,308 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:12:04,308 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:12:04,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274746146]
[2024-06-04 17:12:04,308 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:12:04,308 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:12:04,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:12:04,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:12:04,308 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:12:04,475 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:12:04,475 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 311 transitions, 4226 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:12:04,475 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:12:04,475 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:12:04,475 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:12:06,682 INFO  L124   PetriNetUnfolderBase]: 4460/6818 cut-off events.
[2024-06-04 17:12:06,682 INFO  L125   PetriNetUnfolderBase]: For 627507/627507 co-relation queries the response was YES.
[2024-06-04 17:12:06,724 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60157 conditions, 6818 events. 4460/6818 cut-off events. For 627507/627507 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 38932 event pairs, 1151 based on Foata normal form. 3/6820 useless extension candidates. Maximal degree in co-relation 60047. Up to 6773 conditions per place. 
[2024-06-04 17:12:06,749 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 307 selfloop transitions, 19 changer transitions 0/329 dead transitions.
[2024-06-04 17:12:06,749 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 329 transitions, 5078 flow
[2024-06-04 17:12:06,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:12:06,750 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:12:06,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-04 17:12:06,750 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.391156462585034
[2024-06-04 17:12:06,750 INFO  L175             Difference]: Start difference. First operand has 228 places, 311 transitions, 4226 flow. Second operand 7 states and 115 transitions.
[2024-06-04 17:12:06,750 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 329 transitions, 5078 flow
[2024-06-04 17:12:07,710 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 329 transitions, 4885 flow, removed 50 selfloop flow, removed 7 redundant places.
[2024-06-04 17:12:07,715 INFO  L231             Difference]: Finished difference. Result has 228 places, 314 transitions, 4121 flow
[2024-06-04 17:12:07,715 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4033, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4121, PETRI_PLACES=228, PETRI_TRANSITIONS=314}
[2024-06-04 17:12:07,715 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-04 17:12:07,715 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 314 transitions, 4121 flow
[2024-06-04 17:12:07,715 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:12:07,715 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:12:07,716 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:12:07,716 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-04 17:12:07,716 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:12:07,716 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:12:07,716 INFO  L85        PathProgramCache]: Analyzing trace with hash 1144860600, now seen corresponding path program 3 times
[2024-06-04 17:12:07,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:12:07,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027048049]
[2024-06-04 17:12:07,717 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:12:07,717 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:12:07,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:12:18,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:12:18,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:12:18,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027048049]
[2024-06-04 17:12:18,447 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027048049] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:12:18,447 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:12:18,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:12:18,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150575151]
[2024-06-04 17:12:18,447 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:12:18,448 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:12:18,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:12:18,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:12:18,448 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:12:18,633 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:12:18,634 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 314 transitions, 4121 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:12:18,634 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:12:18,634 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:12:18,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:12:20,790 INFO  L124   PetriNetUnfolderBase]: 4454/6812 cut-off events.
[2024-06-04 17:12:20,791 INFO  L125   PetriNetUnfolderBase]: For 614638/614644 co-relation queries the response was YES.
[2024-06-04 17:12:20,837 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58429 conditions, 6812 events. 4454/6812 cut-off events. For 614638/614644 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 38951 event pairs, 1153 based on Foata normal form. 6/6817 useless extension candidates. Maximal degree in co-relation 58318. Up to 6716 conditions per place. 
[2024-06-04 17:12:20,865 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 290 selfloop transitions, 34 changer transitions 0/327 dead transitions.
[2024-06-04 17:12:20,865 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 327 transitions, 4923 flow
[2024-06-04 17:12:20,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:12:20,865 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:12:20,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-04 17:12:20,866 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41156462585034015
[2024-06-04 17:12:20,866 INFO  L175             Difference]: Start difference. First operand has 228 places, 314 transitions, 4121 flow. Second operand 7 states and 121 transitions.
[2024-06-04 17:12:20,866 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 327 transitions, 4923 flow
[2024-06-04 17:12:21,800 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 327 transitions, 4837 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-04 17:12:21,804 INFO  L231             Difference]: Finished difference. Result has 230 places, 314 transitions, 4113 flow
[2024-06-04 17:12:21,805 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4035, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4113, PETRI_PLACES=230, PETRI_TRANSITIONS=314}
[2024-06-04 17:12:21,805 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 187 predicate places.
[2024-06-04 17:12:21,805 INFO  L495      AbstractCegarLoop]: Abstraction has has 230 places, 314 transitions, 4113 flow
[2024-06-04 17:12:21,805 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:12:21,805 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:12:21,806 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:12:21,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-04 17:12:21,806 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:12:21,806 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:12:21,806 INFO  L85        PathProgramCache]: Analyzing trace with hash 1145276682, now seen corresponding path program 3 times
[2024-06-04 17:12:21,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:12:21,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026163196]
[2024-06-04 17:12:21,806 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:12:21,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:12:21,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:12:32,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:12:32,827 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:12:32,827 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026163196]
[2024-06-04 17:12:32,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026163196] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:12:32,827 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:12:32,827 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:12:32,828 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934673700]
[2024-06-04 17:12:32,828 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:12:32,828 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:12:32,828 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:12:32,828 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:12:32,829 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:12:32,955 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:12:32,955 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 314 transitions, 4113 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:12:32,955 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:12:32,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:12:32,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:12:35,203 INFO  L124   PetriNetUnfolderBase]: 4445/6799 cut-off events.
[2024-06-04 17:12:35,203 INFO  L125   PetriNetUnfolderBase]: For 624096/624096 co-relation queries the response was YES.
[2024-06-04 17:12:35,245 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58442 conditions, 6799 events. 4445/6799 cut-off events. For 624096/624096 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 38871 event pairs, 1145 based on Foata normal form. 3/6801 useless extension candidates. Maximal degree in co-relation 58331. Up to 6771 conditions per place. 
[2024-06-04 17:12:35,268 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 309 selfloop transitions, 14 changer transitions 0/326 dead transitions.
[2024-06-04 17:12:35,269 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 326 transitions, 4789 flow
[2024-06-04 17:12:35,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:12:35,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:12:35,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions.
[2024-06-04 17:12:35,269 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3741496598639456
[2024-06-04 17:12:35,270 INFO  L175             Difference]: Start difference. First operand has 230 places, 314 transitions, 4113 flow. Second operand 7 states and 110 transitions.
[2024-06-04 17:12:35,270 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 326 transitions, 4789 flow
[2024-06-04 17:12:36,216 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 326 transitions, 4485 flow, removed 33 selfloop flow, removed 9 redundant places.
[2024-06-04 17:12:36,220 INFO  L231             Difference]: Finished difference. Result has 228 places, 314 transitions, 3843 flow
[2024-06-04 17:12:36,220 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3809, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3843, PETRI_PLACES=228, PETRI_TRANSITIONS=314}
[2024-06-04 17:12:36,221 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-04 17:12:36,221 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 314 transitions, 3843 flow
[2024-06-04 17:12:36,221 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:12:36,221 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:12:36,221 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:12:36,221 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-04 17:12:36,222 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:12:36,222 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:12:36,222 INFO  L85        PathProgramCache]: Analyzing trace with hash 1832734954, now seen corresponding path program 1 times
[2024-06-04 17:12:36,222 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:12:36,222 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196126276]
[2024-06-04 17:12:36,222 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:12:36,222 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:12:36,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:12:50,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:12:50,910 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:12:50,910 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196126276]
[2024-06-04 17:12:50,910 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196126276] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:12:50,910 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:12:50,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:12:50,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034903319]
[2024-06-04 17:12:50,911 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:12:50,911 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:12:50,911 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:12:50,911 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:12:50,911 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:12:51,058 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:12:51,059 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 314 transitions, 3843 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:12:51,059 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:12:51,059 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:12:51,059 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:12:53,599 INFO  L124   PetriNetUnfolderBase]: 4490/6862 cut-off events.
[2024-06-04 17:12:53,599 INFO  L125   PetriNetUnfolderBase]: For 649918/649918 co-relation queries the response was YES.
[2024-06-04 17:12:53,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58433 conditions, 6862 events. 4490/6862 cut-off events. For 649918/649918 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39250 event pairs, 1141 based on Foata normal form. 9/6870 useless extension candidates. Maximal degree in co-relation 58323. Up to 6683 conditions per place. 
[2024-06-04 17:12:53,673 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 308 selfloop transitions, 32 changer transitions 0/343 dead transitions.
[2024-06-04 17:12:53,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 343 transitions, 4839 flow
[2024-06-04 17:12:53,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:12:53,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:12:53,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-04 17:12:53,674 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43537414965986393
[2024-06-04 17:12:53,674 INFO  L175             Difference]: Start difference. First operand has 228 places, 314 transitions, 3843 flow. Second operand 7 states and 128 transitions.
[2024-06-04 17:12:53,674 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 343 transitions, 4839 flow
[2024-06-04 17:12:54,623 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 343 transitions, 4793 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-04 17:12:54,627 INFO  L231             Difference]: Finished difference. Result has 229 places, 321 transitions, 3983 flow
[2024-06-04 17:12:54,627 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3799, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3983, PETRI_PLACES=229, PETRI_TRANSITIONS=321}
[2024-06-04 17:12:54,627 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places.
[2024-06-04 17:12:54,627 INFO  L495      AbstractCegarLoop]: Abstraction has has 229 places, 321 transitions, 3983 flow
[2024-06-04 17:12:54,627 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:12:54,627 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:12:54,628 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:12:54,628 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-04 17:12:54,628 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:12:54,628 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:12:54,628 INFO  L85        PathProgramCache]: Analyzing trace with hash -1726209922, now seen corresponding path program 2 times
[2024-06-04 17:12:54,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:12:54,628 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169156787]
[2024-06-04 17:12:54,628 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:12:54,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:12:54,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:13:10,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:13:10,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:13:10,079 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169156787]
[2024-06-04 17:13:10,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169156787] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:13:10,079 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:13:10,079 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:13:10,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468740800]
[2024-06-04 17:13:10,079 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:13:10,079 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:13:10,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:13:10,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:13:10,080 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:13:10,229 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:13:10,229 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 321 transitions, 3983 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:13:10,230 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:13:10,230 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:13:10,230 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:13:12,779 INFO  L124   PetriNetUnfolderBase]: 4505/6884 cut-off events.
[2024-06-04 17:13:12,780 INFO  L125   PetriNetUnfolderBase]: For 641749/641755 co-relation queries the response was YES.
[2024-06-04 17:13:12,821 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59195 conditions, 6884 events. 4505/6884 cut-off events. For 641749/641755 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39328 event pairs, 1157 based on Foata normal form. 5/6888 useless extension candidates. Maximal degree in co-relation 59084. Up to 6691 conditions per place. 
[2024-06-04 17:13:12,847 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 308 selfloop transitions, 38 changer transitions 0/349 dead transitions.
[2024-06-04 17:13:12,848 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 349 transitions, 5091 flow
[2024-06-04 17:13:12,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:13:12,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:13:12,848 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-04 17:13:12,849 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43537414965986393
[2024-06-04 17:13:12,849 INFO  L175             Difference]: Start difference. First operand has 229 places, 321 transitions, 3983 flow. Second operand 7 states and 128 transitions.
[2024-06-04 17:13:12,849 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 349 transitions, 5091 flow
[2024-06-04 17:13:13,425 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 349 transitions, 5000 flow, removed 35 selfloop flow, removed 3 redundant places.
[2024-06-04 17:13:13,429 INFO  L231             Difference]: Finished difference. Result has 233 places, 327 transitions, 4084 flow
[2024-06-04 17:13:13,430 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3896, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4084, PETRI_PLACES=233, PETRI_TRANSITIONS=327}
[2024-06-04 17:13:13,430 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places.
[2024-06-04 17:13:13,430 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 327 transitions, 4084 flow
[2024-06-04 17:13:13,430 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:13:13,430 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:13:13,430 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:13:13,430 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-04 17:13:13,430 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:13:13,431 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:13:13,431 INFO  L85        PathProgramCache]: Analyzing trace with hash 1145282634, now seen corresponding path program 3 times
[2024-06-04 17:13:13,431 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:13:13,431 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669967480]
[2024-06-04 17:13:13,431 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:13:13,431 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:13:13,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:13:28,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:13:28,446 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:13:28,446 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669967480]
[2024-06-04 17:13:28,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669967480] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:13:28,446 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:13:28,446 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:13:28,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93925079]
[2024-06-04 17:13:28,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:13:28,447 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:13:28,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:13:28,447 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:13:28,447 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:13:28,609 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:13:28,610 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 327 transitions, 4084 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:13:28,610 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:13:28,610 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:13:28,610 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:13:31,009 INFO  L124   PetriNetUnfolderBase]: 4496/6872 cut-off events.
[2024-06-04 17:13:31,009 INFO  L125   PetriNetUnfolderBase]: For 653441/653447 co-relation queries the response was YES.
[2024-06-04 17:13:31,056 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59208 conditions, 6872 events. 4496/6872 cut-off events. For 653441/653447 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39315 event pairs, 1157 based on Foata normal form. 5/6876 useless extension candidates. Maximal degree in co-relation 59095. Up to 6687 conditions per place. 
[2024-06-04 17:13:31,084 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 303 selfloop transitions, 40 changer transitions 0/346 dead transitions.
[2024-06-04 17:13:31,084 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 346 transitions, 4948 flow
[2024-06-04 17:13:31,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:13:31,085 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:13:31,085 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-04 17:13:31,085 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 17:13:31,085 INFO  L175             Difference]: Start difference. First operand has 233 places, 327 transitions, 4084 flow. Second operand 7 states and 126 transitions.
[2024-06-04 17:13:31,085 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 346 transitions, 4948 flow
[2024-06-04 17:13:31,774 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 346 transitions, 4845 flow, removed 41 selfloop flow, removed 2 redundant places.
[2024-06-04 17:13:31,778 INFO  L231             Difference]: Finished difference. Result has 238 places, 327 transitions, 4068 flow
[2024-06-04 17:13:31,778 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3981, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4068, PETRI_PLACES=238, PETRI_TRANSITIONS=327}
[2024-06-04 17:13:31,778 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 195 predicate places.
[2024-06-04 17:13:31,778 INFO  L495      AbstractCegarLoop]: Abstraction has has 238 places, 327 transitions, 4068 flow
[2024-06-04 17:13:31,778 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:13:31,778 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:13:31,778 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:13:31,778 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-04 17:13:31,779 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:13:31,779 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:13:31,779 INFO  L85        PathProgramCache]: Analyzing trace with hash -538946707, now seen corresponding path program 1 times
[2024-06-04 17:13:31,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:13:31,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125048728]
[2024-06-04 17:13:31,779 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:13:31,779 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:13:31,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15