./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-03 22:35:30,565 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-03 22:35:30,625 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 22:35:30,628 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 22:35:30,628 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 22:35:30,658 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 22:35:30,659 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 22:35:30,659 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 22:35:30,660 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 22:35:30,663 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-03 22:35:30,663 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 22:35:30,663 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 22:35:30,664 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 22:35:30,665 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-03 22:35:30,665 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-03 22:35:30,665 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 22:35:30,665 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-03 22:35:30,666 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-03 22:35:30,666 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-03 22:35:30,666 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-03 22:35:30,666 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-03 22:35:30,667 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 22:35:30,667 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 22:35:30,667 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 22:35:30,667 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-03 22:35:30,668 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-03 22:35:30,668 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-03 22:35:30,668 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-03 22:35:30,669 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 22:35:30,669 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-03 22:35:30,670 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 22:35:30,670 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-03 22:35:30,670 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 22:35:30,670 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 22:35:30,670 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 22:35:30,670 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 22:35:30,671 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-03 22:35:30,671 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 22:35:30,671 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 22:35:30,672 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 22:35:30,672 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 22:35:30,672 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 22:35:30,672 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 22:35:30,672 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-03 22:35:30,834 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 22:35:30,847 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 22:35:30,849 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 22:35:30,850 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-03 22:35:30,850 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-03 22:35:30,851 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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-03 22:35:31,070 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-03 22:35:31,070 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-03 22:35:31,071 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-03 22:35:32,118 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-03 22:35:32,315 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-03 22:35:32,315 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-03 22:35:32,325 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14fec5662/e2790a714c0541849c2f55a345a82ca8/FLAG4760d1cf1
[2024-06-03 22:35:32,337 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14fec5662/e2790a714c0541849c2f55a345a82ca8
[2024-06-03 22:35:32,338 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 22:35:32,339 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 22:35:32,340 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 22:35:32,340 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 22:35:32,361 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 22:35:32,362 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:35:31" (1/2) ...
[2024-06-03 22:35:32,363 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d6d29a4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:35:32, skipping insertion in model container
[2024-06-03 22:35:32,363 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:35:31" (1/2) ...
[2024-06-03 22:35:32,364 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@560309b4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:35:32, skipping insertion in model container
[2024-06-03 22:35:32,364 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:35:32" (2/2) ...
[2024-06-03 22:35:32,364 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d6d29a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:32, skipping insertion in model container
[2024-06-03 22:35:32,364 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:35:32" (2/2) ...
[2024-06-03 22:35:32,364 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 22:35:32,463 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 22:35:32,464 INFO  L97    edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 2) && z <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-03 22:35:32,467 INFO  L97    edCorrectnessWitness]: Location invariant before [L837-L837] ((((((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 2) && z <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-03 22:35:32,468 INFO  L97    edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 2) && z <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-03 22:35:32,468 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 22:35:32,469 INFO  L106   edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1;
[2024-06-03 22:35:32,506 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-03 22:35:32,800 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 22:35:32,814 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-03 22:35:33,108 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 22:35:33,143 INFO  L206         MainTranslator]: Completed translation
[2024-06-03 22:35:33,143 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33 WrapperNode
[2024-06-03 22:35:33,143 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 22:35:33,145 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 22:35:33,145 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 22:35:33,145 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 22:35:33,150 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (1/1) ...
[2024-06-03 22:35:33,190 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (1/1) ...
[2024-06-03 22:35:33,287 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125
[2024-06-03 22:35:33,288 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 22:35:33,289 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 22:35:33,289 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 22:35:33,289 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 22:35:33,298 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (1/1) ...
[2024-06-03 22:35:33,298 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (1/1) ...
[2024-06-03 22:35:33,327 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (1/1) ...
[2024-06-03 22:35:33,379 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-03 22:35:33,379 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (1/1) ...
[2024-06-03 22:35:33,380 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (1/1) ...
[2024-06-03 22:35:33,414 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (1/1) ...
[2024-06-03 22:35:33,416 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (1/1) ...
[2024-06-03 22:35:33,426 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (1/1) ...
[2024-06-03 22:35:33,438 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (1/1) ...
[2024-06-03 22:35:33,459 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 22:35:33,460 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 22:35:33,460 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 22:35:33,460 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-03 22:35:33,461 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (1/1) ...
[2024-06-03 22:35:33,466 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 22:35:33,472 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 22:35:33,518 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-03 22:35:33,536 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-03 22:35:33,552 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 22:35:33,552 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 22:35:33,552 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 22:35:33,552 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 22:35:33,553 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 22:35:33,553 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 22:35:33,553 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-03 22:35:33,553 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-03 22:35:33,553 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 22:35:33,553 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 22:35:33,554 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 22:35:33,554 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 22:35:33,555 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-03 22:35:33,678 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-03 22:35:33,679 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 22:35:34,864 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 22:35:34,864 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-03 22:35:35,100 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 22:35:35,101 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 22:35:35,102 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:35:35 BoogieIcfgContainer
[2024-06-03 22:35:35,102 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 22:35:35,104 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 22:35:35,104 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 22:35:35,107 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-03 22:35:35,107 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:35:31" (1/4) ...
[2024-06-03 22:35:35,108 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fcc8d9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:35:35, skipping insertion in model container
[2024-06-03 22:35:35,108 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:35:32" (2/4) ...
[2024-06-03 22:35:35,108 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fcc8d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:35:35, skipping insertion in model container
[2024-06-03 22:35:35,108 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:35:33" (3/4) ...
[2024-06-03 22:35:35,109 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fcc8d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:35:35, skipping insertion in model container
[2024-06-03 22:35:35,109 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:35:35" (4/4) ...
[2024-06-03 22:35:35,111 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-03 22:35:35,123 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 22:35:35,124 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-03 22:35:35,124 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 22:35:35,212 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 22:35:35,242 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-03 22:35:35,312 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-03 22:35:35,312 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 22:35:35,315 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 5. Compared 68 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-03 22:35:35,315 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-03 22:35:35,318 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-03 22:35:35,366 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 22:35:35,372 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;@50fb5588, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 22:35:35,373 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-03 22:35:35,396 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 22:35:35,397 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-03 22:35:35,397 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 22:35:35,397 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:35:35,398 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 22:35:35,398 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:35:35,402 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:35:35,402 INFO  L85        PathProgramCache]: Analyzing trace with hash -1642982905, now seen corresponding path program 1 times
[2024-06-03 22:35:35,410 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:35:35,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309884720]
[2024-06-03 22:35:35,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:35:35,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:35:35,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:35:40,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:35:40,873 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:35:40,873 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309884720]
[2024-06-03 22:35:40,874 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309884720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:35:40,874 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:35:40,874 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-03 22:35:40,875 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757433679]
[2024-06-03 22:35:40,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:35:40,881 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 22:35:40,885 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:35:40,900 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 22:35:40,900 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 22:35:40,964 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-03 22:35:40,966 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:35:40,966 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:35:40,966 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-03 22:35:40,967 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:35:41,844 INFO  L124   PetriNetUnfolderBase]: 1152/1762 cut-off events.
[2024-06-03 22:35:41,845 INFO  L125   PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES.
[2024-06-03 22:35:41,849 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3581 conditions, 1762 events. 1152/1762 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8442 event pairs, 785 based on Foata normal form. 1/1726 useless extension candidates. Maximal degree in co-relation 3566. Up to 1732 conditions per place. 
[2024-06-03 22:35:41,857 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-03 22:35:41,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 175 flow
[2024-06-03 22:35:41,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-03 22:35:41,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 22:35:41,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions.
[2024-06-03 22:35:41,866 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6031746031746031
[2024-06-03 22:35:41,868 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 76 transitions.
[2024-06-03 22:35:41,868 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 175 flow
[2024-06-03 22:35:41,870 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-03 22:35:41,872 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-03 22:35:41,873 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-03 22:35:41,876 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-03 22:35:41,876 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-03 22:35:41,876 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:35:41,876 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:35:41,876 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:35:41,877 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 22:35:41,877 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:35:41,877 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:35:41,877 INFO  L85        PathProgramCache]: Analyzing trace with hash 1641423846, now seen corresponding path program 1 times
[2024-06-03 22:35:41,877 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:35:41,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715609135]
[2024-06-03 22:35:41,878 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:35:41,878 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:35:41,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:35:45,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:35:45,323 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:35:45,323 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715609135]
[2024-06-03 22:35:45,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715609135] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:35:45,324 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:35:45,324 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 22:35:45,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425787548]
[2024-06-03 22:35:45,324 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:35:45,326 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 22:35:45,326 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:35:45,326 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 22:35:45,327 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-03 22:35:45,418 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-03 22:35:45,418 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:35:45,419 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:35:45,419 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-03 22:35:45,419 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:35:46,050 INFO  L124   PetriNetUnfolderBase]: 1160/1779 cut-off events.
[2024-06-03 22:35:46,051 INFO  L125   PetriNetUnfolderBase]: For 341/349 co-relation queries the response was YES.
[2024-06-03 22:35:46,054 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4103 conditions, 1779 events. 1160/1779 cut-off events. For 341/349 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8569 event pairs, 662 based on Foata normal form. 8/1785 useless extension candidates. Maximal degree in co-relation 4088. Up to 1699 conditions per place. 
[2024-06-03 22:35:46,060 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 44 selfloop transitions, 11 changer transitions 0/61 dead transitions.
[2024-06-03 22:35:46,060 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 280 flow
[2024-06-03 22:35:46,060 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-03 22:35:46,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 22:35:46,061 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions.
[2024-06-03 22:35:46,062 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6190476190476191
[2024-06-03 22:35:46,062 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 104 transitions.
[2024-06-03 22:35:46,062 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 280 flow
[2024-06-03 22:35:46,063 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-03 22:35:46,064 INFO  L231             Difference]: Finished difference. Result has 47 places, 44 transitions, 174 flow
[2024-06-03 22:35:46,064 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=47, PETRI_TRANSITIONS=44}
[2024-06-03 22:35:46,064 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places.
[2024-06-03 22:35:46,065 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 174 flow
[2024-06-03 22:35:46,065 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:35:46,065 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:35:46,065 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:35:46,065 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 22:35:46,065 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:35:46,066 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:35:46,066 INFO  L85        PathProgramCache]: Analyzing trace with hash 1155350981, now seen corresponding path program 1 times
[2024-06-03 22:35:46,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:35:46,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747152067]
[2024-06-03 22:35:46,066 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:35:46,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:35:46,184 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:35:50,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:35:50,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:35:50,644 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747152067]
[2024-06-03 22:35:50,644 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747152067] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:35:50,644 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:35:50,644 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 22:35:50,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765894920]
[2024-06-03 22:35:50,645 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:35:50,645 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-03 22:35:50,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:35:50,645 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-03 22:35:50,646 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-03 22:35:50,750 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-03 22:35:50,750 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 174 flow. Second operand  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:35:50,750 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:35:50,750 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-03 22:35:50,750 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:35:51,625 INFO  L124   PetriNetUnfolderBase]: 1168/1796 cut-off events.
[2024-06-03 22:35:51,626 INFO  L125   PetriNetUnfolderBase]: For 1205/1223 co-relation queries the response was YES.
[2024-06-03 22:35:51,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4886 conditions, 1796 events. 1168/1796 cut-off events. For 1205/1223 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8808 event pairs, 538 based on Foata normal form. 11/1805 useless extension candidates. Maximal degree in co-relation 4868. Up to 1669 conditions per place. 
[2024-06-03 22:35:51,636 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 53 selfloop transitions, 17 changer transitions 0/76 dead transitions.
[2024-06-03 22:35:51,637 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 410 flow
[2024-06-03 22:35:51,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:35:51,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:35:51,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions.
[2024-06-03 22:35:51,644 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6142857142857143
[2024-06-03 22:35:51,645 INFO  L175             Difference]: Start difference. First operand has 47 places, 44 transitions, 174 flow. Second operand 5 states and 129 transitions.
[2024-06-03 22:35:51,645 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 410 flow
[2024-06-03 22:35:51,672 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 406 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-06-03 22:35:51,674 INFO  L231             Difference]: Finished difference. Result has 52 places, 51 transitions, 253 flow
[2024-06-03 22:35:51,674 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=52, PETRI_TRANSITIONS=51}
[2024-06-03 22:35:51,674 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2024-06-03 22:35:51,675 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 253 flow
[2024-06-03 22:35:51,675 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:35:51,675 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:35:51,675 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:35:51,675 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 22:35:51,675 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:35:51,676 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:35:51,676 INFO  L85        PathProgramCache]: Analyzing trace with hash 929851592, now seen corresponding path program 1 times
[2024-06-03 22:35:51,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:35:51,676 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755136499]
[2024-06-03 22:35:51,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:35:51,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:35:51,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:35:59,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:35:59,264 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:35:59,266 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755136499]
[2024-06-03 22:35:59,267 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755136499] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:35:59,267 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:35:59,267 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 22:35:59,267 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069769236]
[2024-06-03 22:35:59,268 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:35:59,268 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 22:35:59,268 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:35:59,269 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 22:35:59,270 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-03 22:35:59,411 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:35:59,411 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 253 flow. Second operand  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:35:59,411 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:35:59,411 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:35:59,411 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:36:00,185 INFO  L124   PetriNetUnfolderBase]: 1163/1789 cut-off events.
[2024-06-03 22:36:00,186 INFO  L125   PetriNetUnfolderBase]: For 2209/2225 co-relation queries the response was YES.
[2024-06-03 22:36:00,189 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5486 conditions, 1789 events. 1163/1789 cut-off events. For 2209/2225 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8604 event pairs, 526 based on Foata normal form. 8/1795 useless extension candidates. Maximal degree in co-relation 5465. Up to 1738 conditions per place. 
[2024-06-03 22:36:00,196 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 51 selfloop transitions, 8 changer transitions 0/65 dead transitions.
[2024-06-03 22:36:00,196 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 415 flow
[2024-06-03 22:36:00,196 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:36:00,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:36:00,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions.
[2024-06-03 22:36:00,198 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48095238095238096
[2024-06-03 22:36:00,198 INFO  L175             Difference]: Start difference. First operand has 52 places, 51 transitions, 253 flow. Second operand 5 states and 101 transitions.
[2024-06-03 22:36:00,198 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 415 flow
[2024-06-03 22:36:00,204 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 399 flow, removed 5 selfloop flow, removed 1 redundant places.
[2024-06-03 22:36:00,205 INFO  L231             Difference]: Finished difference. Result has 56 places, 54 transitions, 283 flow
[2024-06-03 22:36:00,206 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=56, PETRI_TRANSITIONS=54}
[2024-06-03 22:36:00,207 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places.
[2024-06-03 22:36:00,207 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 283 flow
[2024-06-03 22:36:00,207 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:00,207 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:36:00,208 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:36:00,208 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 22:36:00,208 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-03 22:36:00,208 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:36:00,208 INFO  L85        PathProgramCache]: Analyzing trace with hash -2104202332, now seen corresponding path program 1 times
[2024-06-03 22:36:00,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:36:00,209 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012986342]
[2024-06-03 22:36:00,209 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:36:00,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:36:00,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:36:04,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:36:04,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:36:04,347 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012986342]
[2024-06-03 22:36:04,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012986342] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:36:04,347 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:36:04,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 22:36:04,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751521012]
[2024-06-03 22:36:04,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:36:04,348 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 22:36:04,349 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:36:04,349 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 22:36:04,349 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-03 22:36:04,473 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-03 22:36:04,473 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 283 flow. Second operand  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:04,474 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:36:04,474 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-03 22:36:04,474 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:36:05,303 INFO  L124   PetriNetUnfolderBase]: 1203/1853 cut-off events.
[2024-06-03 22:36:05,303 INFO  L125   PetriNetUnfolderBase]: For 3392/3416 co-relation queries the response was YES.
[2024-06-03 22:36:05,307 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6112 conditions, 1853 events. 1203/1853 cut-off events. For 3392/3416 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8982 event pairs, 389 based on Foata normal form. 25/1876 useless extension candidates. Maximal degree in co-relation 6087. Up to 1638 conditions per place. 
[2024-06-03 22:36:05,314 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 64 selfloop transitions, 19 changer transitions 0/89 dead transitions.
[2024-06-03 22:36:05,314 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 89 transitions, 555 flow
[2024-06-03 22:36:05,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:36:05,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:36:05,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions.
[2024-06-03 22:36:05,316 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5992063492063492
[2024-06-03 22:36:05,316 INFO  L175             Difference]: Start difference. First operand has 56 places, 54 transitions, 283 flow. Second operand 6 states and 151 transitions.
[2024-06-03 22:36:05,316 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 89 transitions, 555 flow
[2024-06-03 22:36:05,318 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 533 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-03 22:36:05,321 INFO  L231             Difference]: Finished difference. Result has 58 places, 55 transitions, 321 flow
[2024-06-03 22:36:05,321 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=58, PETRI_TRANSITIONS=55}
[2024-06-03 22:36:05,323 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places.
[2024-06-03 22:36:05,324 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 321 flow
[2024-06-03 22:36:05,324 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:05,328 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:36:05,329 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:36:05,329 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 22:36:05,329 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:36:05,329 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:36:05,329 INFO  L85        PathProgramCache]: Analyzing trace with hash -1274225805, now seen corresponding path program 1 times
[2024-06-03 22:36:05,329 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:36:05,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608675252]
[2024-06-03 22:36:05,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:36:05,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:36:05,370 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:36:12,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:36:12,882 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:36:12,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608675252]
[2024-06-03 22:36:12,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608675252] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:36:12,882 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:36:12,882 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:36:12,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281781950]
[2024-06-03 22:36:12,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:36:12,882 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:36:12,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:36:12,883 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:36:12,883 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:36:13,011 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:36:13,012 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 321 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:13,012 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:36:13,012 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:36:13,012 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:36:13,909 INFO  L124   PetriNetUnfolderBase]: 1398/2137 cut-off events.
[2024-06-03 22:36:13,909 INFO  L125   PetriNetUnfolderBase]: For 5042/5042 co-relation queries the response was YES.
[2024-06-03 22:36:13,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7397 conditions, 2137 events. 1398/2137 cut-off events. For 5042/5042 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10540 event pairs, 524 based on Foata normal form. 3/2139 useless extension candidates. Maximal degree in co-relation 7372. Up to 2065 conditions per place. 
[2024-06-03 22:36:13,920 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 61 selfloop transitions, 13 changer transitions 0/79 dead transitions.
[2024-06-03 22:36:13,921 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 547 flow
[2024-06-03 22:36:13,921 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:36:13,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:36:13,924 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions.
[2024-06-03 22:36:13,925 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603174603174603
[2024-06-03 22:36:13,925 INFO  L175             Difference]: Start difference. First operand has 58 places, 55 transitions, 321 flow. Second operand 6 states and 116 transitions.
[2024-06-03 22:36:13,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 547 flow
[2024-06-03 22:36:13,928 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 503 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-03 22:36:13,929 INFO  L231             Difference]: Finished difference. Result has 61 places, 63 transitions, 371 flow
[2024-06-03 22:36:13,929 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=61, PETRI_TRANSITIONS=63}
[2024-06-03 22:36:13,934 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places.
[2024-06-03 22:36:13,934 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 371 flow
[2024-06-03 22:36:13,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:13,935 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:36:13,935 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:36:13,935 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 22:36:13,935 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:36:13,936 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:36:13,936 INFO  L85        PathProgramCache]: Analyzing trace with hash -846538953, now seen corresponding path program 1 times
[2024-06-03 22:36:13,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:36:13,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896565156]
[2024-06-03 22:36:13,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:36:13,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:36:13,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:36:20,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:36:20,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:36:20,730 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896565156]
[2024-06-03 22:36:20,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896565156] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:36:20,730 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:36:20,730 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:36:20,731 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545143543]
[2024-06-03 22:36:20,731 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:36:20,731 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:36:20,731 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:36:20,731 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:36:20,732 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:36:20,871 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:36:20,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 371 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:20,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:36:20,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:36:20,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:36:21,802 INFO  L124   PetriNetUnfolderBase]: 1385/2127 cut-off events.
[2024-06-03 22:36:21,802 INFO  L125   PetriNetUnfolderBase]: For 7728/7766 co-relation queries the response was YES.
[2024-06-03 22:36:21,806 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8053 conditions, 2127 events. 1385/2127 cut-off events. For 7728/7766 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10572 event pairs, 528 based on Foata normal form. 13/2101 useless extension candidates. Maximal degree in co-relation 8025. Up to 1997 conditions per place. 
[2024-06-03 22:36:21,814 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 70 selfloop transitions, 17 changer transitions 0/95 dead transitions.
[2024-06-03 22:36:21,815 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 95 transitions, 677 flow
[2024-06-03 22:36:21,815 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:36:21,815 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:36:21,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions.
[2024-06-03 22:36:21,816 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47959183673469385
[2024-06-03 22:36:21,816 INFO  L175             Difference]: Start difference. First operand has 61 places, 63 transitions, 371 flow. Second operand 7 states and 141 transitions.
[2024-06-03 22:36:21,816 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 95 transitions, 677 flow
[2024-06-03 22:36:21,819 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 645 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-03 22:36:21,820 INFO  L231             Difference]: Finished difference. Result has 67 places, 74 transitions, 484 flow
[2024-06-03 22:36:21,821 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=484, PETRI_PLACES=67, PETRI_TRANSITIONS=74}
[2024-06-03 22:36:21,821 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places.
[2024-06-03 22:36:21,821 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 74 transitions, 484 flow
[2024-06-03 22:36:21,821 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:21,821 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:36:21,822 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:36:21,822 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 22:36:21,822 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:36:21,822 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:36:21,822 INFO  L85        PathProgramCache]: Analyzing trace with hash -846301803, now seen corresponding path program 2 times
[2024-06-03 22:36:21,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:36:21,822 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008561919]
[2024-06-03 22:36:21,823 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:36:21,823 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:36:21,855 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:36:29,294 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:36:29,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:36:29,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008561919]
[2024-06-03 22:36:29,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008561919] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:36:29,294 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:36:29,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:36:29,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705146686]
[2024-06-03 22:36:29,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:36:29,295 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:36:29,295 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:36:29,295 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:36:29,295 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:36:29,438 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:36:29,438 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 74 transitions, 484 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:29,438 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:36:29,438 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:36:29,438 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:36:30,420 INFO  L124   PetriNetUnfolderBase]: 1463/2265 cut-off events.
[2024-06-03 22:36:30,420 INFO  L125   PetriNetUnfolderBase]: For 10413/10457 co-relation queries the response was YES.
[2024-06-03 22:36:30,424 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9428 conditions, 2265 events. 1463/2265 cut-off events. For 10413/10457 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11483 event pairs, 521 based on Foata normal form. 19/2243 useless extension candidates. Maximal degree in co-relation 9397. Up to 1985 conditions per place. 
[2024-06-03 22:36:30,432 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 79 selfloop transitions, 25 changer transitions 0/112 dead transitions.
[2024-06-03 22:36:30,432 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 112 transitions, 898 flow
[2024-06-03 22:36:30,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:36:30,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:36:30,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions.
[2024-06-03 22:36:30,433 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5136054421768708
[2024-06-03 22:36:30,433 INFO  L175             Difference]: Start difference. First operand has 67 places, 74 transitions, 484 flow. Second operand 7 states and 151 transitions.
[2024-06-03 22:36:30,433 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 112 transitions, 898 flow
[2024-06-03 22:36:30,438 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 112 transitions, 863 flow, removed 9 selfloop flow, removed 3 redundant places.
[2024-06-03 22:36:30,439 INFO  L231             Difference]: Finished difference. Result has 72 places, 82 transitions, 596 flow
[2024-06-03 22:36:30,439 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=596, PETRI_PLACES=72, PETRI_TRANSITIONS=82}
[2024-06-03 22:36:30,440 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places.
[2024-06-03 22:36:30,440 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 82 transitions, 596 flow
[2024-06-03 22:36:30,440 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:30,440 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:36:30,440 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:36:30,441 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 22:36:30,441 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:36:30,441 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:36:30,441 INFO  L85        PathProgramCache]: Analyzing trace with hash -846292875, now seen corresponding path program 1 times
[2024-06-03 22:36:30,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:36:30,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016207296]
[2024-06-03 22:36:30,441 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:36:30,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:36:30,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:36:38,461 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:36:38,462 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:36:38,462 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016207296]
[2024-06-03 22:36:38,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016207296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:36:38,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:36:38,462 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:36:38,462 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755005969]
[2024-06-03 22:36:38,463 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:36:38,463 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:36:38,463 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:36:38,463 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:36:38,464 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:36:38,552 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:36:38,552 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 82 transitions, 596 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:38,552 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:36:38,552 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:36:38,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:36:39,517 INFO  L124   PetriNetUnfolderBase]: 1520/2340 cut-off events.
[2024-06-03 22:36:39,518 INFO  L125   PetriNetUnfolderBase]: For 11639/11639 co-relation queries the response was YES.
[2024-06-03 22:36:39,522 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10359 conditions, 2340 events. 1520/2340 cut-off events. For 11639/11639 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11709 event pairs, 496 based on Foata normal form. 3/2342 useless extension candidates. Maximal degree in co-relation 10326. Up to 2226 conditions per place. 
[2024-06-03 22:36:39,529 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 84 selfloop transitions, 17 changer transitions 0/106 dead transitions.
[2024-06-03 22:36:39,529 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 106 transitions, 890 flow
[2024-06-03 22:36:39,530 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:36:39,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:36:39,530 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-03 22:36:39,531 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4557823129251701
[2024-06-03 22:36:39,531 INFO  L175             Difference]: Start difference. First operand has 72 places, 82 transitions, 596 flow. Second operand 7 states and 134 transitions.
[2024-06-03 22:36:39,531 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 106 transitions, 890 flow
[2024-06-03 22:36:39,537 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 106 transitions, 854 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-06-03 22:36:39,538 INFO  L231             Difference]: Finished difference. Result has 76 places, 86 transitions, 649 flow
[2024-06-03 22:36:39,538 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=649, PETRI_PLACES=76, PETRI_TRANSITIONS=86}
[2024-06-03 22:36:39,539 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places.
[2024-06-03 22:36:39,539 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 86 transitions, 649 flow
[2024-06-03 22:36:39,539 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:39,539 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:36:39,539 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:36:39,539 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 22:36:39,540 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:36:39,540 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:36:39,540 INFO  L85        PathProgramCache]: Analyzing trace with hash 233987930, now seen corresponding path program 1 times
[2024-06-03 22:36:39,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:36:39,540 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607932802]
[2024-06-03 22:36:39,540 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:36:39,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:36:39,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:36:47,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:36:47,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:36:47,338 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607932802]
[2024-06-03 22:36:47,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607932802] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:36:47,338 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:36:47,338 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:36:47,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178317684]
[2024-06-03 22:36:47,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:36:47,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:36:47,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:36:47,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:36:47,339 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:36:47,516 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:36:47,516 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 86 transitions, 649 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:47,516 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:36:47,516 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:36:47,517 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:36:48,528 INFO  L124   PetriNetUnfolderBase]: 1627/2508 cut-off events.
[2024-06-03 22:36:48,528 INFO  L125   PetriNetUnfolderBase]: For 14167/14167 co-relation queries the response was YES.
[2024-06-03 22:36:48,533 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11604 conditions, 2508 events. 1627/2508 cut-off events. For 14167/14167 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12675 event pairs, 474 based on Foata normal form. 10/2517 useless extension candidates. Maximal degree in co-relation 11569. Up to 2274 conditions per place. 
[2024-06-03 22:36:48,551 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 104 selfloop transitions, 27 changer transitions 0/136 dead transitions.
[2024-06-03 22:36:48,551 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 136 transitions, 1238 flow
[2024-06-03 22:36:48,552 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:36:48,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:36:48,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-03 22:36:48,553 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48214285714285715
[2024-06-03 22:36:48,553 INFO  L175             Difference]: Start difference. First operand has 76 places, 86 transitions, 649 flow. Second operand 8 states and 162 transitions.
[2024-06-03 22:36:48,553 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 136 transitions, 1238 flow
[2024-06-03 22:36:48,560 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 136 transitions, 1179 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-03 22:36:48,562 INFO  L231             Difference]: Finished difference. Result has 82 places, 106 transitions, 898 flow
[2024-06-03 22:36:48,562 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=898, PETRI_PLACES=82, PETRI_TRANSITIONS=106}
[2024-06-03 22:36:48,563 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places.
[2024-06-03 22:36:48,563 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 106 transitions, 898 flow
[2024-06-03 22:36:48,563 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:48,563 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:36:48,563 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:36:48,563 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 22:36:48,564 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:36:48,564 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:36:48,564 INFO  L85        PathProgramCache]: Analyzing trace with hash 239552120, now seen corresponding path program 2 times
[2024-06-03 22:36:48,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:36:48,564 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601917160]
[2024-06-03 22:36:48,564 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:36:48,565 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:36:48,600 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:36:56,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:36:56,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:36:56,227 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601917160]
[2024-06-03 22:36:56,227 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601917160] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:36:56,227 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:36:56,227 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:36:56,227 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122334287]
[2024-06-03 22:36:56,227 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:36:56,227 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:36:56,228 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:36:56,228 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:36:56,228 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:36:56,380 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:36:56,380 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 106 transitions, 898 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:56,381 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:36:56,381 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:36:56,381 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:36:57,432 INFO  L124   PetriNetUnfolderBase]: 1764/2719 cut-off events.
[2024-06-03 22:36:57,433 INFO  L125   PetriNetUnfolderBase]: For 18113/18113 co-relation queries the response was YES.
[2024-06-03 22:36:57,441 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13585 conditions, 2719 events. 1764/2719 cut-off events. For 18113/18113 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13871 event pairs, 475 based on Foata normal form. 5/2723 useless extension candidates. Maximal degree in co-relation 13546. Up to 2373 conditions per place. 
[2024-06-03 22:36:57,463 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 118 selfloop transitions, 42 changer transitions 0/165 dead transitions.
[2024-06-03 22:36:57,463 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 165 transitions, 1669 flow
[2024-06-03 22:36:57,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:36:57,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:36:57,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions.
[2024-06-03 22:36:57,465 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5059523809523809
[2024-06-03 22:36:57,465 INFO  L175             Difference]: Start difference. First operand has 82 places, 106 transitions, 898 flow. Second operand 8 states and 170 transitions.
[2024-06-03 22:36:57,465 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 165 transitions, 1669 flow
[2024-06-03 22:36:57,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 165 transitions, 1585 flow, removed 39 selfloop flow, removed 2 redundant places.
[2024-06-03 22:36:57,481 INFO  L231             Difference]: Finished difference. Result has 90 places, 130 transitions, 1236 flow
[2024-06-03 22:36:57,481 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1236, PETRI_PLACES=90, PETRI_TRANSITIONS=130}
[2024-06-03 22:36:57,481 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places.
[2024-06-03 22:36:57,481 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 130 transitions, 1236 flow
[2024-06-03 22:36:57,482 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:36:57,482 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:36:57,482 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:36:57,482 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 22:36:57,482 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:36:57,482 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:36:57,483 INFO  L85        PathProgramCache]: Analyzing trace with hash -1328915520, now seen corresponding path program 3 times
[2024-06-03 22:36:57,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:36:57,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642195934]
[2024-06-03 22:36:57,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:36:57,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:36:57,514 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:05,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:37:05,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:05,670 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642195934]
[2024-06-03 22:37:05,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642195934] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:05,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:05,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:37:05,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235116083]
[2024-06-03 22:37:05,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:05,670 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:37:05,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:05,671 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:37:05,671 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:37:05,838 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:37:05,838 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 130 transitions, 1236 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:05,838 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:05,839 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:37:05,839 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:06,937 INFO  L124   PetriNetUnfolderBase]: 1859/2858 cut-off events.
[2024-06-03 22:37:06,937 INFO  L125   PetriNetUnfolderBase]: For 23523/23523 co-relation queries the response was YES.
[2024-06-03 22:37:06,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15474 conditions, 2858 events. 1859/2858 cut-off events. For 23523/23523 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14753 event pairs, 485 based on Foata normal form. 10/2867 useless extension candidates. Maximal degree in co-relation 15431. Up to 2322 conditions per place. 
[2024-06-03 22:37:06,955 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 119 selfloop transitions, 61 changer transitions 0/185 dead transitions.
[2024-06-03 22:37:06,955 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 185 transitions, 2043 flow
[2024-06-03 22:37:06,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:37:06,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:37:06,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions.
[2024-06-03 22:37:06,956 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5148809523809523
[2024-06-03 22:37:06,956 INFO  L175             Difference]: Start difference. First operand has 90 places, 130 transitions, 1236 flow. Second operand 8 states and 173 transitions.
[2024-06-03 22:37:06,956 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 185 transitions, 2043 flow
[2024-06-03 22:37:06,981 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 185 transitions, 1904 flow, removed 62 selfloop flow, removed 3 redundant places.
[2024-06-03 22:37:06,984 INFO  L231             Difference]: Finished difference. Result has 96 places, 147 transitions, 1474 flow
[2024-06-03 22:37:06,984 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1474, PETRI_PLACES=96, PETRI_TRANSITIONS=147}
[2024-06-03 22:37:06,984 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places.
[2024-06-03 22:37:06,985 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 147 transitions, 1474 flow
[2024-06-03 22:37:06,985 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:06,985 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:06,985 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:06,985 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 22:37:06,985 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-03 22:37:06,986 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:06,986 INFO  L85        PathProgramCache]: Analyzing trace with hash -1328905600, now seen corresponding path program 1 times
[2024-06-03 22:37:06,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:06,986 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870331387]
[2024-06-03 22:37:06,986 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:06,986 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:07,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:15,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:37:15,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:15,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870331387]
[2024-06-03 22:37:15,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870331387] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:15,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:15,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:37:15,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611511151]
[2024-06-03 22:37:15,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:15,708 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:37:15,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:15,708 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:37:15,709 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:37:15,946 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:37:15,946 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 147 transitions, 1474 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:15,946 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:15,946 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:37:15,946 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:17,124 INFO  L124   PetriNetUnfolderBase]: 1859/2859 cut-off events.
[2024-06-03 22:37:17,124 INFO  L125   PetriNetUnfolderBase]: For 28504/28504 co-relation queries the response was YES.
[2024-06-03 22:37:17,130 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16498 conditions, 2859 events. 1859/2859 cut-off events. For 28504/28504 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14687 event pairs, 500 based on Foata normal form. 6/2864 useless extension candidates. Maximal degree in co-relation 16452. Up to 2680 conditions per place. 
[2024-06-03 22:37:17,150 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 149 selfloop transitions, 20 changer transitions 0/174 dead transitions.
[2024-06-03 22:37:17,150 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 174 transitions, 1928 flow
[2024-06-03 22:37:17,151 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:37:17,151 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:37:17,152 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-03 22:37:17,152 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:37:17,152 INFO  L175             Difference]: Start difference. First operand has 96 places, 147 transitions, 1474 flow. Second operand 8 states and 152 transitions.
[2024-06-03 22:37:17,152 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 174 transitions, 1928 flow
[2024-06-03 22:37:17,178 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 174 transitions, 1839 flow, removed 37 selfloop flow, removed 3 redundant places.
[2024-06-03 22:37:17,180 INFO  L231             Difference]: Finished difference. Result has 101 places, 150 transitions, 1495 flow
[2024-06-03 22:37:17,181 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1495, PETRI_PLACES=101, PETRI_TRANSITIONS=150}
[2024-06-03 22:37:17,181 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places.
[2024-06-03 22:37:17,181 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 150 transitions, 1495 flow
[2024-06-03 22:37:17,181 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:17,182 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:17,182 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:17,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 22:37:17,182 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:37:17,182 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:17,182 INFO  L85        PathProgramCache]: Analyzing trace with hash -1341075890, now seen corresponding path program 1 times
[2024-06-03 22:37:17,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:17,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122869156]
[2024-06-03 22:37:17,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:17,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:17,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:25,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:37:25,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:25,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122869156]
[2024-06-03 22:37:25,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122869156] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:25,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:25,901 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:37:25,901 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257685434]
[2024-06-03 22:37:25,901 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:25,901 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:37:25,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:25,902 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:37:25,902 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:37:26,090 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:37:26,090 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 150 transitions, 1495 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:26,090 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:26,090 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:37:26,090 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:27,225 INFO  L124   PetriNetUnfolderBase]: 1827/2830 cut-off events.
[2024-06-03 22:37:27,225 INFO  L125   PetriNetUnfolderBase]: For 30356/30356 co-relation queries the response was YES.
[2024-06-03 22:37:27,233 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16516 conditions, 2830 events. 1827/2830 cut-off events. For 30356/30356 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14668 event pairs, 480 based on Foata normal form. 5/2826 useless extension candidates. Maximal degree in co-relation 16468. Up to 2554 conditions per place. 
[2024-06-03 22:37:27,244 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 138 selfloop transitions, 28 changer transitions 0/188 dead transitions.
[2024-06-03 22:37:27,244 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 188 transitions, 2025 flow
[2024-06-03 22:37:27,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:37:27,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:37:27,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-03 22:37:27,262 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4880952380952381
[2024-06-03 22:37:27,263 INFO  L175             Difference]: Start difference. First operand has 101 places, 150 transitions, 1495 flow. Second operand 8 states and 164 transitions.
[2024-06-03 22:37:27,263 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 188 transitions, 2025 flow
[2024-06-03 22:37:27,305 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 188 transitions, 1939 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-03 22:37:27,308 INFO  L231             Difference]: Finished difference. Result has 105 places, 160 transitions, 1610 flow
[2024-06-03 22:37:27,308 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1610, PETRI_PLACES=105, PETRI_TRANSITIONS=160}
[2024-06-03 22:37:27,309 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places.
[2024-06-03 22:37:27,309 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 160 transitions, 1610 flow
[2024-06-03 22:37:27,309 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:27,309 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:27,309 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:27,309 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 22:37:27,310 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:37:27,310 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:27,310 INFO  L85        PathProgramCache]: Analyzing trace with hash 636501620, now seen corresponding path program 2 times
[2024-06-03 22:37:27,310 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:27,310 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599774171]
[2024-06-03 22:37:27,310 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:27,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:27,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:36,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:37:36,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:36,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599774171]
[2024-06-03 22:37:36,081 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599774171] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:36,082 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:36,082 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:37:36,082 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172671558]
[2024-06-03 22:37:36,082 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:36,082 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:37:36,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:36,083 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:37:36,083 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:37:36,187 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:37:36,187 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 160 transitions, 1610 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:36,188 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:36,188 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:37:36,188 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:37,230 INFO  L124   PetriNetUnfolderBase]: 1809/2808 cut-off events.
[2024-06-03 22:37:37,231 INFO  L125   PetriNetUnfolderBase]: For 34186/34186 co-relation queries the response was YES.
[2024-06-03 22:37:37,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17112 conditions, 2808 events. 1809/2808 cut-off events. For 34186/34186 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14569 event pairs, 470 based on Foata normal form. 6/2805 useless extension candidates. Maximal degree in co-relation 17061. Up to 2538 conditions per place. 
[2024-06-03 22:37:37,250 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 134 selfloop transitions, 33 changer transitions 0/189 dead transitions.
[2024-06-03 22:37:37,251 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 189 transitions, 2104 flow
[2024-06-03 22:37:37,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:37:37,251 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:37:37,252 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-03 22:37:37,252 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4791666666666667
[2024-06-03 22:37:37,252 INFO  L175             Difference]: Start difference. First operand has 105 places, 160 transitions, 1610 flow. Second operand 8 states and 161 transitions.
[2024-06-03 22:37:37,252 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 189 transitions, 2104 flow
[2024-06-03 22:37:37,285 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 189 transitions, 1999 flow, removed 36 selfloop flow, removed 4 redundant places.
[2024-06-03 22:37:37,287 INFO  L231             Difference]: Finished difference. Result has 109 places, 163 transitions, 1642 flow
[2024-06-03 22:37:37,287 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1642, PETRI_PLACES=109, PETRI_TRANSITIONS=163}
[2024-06-03 22:37:37,288 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places.
[2024-06-03 22:37:37,288 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 163 transitions, 1642 flow
[2024-06-03 22:37:37,288 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:37,288 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:37,288 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:37,288 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 22:37:37,288 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:37:37,289 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:37,289 INFO  L85        PathProgramCache]: Analyzing trace with hash -1336307346, now seen corresponding path program 1 times
[2024-06-03 22:37:37,289 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:37,289 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68185578]
[2024-06-03 22:37:37,289 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:37,289 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:37,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:45,392 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:37:45,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:45,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68185578]
[2024-06-03 22:37:45,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68185578] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:45,393 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:45,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:37:45,394 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444907226]
[2024-06-03 22:37:45,394 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:45,394 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:37:45,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:45,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:37:45,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:37:45,591 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:37:45,592 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 163 transitions, 1642 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:45,592 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:45,592 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:37:45,592 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:46,837 INFO  L124   PetriNetUnfolderBase]: 1927/2979 cut-off events.
[2024-06-03 22:37:46,838 INFO  L125   PetriNetUnfolderBase]: For 39706/39706 co-relation queries the response was YES.
[2024-06-03 22:37:46,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18361 conditions, 2979 events. 1927/2979 cut-off events. For 39706/39706 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15557 event pairs, 463 based on Foata normal form. 12/2990 useless extension candidates. Maximal degree in co-relation 18309. Up to 2635 conditions per place. 
[2024-06-03 22:37:46,858 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 156 selfloop transitions, 49 changer transitions 0/210 dead transitions.
[2024-06-03 22:37:46,858 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 210 transitions, 2430 flow
[2024-06-03 22:37:46,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:37:46,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:37:46,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions.
[2024-06-03 22:37:46,860 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5029761904761905
[2024-06-03 22:37:46,860 INFO  L175             Difference]: Start difference. First operand has 109 places, 163 transitions, 1642 flow. Second operand 8 states and 169 transitions.
[2024-06-03 22:37:46,860 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 210 transitions, 2430 flow
[2024-06-03 22:37:46,898 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 210 transitions, 2295 flow, removed 35 selfloop flow, removed 6 redundant places.
[2024-06-03 22:37:46,903 INFO  L231             Difference]: Finished difference. Result has 113 places, 177 transitions, 1902 flow
[2024-06-03 22:37:46,903 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1902, PETRI_PLACES=113, PETRI_TRANSITIONS=177}
[2024-06-03 22:37:46,904 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places.
[2024-06-03 22:37:46,904 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 177 transitions, 1902 flow
[2024-06-03 22:37:46,905 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:46,906 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:46,906 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:46,906 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 22:37:46,906 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:37:46,906 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:46,906 INFO  L85        PathProgramCache]: Analyzing trace with hash 1753589926, now seen corresponding path program 2 times
[2024-06-03 22:37:46,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:46,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735915609]
[2024-06-03 22:37:46,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:46,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:46,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:57,161 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:37:57,162 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:57,162 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735915609]
[2024-06-03 22:37:57,162 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735915609] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:57,162 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:57,162 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:37:57,163 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475152008]
[2024-06-03 22:37:57,163 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:57,163 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:37:57,163 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:57,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:37:57,165 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:37:57,362 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:37:57,363 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 177 transitions, 1902 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:57,363 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:57,363 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:37:57,363 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:58,675 INFO  L124   PetriNetUnfolderBase]: 2077/3197 cut-off events.
[2024-06-03 22:37:58,676 INFO  L125   PetriNetUnfolderBase]: For 50801/50801 co-relation queries the response was YES.
[2024-06-03 22:37:58,687 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21160 conditions, 3197 events. 2077/3197 cut-off events. For 50801/50801 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16752 event pairs, 456 based on Foata normal form. 10/3206 useless extension candidates. Maximal degree in co-relation 21105. Up to 2430 conditions per place. 
[2024-06-03 22:37:58,700 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 157 selfloop transitions, 81 changer transitions 0/243 dead transitions.
[2024-06-03 22:37:58,700 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 243 transitions, 3074 flow
[2024-06-03 22:37:58,700 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:37:58,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:37:58,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions.
[2024-06-03 22:37:58,701 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5166666666666667
[2024-06-03 22:37:58,701 INFO  L175             Difference]: Start difference. First operand has 113 places, 177 transitions, 1902 flow. Second operand 10 states and 217 transitions.
[2024-06-03 22:37:58,702 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 243 transitions, 3074 flow
[2024-06-03 22:37:58,797 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 243 transitions, 2893 flow, removed 79 selfloop flow, removed 3 redundant places.
[2024-06-03 22:37:58,800 INFO  L231             Difference]: Finished difference. Result has 121 places, 192 transitions, 2189 flow
[2024-06-03 22:37:58,800 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2189, PETRI_PLACES=121, PETRI_TRANSITIONS=192}
[2024-06-03 22:37:58,800 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places.
[2024-06-03 22:37:58,801 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 192 transitions, 2189 flow
[2024-06-03 22:37:58,801 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:58,801 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:58,801 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:58,801 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 22:37:58,801 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:37:58,802 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:58,802 INFO  L85        PathProgramCache]: Analyzing trace with hash -1547169388, now seen corresponding path program 3 times
[2024-06-03 22:37:58,802 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:58,802 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192090965]
[2024-06-03 22:37:58,802 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:58,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:58,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:08,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:38:08,315 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:08,316 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192090965]
[2024-06-03 22:38:08,316 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192090965] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:08,316 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:08,316 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:38:08,316 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181156924]
[2024-06-03 22:38:08,316 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:08,316 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:38:08,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:08,318 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:38:08,318 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:38:08,479 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:38:08,479 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 192 transitions, 2189 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:08,479 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:08,479 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:38:08,480 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:09,698 INFO  L124   PetriNetUnfolderBase]: 2095/3228 cut-off events.
[2024-06-03 22:38:09,698 INFO  L125   PetriNetUnfolderBase]: For 58008/58008 co-relation queries the response was YES.
[2024-06-03 22:38:09,708 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22461 conditions, 3228 events. 2095/3228 cut-off events. For 58008/58008 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16955 event pairs, 461 based on Foata normal form. 15/3242 useless extension candidates. Maximal degree in co-relation 22403. Up to 2621 conditions per place. 
[2024-06-03 22:38:09,720 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 161 selfloop transitions, 72 changer transitions 0/238 dead transitions.
[2024-06-03 22:38:09,720 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 238 transitions, 3026 flow
[2024-06-03 22:38:09,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:38:09,721 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:38:09,721 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions.
[2024-06-03 22:38:09,722 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5132275132275133
[2024-06-03 22:38:09,722 INFO  L175             Difference]: Start difference. First operand has 121 places, 192 transitions, 2189 flow. Second operand 9 states and 194 transitions.
[2024-06-03 22:38:09,722 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 238 transitions, 3026 flow
[2024-06-03 22:38:09,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 238 transitions, 2814 flow, removed 66 selfloop flow, removed 6 redundant places.
[2024-06-03 22:38:09,771 INFO  L231             Difference]: Finished difference. Result has 126 places, 202 transitions, 2361 flow
[2024-06-03 22:38:09,771 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2361, PETRI_PLACES=126, PETRI_TRANSITIONS=202}
[2024-06-03 22:38:09,771 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places.
[2024-06-03 22:38:09,771 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 202 transitions, 2361 flow
[2024-06-03 22:38:09,772 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:09,772 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:09,772 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:09,772 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 22:38:09,772 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:38:09,772 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:09,772 INFO  L85        PathProgramCache]: Analyzing trace with hash 1475436631, now seen corresponding path program 1 times
[2024-06-03 22:38:09,773 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:09,773 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094447070]
[2024-06-03 22:38:09,773 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:09,773 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:09,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:23,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:38:23,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:23,283 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094447070]
[2024-06-03 22:38:23,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094447070] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:23,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:23,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:38:23,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912564563]
[2024-06-03 22:38:23,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:23,283 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:38:23,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:23,284 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:38:23,284 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:38:23,383 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:38:23,383 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 202 transitions, 2361 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:23,383 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:23,383 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:38:23,384 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:24,481 INFO  L124   PetriNetUnfolderBase]: 2025/3116 cut-off events.
[2024-06-03 22:38:24,482 INFO  L125   PetriNetUnfolderBase]: For 60712/60712 co-relation queries the response was YES.
[2024-06-03 22:38:24,492 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22157 conditions, 3116 events. 2025/3116 cut-off events. For 60712/60712 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16232 event pairs, 490 based on Foata normal form. 7/3122 useless extension candidates. Maximal degree in co-relation 22095. Up to 2883 conditions per place. 
[2024-06-03 22:38:24,504 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 185 selfloop transitions, 28 changer transitions 0/218 dead transitions.
[2024-06-03 22:38:24,504 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 218 transitions, 2845 flow
[2024-06-03 22:38:24,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:38:24,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:38:24,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions.
[2024-06-03 22:38:24,506 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-03 22:38:24,506 INFO  L175             Difference]: Start difference. First operand has 126 places, 202 transitions, 2361 flow. Second operand 6 states and 120 transitions.
[2024-06-03 22:38:24,506 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 218 transitions, 2845 flow
[2024-06-03 22:38:24,563 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 218 transitions, 2676 flow, removed 74 selfloop flow, removed 4 redundant places.
[2024-06-03 22:38:24,566 INFO  L231             Difference]: Finished difference. Result has 128 places, 202 transitions, 2265 flow
[2024-06-03 22:38:24,566 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2192, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2265, PETRI_PLACES=128, PETRI_TRANSITIONS=202}
[2024-06-03 22:38:24,567 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places.
[2024-06-03 22:38:24,567 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 202 transitions, 2265 flow
[2024-06-03 22:38:24,567 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:24,567 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:24,567 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:24,567 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 22:38:24,567 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:38:24,568 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:24,568 INFO  L85        PathProgramCache]: Analyzing trace with hash 1376321755, now seen corresponding path program 1 times
[2024-06-03 22:38:24,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:24,568 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200883461]
[2024-06-03 22:38:24,568 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:24,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:24,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:33,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-03 22:38:33,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:33,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200883461]
[2024-06-03 22:38:33,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200883461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:33,877 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:33,877 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:38:33,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103819717]
[2024-06-03 22:38:33,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:33,879 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:38:33,880 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:33,880 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:38:33,880 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:38:34,025 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:38:34,026 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 202 transitions, 2265 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:34,026 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:34,026 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:38:34,026 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:35,311 INFO  L124   PetriNetUnfolderBase]: 2070/3181 cut-off events.
[2024-06-03 22:38:35,311 INFO  L125   PetriNetUnfolderBase]: For 59026/59026 co-relation queries the response was YES.
[2024-06-03 22:38:35,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22273 conditions, 3181 events. 2070/3181 cut-off events. For 59026/59026 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16567 event pairs, 474 based on Foata normal form. 5/3185 useless extension candidates. Maximal degree in co-relation 22210. Up to 2915 conditions per place. 
[2024-06-03 22:38:35,335 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 213 selfloop transitions, 42 changer transitions 0/260 dead transitions.
[2024-06-03 22:38:35,335 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 260 transitions, 3255 flow
[2024-06-03 22:38:35,336 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:38:35,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:38:35,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-03 22:38:35,345 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48677248677248675
[2024-06-03 22:38:35,345 INFO  L175             Difference]: Start difference. First operand has 128 places, 202 transitions, 2265 flow. Second operand 9 states and 184 transitions.
[2024-06-03 22:38:35,345 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 260 transitions, 3255 flow
[2024-06-03 22:38:35,400 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 260 transitions, 3161 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-03 22:38:35,403 INFO  L231             Difference]: Finished difference. Result has 135 places, 225 transitions, 2665 flow
[2024-06-03 22:38:35,403 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2195, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2665, PETRI_PLACES=135, PETRI_TRANSITIONS=225}
[2024-06-03 22:38:35,404 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 92 predicate places.
[2024-06-03 22:38:35,404 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 225 transitions, 2665 flow
[2024-06-03 22:38:35,404 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:35,404 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:35,405 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:35,405 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 22:38:35,405 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:38:35,406 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:35,406 INFO  L85        PathProgramCache]: Analyzing trace with hash -213984033, now seen corresponding path program 1 times
[2024-06-03 22:38:35,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:35,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970880386]
[2024-06-03 22:38:35,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:35,406 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:35,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:45,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:38:45,583 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:45,583 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970880386]
[2024-06-03 22:38:45,583 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970880386] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:45,583 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:45,583 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:38:45,583 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884494436]
[2024-06-03 22:38:45,583 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:45,584 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:38:45,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:45,584 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:38:45,584 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:38:45,718 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:38:45,718 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 225 transitions, 2665 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:45,718 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:45,718 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:38:45,718 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:47,219 INFO  L124   PetriNetUnfolderBase]: 2390/3699 cut-off events.
[2024-06-03 22:38:47,219 INFO  L125   PetriNetUnfolderBase]: For 91457/91457 co-relation queries the response was YES.
[2024-06-03 22:38:47,231 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26063 conditions, 3699 events. 2390/3699 cut-off events. For 91457/91457 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19896 event pairs, 523 based on Foata normal form. 92/3790 useless extension candidates. Maximal degree in co-relation 25997. Up to 2878 conditions per place. 
[2024-06-03 22:38:47,244 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 212 selfloop transitions, 54 changer transitions 1/272 dead transitions.
[2024-06-03 22:38:47,244 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 272 transitions, 3486 flow
[2024-06-03 22:38:47,245 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:38:47,245 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:38:47,245 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions.
[2024-06-03 22:38:47,245 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5079365079365079
[2024-06-03 22:38:47,245 INFO  L175             Difference]: Start difference. First operand has 135 places, 225 transitions, 2665 flow. Second operand 9 states and 192 transitions.
[2024-06-03 22:38:47,246 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 272 transitions, 3486 flow
[2024-06-03 22:38:47,325 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 272 transitions, 3296 flow, removed 80 selfloop flow, removed 4 redundant places.
[2024-06-03 22:38:47,332 INFO  L231             Difference]: Finished difference. Result has 140 places, 227 transitions, 2661 flow
[2024-06-03 22:38:47,332 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2475, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2661, PETRI_PLACES=140, PETRI_TRANSITIONS=227}
[2024-06-03 22:38:47,333 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places.
[2024-06-03 22:38:47,333 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 227 transitions, 2661 flow
[2024-06-03 22:38:47,333 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:47,333 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:47,333 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:47,333 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 22:38:47,333 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:38:47,334 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:47,334 INFO  L85        PathProgramCache]: Analyzing trace with hash -461108815, now seen corresponding path program 2 times
[2024-06-03 22:38:47,334 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:47,334 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192027803]
[2024-06-03 22:38:47,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:47,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:47,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:55,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:38:55,613 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:55,613 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192027803]
[2024-06-03 22:38:55,613 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192027803] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:55,613 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:55,613 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:38:55,613 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889195713]
[2024-06-03 22:38:55,614 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:55,614 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:38:55,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:55,614 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:38:55,615 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:38:55,850 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:38:55,850 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 227 transitions, 2661 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:55,850 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:55,850 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:38:55,850 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:57,298 INFO  L124   PetriNetUnfolderBase]: 2539/3931 cut-off events.
[2024-06-03 22:38:57,299 INFO  L125   PetriNetUnfolderBase]: For 87261/87261 co-relation queries the response was YES.
[2024-06-03 22:38:57,316 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28075 conditions, 3931 events. 2539/3931 cut-off events. For 87261/87261 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 21357 event pairs, 526 based on Foata normal form. 17/3946 useless extension candidates. Maximal degree in co-relation 28007. Up to 3362 conditions per place. 
[2024-06-03 22:38:57,333 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 215 selfloop transitions, 77 changer transitions 0/297 dead transitions.
[2024-06-03 22:38:57,333 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 297 transitions, 3986 flow
[2024-06-03 22:38:57,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:38:57,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:38:57,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions.
[2024-06-03 22:38:57,336 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5052910052910053
[2024-06-03 22:38:57,336 INFO  L175             Difference]: Start difference. First operand has 140 places, 227 transitions, 2661 flow. Second operand 9 states and 191 transitions.
[2024-06-03 22:38:57,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 297 transitions, 3986 flow
[2024-06-03 22:38:57,471 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 297 transitions, 3847 flow, removed 18 selfloop flow, removed 7 redundant places.
[2024-06-03 22:38:57,475 INFO  L231             Difference]: Finished difference. Result has 145 places, 256 transitions, 3224 flow
[2024-06-03 22:38:57,475 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3224, PETRI_PLACES=145, PETRI_TRANSITIONS=256}
[2024-06-03 22:38:57,476 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places.
[2024-06-03 22:38:57,476 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 256 transitions, 3224 flow
[2024-06-03 22:38:57,476 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:57,477 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:57,477 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:57,477 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 22:38:57,477 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:38:57,477 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:57,477 INFO  L85        PathProgramCache]: Analyzing trace with hash -451902745, now seen corresponding path program 3 times
[2024-06-03 22:38:57,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:57,478 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291911887]
[2024-06-03 22:38:57,478 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:57,478 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:57,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39: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-03 22:39:08,499 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:08,499 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291911887]
[2024-06-03 22:39:08,499 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291911887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:08,499 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:08,499 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:39:08,500 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219991651]
[2024-06-03 22:39:08,500 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:08,500 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:39:08,500 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:08,500 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:39:08,501 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:39:08,774 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:39:08,774 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 256 transitions, 3224 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:08,774 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:08,774 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:39:08,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:10,372 INFO  L124   PetriNetUnfolderBase]: 2810/4392 cut-off events.
[2024-06-03 22:39:10,372 INFO  L125   PetriNetUnfolderBase]: For 109099/109099 co-relation queries the response was YES.
[2024-06-03 22:39:10,389 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32766 conditions, 4392 events. 2810/4392 cut-off events. For 109099/109099 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 24574 event pairs, 545 based on Foata normal form. 16/4407 useless extension candidates. Maximal degree in co-relation 32694. Up to 3343 conditions per place. 
[2024-06-03 22:39:10,405 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 255 selfloop transitions, 74 changer transitions 1/335 dead transitions.
[2024-06-03 22:39:10,405 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 335 transitions, 4758 flow
[2024-06-03 22:39:10,406 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:39:10,406 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:39:10,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions.
[2024-06-03 22:39:10,406 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5142857142857142
[2024-06-03 22:39:10,406 INFO  L175             Difference]: Start difference. First operand has 145 places, 256 transitions, 3224 flow. Second operand 10 states and 216 transitions.
[2024-06-03 22:39:10,407 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 335 transitions, 4758 flow
[2024-06-03 22:39:10,530 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 335 transitions, 4578 flow, removed 89 selfloop flow, removed 1 redundant places.
[2024-06-03 22:39:10,537 INFO  L231             Difference]: Finished difference. Result has 156 places, 275 transitions, 3588 flow
[2024-06-03 22:39:10,537 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3070, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3588, PETRI_PLACES=156, PETRI_TRANSITIONS=275}
[2024-06-03 22:39:10,538 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places.
[2024-06-03 22:39:10,538 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 275 transitions, 3588 flow
[2024-06-03 22:39:10,538 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:10,538 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:10,538 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:10,538 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 22:39:10,538 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:39:10,552 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:10,552 INFO  L85        PathProgramCache]: Analyzing trace with hash -1738982975, now seen corresponding path program 4 times
[2024-06-03 22:39:10,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:10,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568569596]
[2024-06-03 22:39:10,552 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:10,552 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:10,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:18,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:39:18,907 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:18,907 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568569596]
[2024-06-03 22:39:18,907 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568569596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:18,907 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:18,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:39:18,908 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946078106]
[2024-06-03 22:39:18,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:18,908 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:39:18,908 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:18,909 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:39:18,909 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:39:19,129 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:39:19,129 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 275 transitions, 3588 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:19,129 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:19,129 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:39:19,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:20,882 INFO  L124   PetriNetUnfolderBase]: 2935/4592 cut-off events.
[2024-06-03 22:39:20,883 INFO  L125   PetriNetUnfolderBase]: For 123501/123501 co-relation queries the response was YES.
[2024-06-03 22:39:20,901 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35363 conditions, 4592 events. 2935/4592 cut-off events. For 123501/123501 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 25941 event pairs, 631 based on Foata normal form. 25/4615 useless extension candidates. Maximal degree in co-relation 35286. Up to 3936 conditions per place. 
[2024-06-03 22:39:20,920 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 243 selfloop transitions, 83 changer transitions 0/331 dead transitions.
[2024-06-03 22:39:20,920 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 331 transitions, 4871 flow
[2024-06-03 22:39:20,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:39:20,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:39:20,923 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions.
[2024-06-03 22:39:20,928 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5079365079365079
[2024-06-03 22:39:20,929 INFO  L175             Difference]: Start difference. First operand has 156 places, 275 transitions, 3588 flow. Second operand 9 states and 192 transitions.
[2024-06-03 22:39:20,929 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 331 transitions, 4871 flow
[2024-06-03 22:39:21,078 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 331 transitions, 4794 flow, removed 31 selfloop flow, removed 3 redundant places.
[2024-06-03 22:39:21,082 INFO  L231             Difference]: Finished difference. Result has 165 places, 290 transitions, 4076 flow
[2024-06-03 22:39:21,083 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3513, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4076, PETRI_PLACES=165, PETRI_TRANSITIONS=290}
[2024-06-03 22:39:21,083 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 122 predicate places.
[2024-06-03 22:39:21,083 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 290 transitions, 4076 flow
[2024-06-03 22:39:21,083 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:21,083 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:21,084 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:21,084 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 22:39:21,084 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-03 22:39:21,084 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:21,084 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473285695, now seen corresponding path program 5 times
[2024-06-03 22:39:21,084 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:21,084 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448515887]
[2024-06-03 22:39:21,085 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:21,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:21,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:30,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-03 22:39:30,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:30,332 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448515887]
[2024-06-03 22:39:30,332 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448515887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:30,332 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:30,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:39:30,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511744861]
[2024-06-03 22:39:30,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:30,332 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:39:30,333 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:30,333 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:39:30,333 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:39:30,562 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:39:30,562 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 290 transitions, 4076 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:30,563 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:30,563 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:39:30,563 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:32,289 INFO  L124   PetriNetUnfolderBase]: 3040/4753 cut-off events.
[2024-06-03 22:39:32,290 INFO  L125   PetriNetUnfolderBase]: For 139484/139484 co-relation queries the response was YES.
[2024-06-03 22:39:32,310 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38107 conditions, 4753 events. 3040/4753 cut-off events. For 139484/139484 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26945 event pairs, 644 based on Foata normal form. 25/4776 useless extension candidates. Maximal degree in co-relation 38025. Up to 3956 conditions per place. 
[2024-06-03 22:39:32,329 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 228 selfloop transitions, 111 changer transitions 0/344 dead transitions.
[2024-06-03 22:39:32,329 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 344 transitions, 5362 flow
[2024-06-03 22:39:32,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:39:32,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:39:32,332 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions.
[2024-06-03 22:39:32,332 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5079365079365079
[2024-06-03 22:39:32,332 INFO  L175             Difference]: Start difference. First operand has 165 places, 290 transitions, 4076 flow. Second operand 9 states and 192 transitions.
[2024-06-03 22:39:32,332 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 344 transitions, 5362 flow
[2024-06-03 22:39:32,500 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 344 transitions, 5246 flow, removed 48 selfloop flow, removed 2 redundant places.
[2024-06-03 22:39:32,504 INFO  L231             Difference]: Finished difference. Result has 174 places, 302 transitions, 4520 flow
[2024-06-03 22:39:32,505 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3960, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4520, PETRI_PLACES=174, PETRI_TRANSITIONS=302}
[2024-06-03 22:39:32,505 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 131 predicate places.
[2024-06-03 22:39:32,505 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 302 transitions, 4520 flow
[2024-06-03 22:39:32,505 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:32,505 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:32,506 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:32,506 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 22:39:32,506 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:39:32,506 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:32,506 INFO  L85        PathProgramCache]: Analyzing trace with hash -1679829139, now seen corresponding path program 1 times
[2024-06-03 22:39:32,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:32,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571125915]
[2024-06-03 22:39:32,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:32,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:32,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:41,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:39:41,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:41,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571125915]
[2024-06-03 22:39:41,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571125915] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:41,963 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:41,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:39:41,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432043778]
[2024-06-03 22:39:41,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:41,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:39:41,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:41,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:39:41,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:39:42,231 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:39:42,231 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 302 transitions, 4520 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:42,231 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:42,231 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:39:42,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:43,817 INFO  L124   PetriNetUnfolderBase]: 3072/4836 cut-off events.
[2024-06-03 22:39:43,817 INFO  L125   PetriNetUnfolderBase]: For 155844/155876 co-relation queries the response was YES.
[2024-06-03 22:39:43,840 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40629 conditions, 4836 events. 3072/4836 cut-off events. For 155844/155876 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 27694 event pairs, 714 based on Foata normal form. 10/4824 useless extension candidates. Maximal degree in co-relation 40543. Up to 4390 conditions per place. 
[2024-06-03 22:39:43,860 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 271 selfloop transitions, 47 changer transitions 0/356 dead transitions.
[2024-06-03 22:39:43,861 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 356 transitions, 5546 flow
[2024-06-03 22:39:43,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:39:43,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:39:43,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-03 22:39:43,863 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48677248677248675
[2024-06-03 22:39:43,863 INFO  L175             Difference]: Start difference. First operand has 174 places, 302 transitions, 4520 flow. Second operand 9 states and 184 transitions.
[2024-06-03 22:39:43,863 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 356 transitions, 5546 flow
[2024-06-03 22:39:44,060 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 356 transitions, 5313 flow, removed 71 selfloop flow, removed 4 redundant places.
[2024-06-03 22:39:44,065 INFO  L231             Difference]: Finished difference. Result has 182 places, 323 transitions, 4738 flow
[2024-06-03 22:39:44,065 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4293, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4738, PETRI_PLACES=182, PETRI_TRANSITIONS=323}
[2024-06-03 22:39:44,066 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-03 22:39:44,066 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 323 transitions, 4738 flow
[2024-06-03 22:39:44,066 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:44,066 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:44,066 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:44,066 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-03 22:39:44,066 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:39:44,067 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:44,067 INFO  L85        PathProgramCache]: Analyzing trace with hash 1508952915, now seen corresponding path program 2 times
[2024-06-03 22:39:44,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:44,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489982052]
[2024-06-03 22:39:44,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:44,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:44,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:52,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:39:52,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:52,338 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489982052]
[2024-06-03 22:39:52,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489982052] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:52,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:52,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:39:52,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695327877]
[2024-06-03 22:39:52,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:52,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:39:52,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:52,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:39:52,339 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:39:52,575 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:39:52,576 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 323 transitions, 4738 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:52,576 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:52,576 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:39:52,576 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:54,296 INFO  L124   PetriNetUnfolderBase]: 3123/4921 cut-off events.
[2024-06-03 22:39:54,297 INFO  L125   PetriNetUnfolderBase]: For 165245/165280 co-relation queries the response was YES.
[2024-06-03 22:39:54,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41488 conditions, 4921 events. 3123/4921 cut-off events. For 165245/165280 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 28210 event pairs, 552 based on Foata normal form. 28/4927 useless extension candidates. Maximal degree in co-relation 41397. Up to 4354 conditions per place. 
[2024-06-03 22:39:54,343 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 271 selfloop transitions, 53 changer transitions 0/362 dead transitions.
[2024-06-03 22:39:54,344 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 362 transitions, 5618 flow
[2024-06-03 22:39:54,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:39:54,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:39:54,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-03 22:39:54,345 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-03 22:39:54,345 INFO  L175             Difference]: Start difference. First operand has 182 places, 323 transitions, 4738 flow. Second operand 9 states and 183 transitions.
[2024-06-03 22:39:54,345 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 362 transitions, 5618 flow
[2024-06-03 22:39:54,661 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 362 transitions, 5516 flow, removed 25 selfloop flow, removed 3 redundant places.
[2024-06-03 22:39:54,665 INFO  L231             Difference]: Finished difference. Result has 189 places, 327 transitions, 4859 flow
[2024-06-03 22:39:54,666 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4636, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4859, PETRI_PLACES=189, PETRI_TRANSITIONS=327}
[2024-06-03 22:39:54,666 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 146 predicate places.
[2024-06-03 22:39:54,666 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 327 transitions, 4859 flow
[2024-06-03 22:39:54,666 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:54,666 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:54,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-03 22:39:54,666 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-03 22:39:54,666 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:39:54,667 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:54,667 INFO  L85        PathProgramCache]: Analyzing trace with hash -283702099, now seen corresponding path program 3 times
[2024-06-03 22:39:54,667 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:54,667 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265120121]
[2024-06-03 22:39:54,667 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:54,667 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:54,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:03,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:40:03,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:03,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265120121]
[2024-06-03 22:40:03,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265120121] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:03,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:03,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:03,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803431987]
[2024-06-03 22:40:03,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:03,867 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:03,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:03,868 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:03,868 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:04,077 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:40:04,077 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 327 transitions, 4859 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:04,077 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:04,077 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:40:04,078 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:05,972 INFO  L124   PetriNetUnfolderBase]: 3177/5007 cut-off events.
[2024-06-03 22:40:05,973 INFO  L125   PetriNetUnfolderBase]: For 177904/177953 co-relation queries the response was YES.
[2024-06-03 22:40:05,995 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42790 conditions, 5007 events. 3177/5007 cut-off events. For 177904/177953 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 28901 event pairs, 692 based on Foata normal form. 24/5009 useless extension candidates. Maximal degree in co-relation 42697. Up to 4462 conditions per place. 
[2024-06-03 22:40:06,015 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 259 selfloop transitions, 68 changer transitions 0/365 dead transitions.
[2024-06-03 22:40:06,015 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 365 transitions, 5759 flow
[2024-06-03 22:40:06,016 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:40:06,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:40:06,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-03 22:40:06,017 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-03 22:40:06,017 INFO  L175             Difference]: Start difference. First operand has 189 places, 327 transitions, 4859 flow. Second operand 9 states and 189 transitions.
[2024-06-03 22:40:06,017 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 365 transitions, 5759 flow
[2024-06-03 22:40:06,235 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 365 transitions, 5582 flow, removed 44 selfloop flow, removed 6 redundant places.
[2024-06-03 22:40:06,240 INFO  L231             Difference]: Finished difference. Result has 193 places, 329 transitions, 4924 flow
[2024-06-03 22:40:06,241 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4686, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4924, PETRI_PLACES=193, PETRI_TRANSITIONS=329}
[2024-06-03 22:40:06,241 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places.
[2024-06-03 22:40:06,241 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 329 transitions, 4924 flow
[2024-06-03 22:40:06,241 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:06,242 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:06,242 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:06,242 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-03 22:40:06,242 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:40:06,242 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:06,242 INFO  L85        PathProgramCache]: Analyzing trace with hash 1511814835, now seen corresponding path program 1 times
[2024-06-03 22:40:06,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:06,243 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714018461]
[2024-06-03 22:40:06,243 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:06,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:06,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:15,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:40:15,842 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:15,842 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714018461]
[2024-06-03 22:40:15,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714018461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:15,842 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:15,842 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:40:15,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447127299]
[2024-06-03 22:40:15,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:15,857 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:40:15,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:15,857 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:40:15,857 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:40:16,017 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:40:16,017 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 329 transitions, 4924 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:16,017 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:16,017 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:40:16,017 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:17,896 INFO  L124   PetriNetUnfolderBase]: 3307/5176 cut-off events.
[2024-06-03 22:40:17,896 INFO  L125   PetriNetUnfolderBase]: For 178671/178671 co-relation queries the response was YES.
[2024-06-03 22:40:17,924 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44337 conditions, 5176 events. 3307/5176 cut-off events. For 178671/178671 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 29671 event pairs, 698 based on Foata normal form. 5/5180 useless extension candidates. Maximal degree in co-relation 44242. Up to 4766 conditions per place. 
[2024-06-03 22:40:17,947 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 312 selfloop transitions, 70 changer transitions 0/387 dead transitions.
[2024-06-03 22:40:17,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 387 transitions, 6253 flow
[2024-06-03 22:40:17,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:40:17,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:40:17,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-03 22:40:17,949 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48095238095238096
[2024-06-03 22:40:17,949 INFO  L175             Difference]: Start difference. First operand has 193 places, 329 transitions, 4924 flow. Second operand 10 states and 202 transitions.
[2024-06-03 22:40:17,949 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 387 transitions, 6253 flow
[2024-06-03 22:40:18,210 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 387 transitions, 6059 flow, removed 25 selfloop flow, removed 7 redundant places.
[2024-06-03 22:40:18,215 INFO  L231             Difference]: Finished difference. Result has 199 places, 349 transitions, 5305 flow
[2024-06-03 22:40:18,216 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4751, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5305, PETRI_PLACES=199, PETRI_TRANSITIONS=349}
[2024-06-03 22:40:18,216 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places.
[2024-06-03 22:40:18,217 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 349 transitions, 5305 flow
[2024-06-03 22:40:18,217 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:18,217 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:18,217 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:18,217 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-03 22:40:18,217 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:40:18,218 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:18,218 INFO  L85        PathProgramCache]: Analyzing trace with hash 1792740179, now seen corresponding path program 4 times
[2024-06-03 22:40:18,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:18,218 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583901982]
[2024-06-03 22:40:18,218 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:18,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:18,283 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:27,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-03 22:40:27,357 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:27,358 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583901982]
[2024-06-03 22:40:27,358 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583901982] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:27,358 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:27,358 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:27,358 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570464165]
[2024-06-03 22:40:27,358 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:27,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:27,359 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:27,360 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:27,360 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:27,558 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:40:27,559 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 349 transitions, 5305 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:27,559 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:27,560 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:40:27,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:29,383 INFO  L124   PetriNetUnfolderBase]: 3291/5187 cut-off events.
[2024-06-03 22:40:29,384 INFO  L125   PetriNetUnfolderBase]: For 201200/201249 co-relation queries the response was YES.
[2024-06-03 22:40:29,411 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45204 conditions, 5187 events. 3291/5187 cut-off events. For 201200/201249 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 30161 event pairs, 682 based on Foata normal form. 23/5188 useless extension candidates. Maximal degree in co-relation 45105. Up to 4699 conditions per place. 
[2024-06-03 22:40:29,434 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 301 selfloop transitions, 46 changer transitions 0/386 dead transitions.
[2024-06-03 22:40:29,434 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 386 transitions, 6257 flow
[2024-06-03 22:40:29,435 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:40:29,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:40:29,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions.
[2024-06-03 22:40:29,435 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48148148148148145
[2024-06-03 22:40:29,435 INFO  L175             Difference]: Start difference. First operand has 199 places, 349 transitions, 5305 flow. Second operand 9 states and 182 transitions.
[2024-06-03 22:40:29,436 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 386 transitions, 6257 flow
[2024-06-03 22:40:29,674 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 386 transitions, 6034 flow, removed 83 selfloop flow, removed 4 redundant places.
[2024-06-03 22:40:29,679 INFO  L231             Difference]: Finished difference. Result has 204 places, 351 transitions, 5262 flow
[2024-06-03 22:40:29,680 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5082, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5262, PETRI_PLACES=204, PETRI_TRANSITIONS=351}
[2024-06-03 22:40:29,680 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places.
[2024-06-03 22:40:29,680 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 351 transitions, 5262 flow
[2024-06-03 22:40:29,680 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:29,680 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:29,681 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:29,681 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-03 22:40:29,681 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:40:29,681 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:29,681 INFO  L85        PathProgramCache]: Analyzing trace with hash 1799411379, now seen corresponding path program 2 times
[2024-06-03 22:40:29,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:29,681 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247424529]
[2024-06-03 22:40:29,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:29,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:29,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:38,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:40:38,760 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:38,760 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247424529]
[2024-06-03 22:40:38,760 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247424529] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:38,760 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:38,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:40:38,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897022104]
[2024-06-03 22:40:38,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:38,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:40:38,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:38,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:40:38,761 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:40:38,974 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:40:38,975 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 351 transitions, 5262 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:38,975 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:38,975 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:40:38,983 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:41,088 INFO  L124   PetriNetUnfolderBase]: 3418/5363 cut-off events.
[2024-06-03 22:40:41,088 INFO  L125   PetriNetUnfolderBase]: For 201240/201240 co-relation queries the response was YES.
[2024-06-03 22:40:41,119 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46866 conditions, 5363 events. 3418/5363 cut-off events. For 201240/201240 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 31074 event pairs, 688 based on Foata normal form. 5/5367 useless extension candidates. Maximal degree in co-relation 46765. Up to 4924 conditions per place. 
[2024-06-03 22:40:41,143 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 347 selfloop transitions, 50 changer transitions 1/403 dead transitions.
[2024-06-03 22:40:41,144 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 403 transitions, 6470 flow
[2024-06-03 22:40:41,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:40:41,144 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:40:41,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 219 transitions.
[2024-06-03 22:40:41,145 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.474025974025974
[2024-06-03 22:40:41,145 INFO  L175             Difference]: Start difference. First operand has 204 places, 351 transitions, 5262 flow. Second operand 11 states and 219 transitions.
[2024-06-03 22:40:41,145 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 403 transitions, 6470 flow
[2024-06-03 22:40:41,460 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 403 transitions, 6342 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-03 22:40:41,465 INFO  L231             Difference]: Finished difference. Result has 210 places, 362 transitions, 5517 flow
[2024-06-03 22:40:41,465 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5134, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5517, PETRI_PLACES=210, PETRI_TRANSITIONS=362}
[2024-06-03 22:40:41,466 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places.
[2024-06-03 22:40:41,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 362 transitions, 5517 flow
[2024-06-03 22:40:41,466 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:41,466 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:41,466 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:41,466 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-03 22:40:41,467 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:40:41,467 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:41,467 INFO  L85        PathProgramCache]: Analyzing trace with hash 1529881597, now seen corresponding path program 5 times
[2024-06-03 22:40:41,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:41,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019269750]
[2024-06-03 22:40:41,467 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:41,467 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:41,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:50,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:40:50,353 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:50,353 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019269750]
[2024-06-03 22:40:50,353 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019269750] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:50,353 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:50,353 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:40:50,353 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988175592]
[2024-06-03 22:40:50,353 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:50,355 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:40:50,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:50,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:40:50,358 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:40:50,540 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:40:50,540 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 362 transitions, 5517 flow. Second operand  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:50,540 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:50,540 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:40:50,540 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:52,270 INFO  L124   PetriNetUnfolderBase]: 3389/5344 cut-off events.
[2024-06-03 22:40:52,271 INFO  L125   PetriNetUnfolderBase]: For 225369/225418 co-relation queries the response was YES.
[2024-06-03 22:40:52,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47337 conditions, 5344 events. 3389/5344 cut-off events. For 225369/225418 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 31304 event pairs, 640 based on Foata normal form. 23/5332 useless extension candidates. Maximal degree in co-relation 47233. Up to 4531 conditions per place. 
[2024-06-03 22:40:52,327 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 279 selfloop transitions, 85 changer transitions 0/405 dead transitions.
[2024-06-03 22:40:52,328 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 405 transitions, 6754 flow
[2024-06-03 22:40:52,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:52,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:52,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions.
[2024-06-03 22:40:52,334 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5059523809523809
[2024-06-03 22:40:52,335 INFO  L175             Difference]: Start difference. First operand has 210 places, 362 transitions, 5517 flow. Second operand 8 states and 170 transitions.
[2024-06-03 22:40:52,335 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 405 transitions, 6754 flow
[2024-06-03 22:40:52,757 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 405 transitions, 6517 flow, removed 81 selfloop flow, removed 6 redundant places.
[2024-06-03 22:40:52,775 INFO  L231             Difference]: Finished difference. Result has 214 places, 371 transitions, 5754 flow
[2024-06-03 22:40:52,776 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5280, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5754, PETRI_PLACES=214, PETRI_TRANSITIONS=371}
[2024-06-03 22:40:52,776 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 171 predicate places.
[2024-06-03 22:40:52,776 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 371 transitions, 5754 flow
[2024-06-03 22:40:52,777 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:52,777 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:52,777 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:52,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-03 22:40:52,777 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-03 22:40:52,778 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:52,778 INFO  L85        PathProgramCache]: Analyzing trace with hash 1926095173, now seen corresponding path program 3 times
[2024-06-03 22:40:52,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:52,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525998822]
[2024-06-03 22:40:52,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:52,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:52,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:03,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:41:03,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:03,538 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525998822]
[2024-06-03 22:41:03,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525998822] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:03,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:03,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:41:03,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393276431]
[2024-06-03 22:41:03,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:03,539 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:41:03,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:03,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:41:03,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:41:03,720 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:41:03,720 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 371 transitions, 5754 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:03,720 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:03,720 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:41:03,721 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:05,691 INFO  L124   PetriNetUnfolderBase]: 3522/5533 cut-off events.
[2024-06-03 22:41:05,692 INFO  L125   PetriNetUnfolderBase]: For 228785/228785 co-relation queries the response was YES.
[2024-06-03 22:41:05,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49800 conditions, 5533 events. 3522/5533 cut-off events. For 228785/228785 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 32378 event pairs, 633 based on Foata normal form. 5/5537 useless extension candidates. Maximal degree in co-relation 49693. Up to 4781 conditions per place. 
[2024-06-03 22:41:05,748 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 331 selfloop transitions, 91 changer transitions 0/427 dead transitions.
[2024-06-03 22:41:05,749 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 427 transitions, 7091 flow
[2024-06-03 22:41:05,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:41:05,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:41:05,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 231 transitions.
[2024-06-03 22:41:05,750 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-03 22:41:05,750 INFO  L175             Difference]: Start difference. First operand has 214 places, 371 transitions, 5754 flow. Second operand 11 states and 231 transitions.
[2024-06-03 22:41:05,750 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 427 transitions, 7091 flow
[2024-06-03 22:41:06,110 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 427 transitions, 6954 flow, removed 44 selfloop flow, removed 3 redundant places.
[2024-06-03 22:41:06,116 INFO  L231             Difference]: Finished difference. Result has 222 places, 381 transitions, 6042 flow
[2024-06-03 22:41:06,117 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5617, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6042, PETRI_PLACES=222, PETRI_TRANSITIONS=381}
[2024-06-03 22:41:06,117 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 179 predicate places.
[2024-06-03 22:41:06,117 INFO  L495      AbstractCegarLoop]: Abstraction has has 222 places, 381 transitions, 6042 flow
[2024-06-03 22:41:06,117 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:06,117 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:06,118 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:41:06,118 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-03 22:41:06,118 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-03 22:41:06,118 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:06,118 INFO  L85        PathProgramCache]: Analyzing trace with hash 1572776261, now seen corresponding path program 4 times
[2024-06-03 22:41:06,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:06,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265629695]
[2024-06-03 22:41:06,119 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:06,119 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:06,184 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:18,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:41:18,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:18,115 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265629695]
[2024-06-03 22:41:18,115 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265629695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:18,115 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:18,115 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:41:18,115 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293566410]
[2024-06-03 22:41:18,115 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:18,115 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:41:18,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:18,116 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:41:18,116 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:41:18,333 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:41:18,333 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 381 transitions, 6042 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:18,333 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:18,333 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:41:18,333 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:20,337 INFO  L124   PetriNetUnfolderBase]: 3552/5585 cut-off events.
[2024-06-03 22:41:20,337 INFO  L125   PetriNetUnfolderBase]: For 240648/240648 co-relation queries the response was YES.
[2024-06-03 22:41:20,370 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51294 conditions, 5585 events. 3552/5585 cut-off events. For 240648/240648 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32844 event pairs, 629 based on Foata normal form. 5/5589 useless extension candidates. Maximal degree in co-relation 51185. Up to 4561 conditions per place. 
[2024-06-03 22:41:20,397 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 310 selfloop transitions, 127 changer transitions 0/442 dead transitions.
[2024-06-03 22:41:20,397 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 442 transitions, 7638 flow
[2024-06-03 22:41:20,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-03 22:41:20,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-03 22:41:20,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 253 transitions.
[2024-06-03 22:41:20,405 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.501984126984127
[2024-06-03 22:41:20,405 INFO  L175             Difference]: Start difference. First operand has 222 places, 381 transitions, 6042 flow. Second operand 12 states and 253 transitions.
[2024-06-03 22:41:20,405 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 442 transitions, 7638 flow
[2024-06-03 22:41:20,841 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 442 transitions, 7290 flow, removed 87 selfloop flow, removed 8 redundant places.
[2024-06-03 22:41:20,847 INFO  L231             Difference]: Finished difference. Result has 226 places, 389 transitions, 6243 flow
[2024-06-03 22:41:20,847 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5694, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6243, PETRI_PLACES=226, PETRI_TRANSITIONS=389}
[2024-06-03 22:41:20,848 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places.
[2024-06-03 22:41:20,848 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 389 transitions, 6243 flow
[2024-06-03 22:41:20,848 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:20,848 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:20,848 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:41:20,849 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-03 22:41:20,849 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:41:20,849 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:20,849 INFO  L85        PathProgramCache]: Analyzing trace with hash -63559810, now seen corresponding path program 1 times
[2024-06-03 22:41:20,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:20,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771285787]
[2024-06-03 22:41:20,849 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:20,850 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:20,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:31,562 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:41:31,562 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:31,562 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771285787]
[2024-06-03 22:41:31,563 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771285787] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:31,563 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:31,563 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:41:31,563 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976408437]
[2024-06-03 22:41:31,563 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:31,564 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:41:31,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:31,564 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:41:31,564 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:41:31,644 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:41:31,645 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 389 transitions, 6243 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:31,645 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:31,645 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:41:31,646 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:33,375 INFO  L124   PetriNetUnfolderBase]: 3557/5588 cut-off events.
[2024-06-03 22:41:33,375 INFO  L125   PetriNetUnfolderBase]: For 252048/252050 co-relation queries the response was YES.
[2024-06-03 22:41:33,518 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52128 conditions, 5588 events. 3557/5588 cut-off events. For 252048/252050 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32881 event pairs, 752 based on Foata normal form. 1/5588 useless extension candidates. Maximal degree in co-relation 52018. Up to 5302 conditions per place. 
[2024-06-03 22:41:33,543 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 386 selfloop transitions, 21 changer transitions 0/412 dead transitions.
[2024-06-03 22:41:33,543 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 412 transitions, 7407 flow
[2024-06-03 22:41:33,545 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:41:33,545 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:41:33,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-03 22:41:33,545 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4421768707482993
[2024-06-03 22:41:33,546 INFO  L175             Difference]: Start difference. First operand has 226 places, 389 transitions, 6243 flow. Second operand 7 states and 130 transitions.
[2024-06-03 22:41:33,546 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 412 transitions, 7407 flow
[2024-06-03 22:41:33,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 412 transitions, 7085 flow, removed 106 selfloop flow, removed 7 redundant places.
[2024-06-03 22:41:33,935 INFO  L231             Difference]: Finished difference. Result has 226 places, 395 transitions, 6199 flow
[2024-06-03 22:41:33,935 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5921, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6199, PETRI_PLACES=226, PETRI_TRANSITIONS=395}
[2024-06-03 22:41:33,935 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places.
[2024-06-03 22:41:33,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 395 transitions, 6199 flow
[2024-06-03 22:41:33,936 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:33,936 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:33,936 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:41:33,936 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-03 22:41:33,936 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:41:33,937 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:33,937 INFO  L85        PathProgramCache]: Analyzing trace with hash 555198008, now seen corresponding path program 1 times
[2024-06-03 22:41:33,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:33,937 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237419071]
[2024-06-03 22:41:33,937 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:33,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:33,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:44,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:41:44,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:44,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237419071]
[2024-06-03 22:41:44,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237419071] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:44,030 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:44,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:41:44,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30308179]
[2024-06-03 22:41:44,030 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:44,030 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:41:44,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:44,031 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:41:44,031 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:41:44,156 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:41:44,156 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 395 transitions, 6199 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:44,157 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:44,157 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:41:44,157 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:46,112 INFO  L124   PetriNetUnfolderBase]: 3587/5642 cut-off events.
[2024-06-03 22:41:46,112 INFO  L125   PetriNetUnfolderBase]: For 263284/263284 co-relation queries the response was YES.
[2024-06-03 22:41:46,140 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52348 conditions, 5642 events. 3587/5642 cut-off events. For 263284/263284 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 33268 event pairs, 652 based on Foata normal form. 14/5655 useless extension candidates. Maximal degree in co-relation 52236. Up to 5068 conditions per place. 
[2024-06-03 22:41:46,165 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 351 selfloop transitions, 77 changer transitions 0/433 dead transitions.
[2024-06-03 22:41:46,165 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 433 transitions, 7539 flow
[2024-06-03 22:41:46,165 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:41:46,166 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:41:46,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-03 22:41:46,166 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48299319727891155
[2024-06-03 22:41:46,166 INFO  L175             Difference]: Start difference. First operand has 226 places, 395 transitions, 6199 flow. Second operand 7 states and 142 transitions.
[2024-06-03 22:41:46,166 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 433 transitions, 7539 flow
[2024-06-03 22:41:46,574 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 433 transitions, 7402 flow, removed 62 selfloop flow, removed 3 redundant places.
[2024-06-03 22:41:46,581 INFO  L231             Difference]: Finished difference. Result has 230 places, 406 transitions, 6480 flow
[2024-06-03 22:41:46,581 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6062, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6480, PETRI_PLACES=230, PETRI_TRANSITIONS=406}
[2024-06-03 22:41:46,581 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 187 predicate places.
[2024-06-03 22:41:46,582 INFO  L495      AbstractCegarLoop]: Abstraction has has 230 places, 406 transitions, 6480 flow
[2024-06-03 22:41:46,596 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:46,596 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:46,596 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:41:46,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-03 22:41:46,597 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:41:46,597 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:46,597 INFO  L85        PathProgramCache]: Analyzing trace with hash 1729281284, now seen corresponding path program 2 times
[2024-06-03 22:41:46,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:46,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135734176]
[2024-06-03 22:41:46,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:46,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:46,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:57,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:41:57,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:57,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135734176]
[2024-06-03 22:41:57,208 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135734176] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:57,208 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:57,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:41:57,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002545510]
[2024-06-03 22:41:57,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:57,209 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:41:57,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:57,210 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:41:57,210 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:41:57,402 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:41:57,402 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 406 transitions, 6480 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:57,402 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:57,402 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:41:57,402 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:59,171 INFO  L124   PetriNetUnfolderBase]: 3584/5636 cut-off events.
[2024-06-03 22:41:59,171 INFO  L125   PetriNetUnfolderBase]: For 261297/261299 co-relation queries the response was YES.
[2024-06-03 22:41:59,201 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52715 conditions, 5636 events. 3584/5636 cut-off events. For 261297/261299 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 33231 event pairs, 754 based on Foata normal form. 1/5636 useless extension candidates. Maximal degree in co-relation 52601. Up to 5356 conditions per place. 
[2024-06-03 22:41:59,226 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 399 selfloop transitions, 15 changer transitions 0/419 dead transitions.
[2024-06-03 22:41:59,227 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 419 transitions, 7346 flow
[2024-06-03 22:41:59,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:41:59,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:41:59,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-03 22:41:59,228 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42517006802721086
[2024-06-03 22:41:59,228 INFO  L175             Difference]: Start difference. First operand has 230 places, 406 transitions, 6480 flow. Second operand 7 states and 125 transitions.
[2024-06-03 22:41:59,228 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 419 transitions, 7346 flow
[2024-06-03 22:41:59,580 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 419 transitions, 7156 flow, removed 57 selfloop flow, removed 4 redundant places.
[2024-06-03 22:41:59,586 INFO  L231             Difference]: Finished difference. Result has 233 places, 406 transitions, 6326 flow
[2024-06-03 22:41:59,587 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6290, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6326, PETRI_PLACES=233, PETRI_TRANSITIONS=406}
[2024-06-03 22:41:59,587 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places.
[2024-06-03 22:41:59,587 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 406 transitions, 6326 flow
[2024-06-03 22:41:59,587 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:59,587 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:59,587 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:41:59,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-03 22:41:59,588 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-03 22:41:59,588 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:59,588 INFO  L85        PathProgramCache]: Analyzing trace with hash 555435158, now seen corresponding path program 2 times
[2024-06-03 22:41:59,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:59,589 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789891849]
[2024-06-03 22:41:59,589 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:59,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:59,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:09,663 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:42:09,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:09,664 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789891849]
[2024-06-03 22:42:09,664 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789891849] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:09,664 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:09,664 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:42:09,664 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465645402]
[2024-06-03 22:42:09,664 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:09,664 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:42:09,665 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:09,665 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:42:09,665 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:42:09,778 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:42:09,779 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 406 transitions, 6326 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:09,779 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:09,779 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:42:09,779 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:11,523 INFO  L124   PetriNetUnfolderBase]: 3496/5489 cut-off events.
[2024-06-03 22:42:11,523 INFO  L125   PetriNetUnfolderBase]: For 262927/262927 co-relation queries the response was YES.
[2024-06-03 22:42:11,554 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50864 conditions, 5489 events. 3496/5489 cut-off events. For 262927/262927 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 32050 event pairs, 705 based on Foata normal form. 10/5498 useless extension candidates. Maximal degree in co-relation 50749. Up to 5163 conditions per place. 
[2024-06-03 22:42:11,579 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 386 selfloop transitions, 35 changer transitions 0/426 dead transitions.
[2024-06-03 22:42:11,580 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 426 transitions, 7271 flow
[2024-06-03 22:42:11,580 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:42:11,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:42:11,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-03 22:42:11,581 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:42:11,581 INFO  L175             Difference]: Start difference. First operand has 233 places, 406 transitions, 6326 flow. Second operand 7 states and 133 transitions.
[2024-06-03 22:42:11,581 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 426 transitions, 7271 flow
[2024-06-03 22:42:11,982 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 426 transitions, 7206 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-03 22:42:11,988 INFO  L231             Difference]: Finished difference. Result has 235 places, 406 transitions, 6346 flow
[2024-06-03 22:42:11,988 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6261, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6346, PETRI_PLACES=235, PETRI_TRANSITIONS=406}
[2024-06-03 22:42:11,988 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 192 predicate places.
[2024-06-03 22:42:11,988 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 406 transitions, 6346 flow
[2024-06-03 22:42:11,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:11,989 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:11,989 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:42:11,989 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-03 22:42:11,989 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-03 22:42:11,989 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:11,989 INFO  L85        PathProgramCache]: Analyzing trace with hash 555444086, now seen corresponding path program 1 times
[2024-06-03 22:42:11,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:11,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396881874]
[2024-06-03 22:42:11,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:11,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:12,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:24,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:42:24,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:24,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396881874]
[2024-06-03 22:42:24,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396881874] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:24,207 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:24,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:42:24,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643836356]
[2024-06-03 22:42:24,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:24,208 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:42:24,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:24,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:42:24,209 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:42:24,352 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:42:24,352 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 406 transitions, 6346 flow. Second operand  has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:24,352 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:24,352 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:42:24,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:26,084 INFO  L124   PetriNetUnfolderBase]: 3535/5549 cut-off events.
[2024-06-03 22:42:26,084 INFO  L125   PetriNetUnfolderBase]: For 274655/274655 co-relation queries the response was YES.
[2024-06-03 22:42:26,115 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51423 conditions, 5549 events. 3535/5549 cut-off events. For 274655/274655 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32499 event pairs, 734 based on Foata normal form. 14/5558 useless extension candidates. Maximal degree in co-relation 51307. Up to 5098 conditions per place. 
[2024-06-03 22:42:26,141 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 363 selfloop transitions, 55 changer transitions 0/423 dead transitions.
[2024-06-03 22:42:26,141 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 423 transitions, 7358 flow
[2024-06-03 22:42:26,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:42:26,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:42:26,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions.
[2024-06-03 22:42:26,150 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4722222222222222
[2024-06-03 22:42:26,150 INFO  L175             Difference]: Start difference. First operand has 235 places, 406 transitions, 6346 flow. Second operand 6 states and 119 transitions.
[2024-06-03 22:42:26,151 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 423 transitions, 7358 flow
[2024-06-03 22:42:26,558 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 423 transitions, 7153 flow, removed 20 selfloop flow, removed 8 redundant places.
[2024-06-03 22:42:26,563 INFO  L231             Difference]: Finished difference. Result has 233 places, 408 transitions, 6307 flow
[2024-06-03 22:42:26,564 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6141, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6307, PETRI_PLACES=233, PETRI_TRANSITIONS=408}
[2024-06-03 22:42:26,566 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places.
[2024-06-03 22:42:26,566 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 408 transitions, 6307 flow
[2024-06-03 22:42:26,566 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:26,566 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:26,567 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:42:26,567 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-03 22:42:26,567 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:42:26,567 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:26,567 INFO  L85        PathProgramCache]: Analyzing trace with hash -1854826276, now seen corresponding path program 1 times
[2024-06-03 22:42:26,567 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:26,567 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296683644]
[2024-06-03 22:42:26,568 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:26,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:26,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:35,922 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:42:35,922 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:35,922 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296683644]
[2024-06-03 22:42:35,923 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296683644] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:35,923 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:35,923 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:42:35,923 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437870302]
[2024-06-03 22:42:35,923 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:35,923 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:42:35,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:35,924 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:42:35,924 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:42:36,178 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:42:36,184 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 408 transitions, 6307 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:36,185 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:36,185 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:42:36,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:38,249 INFO  L124   PetriNetUnfolderBase]: 3620/5683 cut-off events.
[2024-06-03 22:42:38,249 INFO  L125   PetriNetUnfolderBase]: For 281121/281121 co-relation queries the response was YES.
[2024-06-03 22:42:38,278 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52576 conditions, 5683 events. 3620/5683 cut-off events. For 281121/281121 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 33444 event pairs, 548 based on Foata normal form. 14/5696 useless extension candidates. Maximal degree in co-relation 52460. Up to 5062 conditions per place. 
[2024-06-03 22:42:38,303 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 401 selfloop transitions, 57 changer transitions 0/463 dead transitions.
[2024-06-03 22:42:38,303 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 463 transitions, 7737 flow
[2024-06-03 22:42:38,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:42:38,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:42:38,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions.
[2024-06-03 22:42:38,304 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4973544973544973
[2024-06-03 22:42:38,304 INFO  L175             Difference]: Start difference. First operand has 233 places, 408 transitions, 6307 flow. Second operand 9 states and 188 transitions.
[2024-06-03 22:42:38,304 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 463 transitions, 7737 flow
[2024-06-03 22:42:38,712 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 463 transitions, 7599 flow, removed 19 selfloop flow, removed 4 redundant places.
[2024-06-03 22:42:38,718 INFO  L231             Difference]: Finished difference. Result has 240 places, 421 transitions, 6623 flow
[2024-06-03 22:42:38,718 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6169, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6623, PETRI_PLACES=240, PETRI_TRANSITIONS=421}
[2024-06-03 22:42:38,718 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places.
[2024-06-03 22:42:38,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 421 transitions, 6623 flow
[2024-06-03 22:42:38,719 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:38,719 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:38,719 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:42:38,719 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-03 22:42:38,719 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-03 22:42:38,719 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:38,720 INFO  L85        PathProgramCache]: Analyzing trace with hash -204829092, now seen corresponding path program 2 times
[2024-06-03 22:42:38,720 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:38,720 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591830143]
[2024-06-03 22:42:38,720 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:38,720 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:38,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:46,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:42:46,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:46,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591830143]
[2024-06-03 22:42:46,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591830143] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:46,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:46,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:42:46,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040744404]
[2024-06-03 22:42:46,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:46,959 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:42:46,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:46,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:42:46,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:42:47,238 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:42:47,239 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 421 transitions, 6623 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:47,239 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:47,239 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:42:47,239 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:49,488 INFO  L124   PetriNetUnfolderBase]: 3846/6043 cut-off events.
[2024-06-03 22:42:49,488 INFO  L125   PetriNetUnfolderBase]: For 320510/320512 co-relation queries the response was YES.
[2024-06-03 22:42:49,521 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56919 conditions, 6043 events. 3846/6043 cut-off events. For 320510/320512 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 35795 event pairs, 747 based on Foata normal form. 16/6058 useless extension candidates. Maximal degree in co-relation 56800. Up to 5381 conditions per place. 
[2024-06-03 22:42:49,550 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 421 selfloop transitions, 64 changer transitions 0/490 dead transitions.
[2024-06-03 22:42:49,550 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 490 transitions, 8637 flow
[2024-06-03 22:42:49,551 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:42:49,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:42:49,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 218 transitions.
[2024-06-03 22:42:49,552 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47186147186147187
[2024-06-03 22:42:49,552 INFO  L175             Difference]: Start difference. First operand has 240 places, 421 transitions, 6623 flow. Second operand 11 states and 218 transitions.
[2024-06-03 22:42:49,552 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 490 transitions, 8637 flow
[2024-06-03 22:42:50,024 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 490 transitions, 8413 flow, removed 77 selfloop flow, removed 4 redundant places.
[2024-06-03 22:42:50,031 INFO  L231             Difference]: Finished difference. Result has 252 places, 446 transitions, 7225 flow
[2024-06-03 22:42:50,032 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6412, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7225, PETRI_PLACES=252, PETRI_TRANSITIONS=446}
[2024-06-03 22:42:50,032 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 209 predicate places.
[2024-06-03 22:42:50,032 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 446 transitions, 7225 flow
[2024-06-03 22:42:50,032 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:50,033 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:50,033 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:42:50,033 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-03 22:42:50,033 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-03 22:42:50,033 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:50,033 INFO  L85        PathProgramCache]: Analyzing trace with hash -259627914, now seen corresponding path program 3 times
[2024-06-03 22:42:50,033 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:50,033 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237391999]
[2024-06-03 22:42:50,034 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:50,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:50,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:59,057 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:42:59,057 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:59,057 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237391999]
[2024-06-03 22:42:59,057 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237391999] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:59,057 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:59,057 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:42:59,058 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113586295]
[2024-06-03 22:42:59,058 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:59,058 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:42:59,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:59,058 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:42:59,058 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:42:59,216 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:42:59,216 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 446 transitions, 7225 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:59,216 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:59,216 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:42:59,216 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:01,420 INFO  L124   PetriNetUnfolderBase]: 3923/6168 cut-off events.
[2024-06-03 22:43:01,421 INFO  L125   PetriNetUnfolderBase]: For 336172/336172 co-relation queries the response was YES.
[2024-06-03 22:43:01,465 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58615 conditions, 6168 events. 3923/6168 cut-off events. For 336172/336172 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 36715 event pairs, 735 based on Foata normal form. 16/6183 useless extension candidates. Maximal degree in co-relation 58489. Up to 5534 conditions per place. 
[2024-06-03 22:43:01,493 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 443 selfloop transitions, 51 changer transitions 0/499 dead transitions.
[2024-06-03 22:43:01,494 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 499 transitions, 8786 flow
[2024-06-03 22:43:01,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:43:01,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:43:01,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions.
[2024-06-03 22:43:01,495 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4857142857142857
[2024-06-03 22:43:01,495 INFO  L175             Difference]: Start difference. First operand has 252 places, 446 transitions, 7225 flow. Second operand 10 states and 204 transitions.
[2024-06-03 22:43:01,495 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 499 transitions, 8786 flow
[2024-06-03 22:43:02,104 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 499 transitions, 8626 flow, removed 64 selfloop flow, removed 3 redundant places.
[2024-06-03 22:43:02,111 INFO  L231             Difference]: Finished difference. Result has 260 places, 456 transitions, 7478 flow
[2024-06-03 22:43:02,111 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7065, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7478, PETRI_PLACES=260, PETRI_TRANSITIONS=456}
[2024-06-03 22:43:02,112 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 217 predicate places.
[2024-06-03 22:43:02,112 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 456 transitions, 7478 flow
[2024-06-03 22:43:02,117 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:02,117 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:02,117 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:43:02,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-03 22:43:02,118 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:43:02,118 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:02,118 INFO  L85        PathProgramCache]: Analyzing trace with hash -204681222, now seen corresponding path program 4 times
[2024-06-03 22:43:02,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:02,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950625463]
[2024-06-03 22:43:02,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:02,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:02,181 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:11,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:43:11,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:11,412 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950625463]
[2024-06-03 22:43:11,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950625463] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:11,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:11,412 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:43:11,412 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454028949]
[2024-06-03 22:43:11,412 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:11,413 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:43:11,413 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:11,413 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:43:11,413 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:43:11,636 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:43:11,637 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 456 transitions, 7478 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:11,637 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:11,637 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:43:11,637 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:13,937 INFO  L124   PetriNetUnfolderBase]: 3904/6141 cut-off events.
[2024-06-03 22:43:13,938 INFO  L125   PetriNetUnfolderBase]: For 335365/335365 co-relation queries the response was YES.
[2024-06-03 22:43:13,976 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58040 conditions, 6141 events. 3904/6141 cut-off events. For 335365/335365 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 36455 event pairs, 766 based on Foata normal form. 20/6160 useless extension candidates. Maximal degree in co-relation 57910. Up to 5598 conditions per place. 
[2024-06-03 22:43:14,004 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 418 selfloop transitions, 78 changer transitions 0/501 dead transitions.
[2024-06-03 22:43:14,005 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 501 transitions, 8803 flow
[2024-06-03 22:43:14,005 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:43:14,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:43:14,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions.
[2024-06-03 22:43:14,006 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4880952380952381
[2024-06-03 22:43:14,006 INFO  L175             Difference]: Start difference. First operand has 260 places, 456 transitions, 7478 flow. Second operand 10 states and 205 transitions.
[2024-06-03 22:43:14,006 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 501 transitions, 8803 flow
[2024-06-03 22:43:14,682 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 501 transitions, 8538 flow, removed 119 selfloop flow, removed 4 redundant places.
[2024-06-03 22:43:14,689 INFO  L231             Difference]: Finished difference. Result has 266 places, 459 transitions, 7488 flow
[2024-06-03 22:43:14,689 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7225, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7488, PETRI_PLACES=266, PETRI_TRANSITIONS=459}
[2024-06-03 22:43:14,689 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 223 predicate places.
[2024-06-03 22:43:14,690 INFO  L495      AbstractCegarLoop]: Abstraction has has 266 places, 459 transitions, 7488 flow
[2024-06-03 22:43:14,690 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:14,690 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:14,690 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:43:14,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-03 22:43:14,690 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:43:14,691 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:14,691 INFO  L85        PathProgramCache]: Analyzing trace with hash -1093748320, now seen corresponding path program 1 times
[2024-06-03 22:43:14,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:14,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111339769]
[2024-06-03 22:43:14,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:14,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:14,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:24,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:43:24,190 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:24,190 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111339769]
[2024-06-03 22:43:24,190 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111339769] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:24,190 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:24,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:43:24,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297840387]
[2024-06-03 22:43:24,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:24,191 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:43:24,191 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:24,191 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:43:24,191 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:43:24,382 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:43:24,382 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 459 transitions, 7488 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:24,382 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:24,383 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:43:24,383 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:27,209 INFO  L124   PetriNetUnfolderBase]: 4495/7138 cut-off events.
[2024-06-03 22:43:27,209 INFO  L125   PetriNetUnfolderBase]: For 464948/464948 co-relation queries the response was YES.
[2024-06-03 22:43:27,258 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 68051 conditions, 7138 events. 4495/7138 cut-off events. For 464948/464948 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 43919 event pairs, 926 based on Foata normal form. 48/7185 useless extension candidates. Maximal degree in co-relation 67919. Up to 5545 conditions per place. 
[2024-06-03 22:43:27,290 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 448 selfloop transitions, 61 changer transitions 5/519 dead transitions.
[2024-06-03 22:43:27,291 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 519 transitions, 9330 flow
[2024-06-03 22:43:27,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:43:27,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:43:27,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 229 transitions.
[2024-06-03 22:43:27,292 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49567099567099565
[2024-06-03 22:43:27,292 INFO  L175             Difference]: Start difference. First operand has 266 places, 459 transitions, 7488 flow. Second operand 11 states and 229 transitions.
[2024-06-03 22:43:27,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 519 transitions, 9330 flow
[2024-06-03 22:43:28,170 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 519 transitions, 9138 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-03 22:43:28,177 INFO  L231             Difference]: Finished difference. Result has 270 places, 464 transitions, 7698 flow
[2024-06-03 22:43:28,178 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7296, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7698, PETRI_PLACES=270, PETRI_TRANSITIONS=464}
[2024-06-03 22:43:28,178 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 227 predicate places.
[2024-06-03 22:43:28,178 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 464 transitions, 7698 flow
[2024-06-03 22:43:28,178 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:28,178 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:28,178 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:43:28,179 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-03 22:43:28,179 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:43:28,179 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:28,179 INFO  L85        PathProgramCache]: Analyzing trace with hash 120883002, now seen corresponding path program 2 times
[2024-06-03 22:43:28,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:28,179 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409192485]
[2024-06-03 22:43:28,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:28,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:28,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:38,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:43:38,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:38,699 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409192485]
[2024-06-03 22:43:38,699 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409192485] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:38,699 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:38,700 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:43:38,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640718071]
[2024-06-03 22:43:38,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:38,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:43:38,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:38,720 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:43:38,720 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:43:38,934 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:43:38,935 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 464 transitions, 7698 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:38,935 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:38,935 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:43:38,935 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:41,313 INFO  L124   PetriNetUnfolderBase]: 4437/7032 cut-off events.
[2024-06-03 22:43:41,314 INFO  L125   PetriNetUnfolderBase]: For 417890/417892 co-relation queries the response was YES.
[2024-06-03 22:43:41,358 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67110 conditions, 7032 events. 4437/7032 cut-off events. For 417890/417892 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 43179 event pairs, 1092 based on Foata normal form. 16/7047 useless extension candidates. Maximal degree in co-relation 66976. Up to 6453 conditions per place. 
[2024-06-03 22:43:41,388 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 462 selfloop transitions, 61 changer transitions 0/528 dead transitions.
[2024-06-03 22:43:41,388 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 528 transitions, 9484 flow
[2024-06-03 22:43:41,390 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:43:41,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:43:41,391 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-03 22:43:41,391 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:43:41,391 INFO  L175             Difference]: Start difference. First operand has 270 places, 464 transitions, 7698 flow. Second operand 10 states and 190 transitions.
[2024-06-03 22:43:41,391 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 528 transitions, 9484 flow
[2024-06-03 22:43:42,199 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 528 transitions, 9291 flow, removed 51 selfloop flow, removed 7 redundant places.
[2024-06-03 22:43:42,206 INFO  L231             Difference]: Finished difference. Result has 279 places, 489 transitions, 8277 flow
[2024-06-03 22:43:42,207 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7529, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8277, PETRI_PLACES=279, PETRI_TRANSITIONS=489}
[2024-06-03 22:43:42,208 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 236 predicate places.
[2024-06-03 22:43:42,208 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 489 transitions, 8277 flow
[2024-06-03 22:43:42,209 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:42,209 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:42,209 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:43:42,209 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-03 22:43:42,209 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:43:42,209 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:42,209 INFO  L85        PathProgramCache]: Analyzing trace with hash -378378924, now seen corresponding path program 3 times
[2024-06-03 22:43:42,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:42,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588451099]
[2024-06-03 22:43:42,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:42,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:42,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:52,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:43:52,123 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:52,123 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588451099]
[2024-06-03 22:43:52,123 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588451099] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:52,123 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:52,123 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:43:52,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533429298]
[2024-06-03 22:43:52,123 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:52,124 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:43:52,124 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:52,124 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:43:52,124 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:43:52,414 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:43:52,414 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 489 transitions, 8277 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:52,415 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:52,415 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:43:52,415 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:55,227 INFO  L124   PetriNetUnfolderBase]: 4632/7357 cut-off events.
[2024-06-03 22:43:55,227 INFO  L125   PetriNetUnfolderBase]: For 487933/487933 co-relation queries the response was YES.
[2024-06-03 22:43:55,282 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 70052 conditions, 7357 events. 4632/7357 cut-off events. For 487933/487933 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 45536 event pairs, 1134 based on Foata normal form. 58/7414 useless extension candidates. Maximal degree in co-relation 69910. Up to 6580 conditions per place. 
[2024-06-03 22:43:55,317 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 457 selfloop transitions, 76 changer transitions 5/543 dead transitions.
[2024-06-03 22:43:55,317 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 543 transitions, 9767 flow
[2024-06-03 22:43:55,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-03 22:43:55,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-03 22:43:55,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 237 transitions.
[2024-06-03 22:43:55,318 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47023809523809523
[2024-06-03 22:43:55,318 INFO  L175             Difference]: Start difference. First operand has 279 places, 489 transitions, 8277 flow. Second operand 12 states and 237 transitions.
[2024-06-03 22:43:55,318 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 543 transitions, 9767 flow
[2024-06-03 22:43:56,181 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 543 transitions, 9708 flow, removed 9 selfloop flow, removed 2 redundant places.
[2024-06-03 22:43:56,188 INFO  L231             Difference]: Finished difference. Result has 291 places, 494 transitions, 8553 flow
[2024-06-03 22:43:56,189 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8218, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8553, PETRI_PLACES=291, PETRI_TRANSITIONS=494}
[2024-06-03 22:43:56,189 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 248 predicate places.
[2024-06-03 22:43:56,189 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 494 transitions, 8553 flow
[2024-06-03 22:43:56,189 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:56,189 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:56,189 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:43:56,190 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-03 22:43:56,190 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:43:56,190 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:56,190 INFO  L85        PathProgramCache]: Analyzing trace with hash 1859586226, now seen corresponding path program 5 times
[2024-06-03 22:43:56,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:56,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086967786]
[2024-06-03 22:43:56,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:56,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:56,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:04,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:44:04,838 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:04,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086967786]
[2024-06-03 22:44:04,839 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086967786] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:04,839 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:04,839 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:44:04,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495207953]
[2024-06-03 22:44:04,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:04,839 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:44:04,839 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:04,840 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:44:04,840 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:44:04,965 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:44:04,966 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 494 transitions, 8553 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:44:04,966 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:04,966 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:44:04,966 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:07,877 INFO  L124   PetriNetUnfolderBase]: 4717/7478 cut-off events.
[2024-06-03 22:44:07,877 INFO  L125   PetriNetUnfolderBase]: For 467563/467563 co-relation queries the response was YES.
[2024-06-03 22:44:07,930 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72048 conditions, 7478 events. 4717/7478 cut-off events. For 467563/467563 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 46338 event pairs, 1143 based on Foata normal form. 16/7492 useless extension candidates. Maximal degree in co-relation 71902. Up to 6603 conditions per place. 
[2024-06-03 22:44:07,966 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 427 selfloop transitions, 113 changer transitions 0/545 dead transitions.
[2024-06-03 22:44:07,966 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 545 transitions, 10337 flow
[2024-06-03 22:44:07,966 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:44:07,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:44:07,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions.
[2024-06-03 22:44:07,968 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5052910052910053
[2024-06-03 22:44:07,969 INFO  L175             Difference]: Start difference. First operand has 291 places, 494 transitions, 8553 flow. Second operand 9 states and 191 transitions.
[2024-06-03 22:44:07,969 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 545 transitions, 10337 flow
[2024-06-03 22:44:08,909 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 545 transitions, 10146 flow, removed 41 selfloop flow, removed 7 redundant places.
[2024-06-03 22:44:08,917 INFO  L231             Difference]: Finished difference. Result has 294 places, 504 transitions, 9011 flow
[2024-06-03 22:44:08,917 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8362, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9011, PETRI_PLACES=294, PETRI_TRANSITIONS=504}
[2024-06-03 22:44:08,918 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 251 predicate places.
[2024-06-03 22:44:08,918 INFO  L495      AbstractCegarLoop]: Abstraction has has 294 places, 504 transitions, 9011 flow
[2024-06-03 22:44:08,918 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:44:08,918 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:08,918 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:44:08,918 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-03 22:44:08,918 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:44:08,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:08,919 INFO  L85        PathProgramCache]: Analyzing trace with hash 1660284436, now seen corresponding path program 6 times
[2024-06-03 22:44:08,919 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:08,919 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807355419]
[2024-06-03 22:44:08,919 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:08,919 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:08,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:19,445 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:44:19,445 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:19,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807355419]
[2024-06-03 22:44:19,445 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807355419] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:19,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:19,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:44:19,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098219826]
[2024-06-03 22:44:19,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:19,446 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:44:19,446 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:19,446 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:44:19,446 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:44:19,589 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:44:19,589 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 504 transitions, 9011 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:44:19,589 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:19,589 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:44:19,590 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:22,504 INFO  L124   PetriNetUnfolderBase]: 4778/7582 cut-off events.
[2024-06-03 22:44:22,505 INFO  L125   PetriNetUnfolderBase]: For 485105/485105 co-relation queries the response was YES.
[2024-06-03 22:44:22,564 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 74010 conditions, 7582 events. 4778/7582 cut-off events. For 485105/485105 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 47176 event pairs, 1149 based on Foata normal form. 16/7597 useless extension candidates. Maximal degree in co-relation 73863. Up to 6797 conditions per place. 
[2024-06-03 22:44:22,599 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 448 selfloop transitions, 98 changer transitions 0/551 dead transitions.
[2024-06-03 22:44:22,599 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 551 transitions, 10611 flow
[2024-06-03 22:44:22,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:44:22,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:44:22,600 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions.
[2024-06-03 22:44:22,600 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5023809523809524
[2024-06-03 22:44:22,601 INFO  L175             Difference]: Start difference. First operand has 294 places, 504 transitions, 9011 flow. Second operand 10 states and 211 transitions.
[2024-06-03 22:44:22,601 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 551 transitions, 10611 flow
[2024-06-03 22:44:23,548 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 551 transitions, 10418 flow, removed 64 selfloop flow, removed 5 redundant places.
[2024-06-03 22:44:23,556 INFO  L231             Difference]: Finished difference. Result has 299 places, 507 transitions, 9187 flow
[2024-06-03 22:44:23,556 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8818, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9187, PETRI_PLACES=299, PETRI_TRANSITIONS=507}
[2024-06-03 22:44:23,556 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 256 predicate places.
[2024-06-03 22:44:23,557 INFO  L495      AbstractCegarLoop]: Abstraction has has 299 places, 507 transitions, 9187 flow
[2024-06-03 22:44:23,557 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:44:23,557 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:23,557 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:44:23,557 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-03 22:44:23,557 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-03 22:44:23,558 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:23,558 INFO  L85        PathProgramCache]: Analyzing trace with hash 1660136566, now seen corresponding path program 7 times
[2024-06-03 22:44:23,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:23,558 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352351714]
[2024-06-03 22:44:23,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:23,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:23,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:32,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:44:32,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:32,930 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352351714]
[2024-06-03 22:44:32,930 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352351714] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:32,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:32,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:44:32,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979300621]
[2024-06-03 22:44:32,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:32,931 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:44:32,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:32,932 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:44:32,932 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:44:33,260 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:44:33,261 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 507 transitions, 9187 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:44:33,261 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:33,261 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:44:33,261 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:36,309 INFO  L124   PetriNetUnfolderBase]: 4980/7896 cut-off events.
[2024-06-03 22:44:36,309 INFO  L125   PetriNetUnfolderBase]: For 534386/534386 co-relation queries the response was YES.
[2024-06-03 22:44:36,526 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78459 conditions, 7896 events. 4980/7896 cut-off events. For 534386/534386 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 49600 event pairs, 1157 based on Foata normal form. 16/7911 useless extension candidates. Maximal degree in co-relation 78310. Up to 6787 conditions per place. 
[2024-06-03 22:44:36,563 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 452 selfloop transitions, 108 changer transitions 0/565 dead transitions.
[2024-06-03 22:44:36,563 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 565 transitions, 11295 flow
[2024-06-03 22:44:36,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:44:36,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:44:36,564 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 206 transitions.
[2024-06-03 22:44:36,564 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49047619047619045
[2024-06-03 22:44:36,565 INFO  L175             Difference]: Start difference. First operand has 299 places, 507 transitions, 9187 flow. Second operand 10 states and 206 transitions.
[2024-06-03 22:44:36,565 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 565 transitions, 11295 flow
[2024-06-03 22:44:37,589 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 565 transitions, 10992 flow, removed 62 selfloop flow, removed 7 redundant places.
[2024-06-03 22:44:37,598 INFO  L231             Difference]: Finished difference. Result has 303 places, 515 transitions, 9505 flow
[2024-06-03 22:44:37,598 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8884, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9505, PETRI_PLACES=303, PETRI_TRANSITIONS=515}
[2024-06-03 22:44:37,598 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 260 predicate places.
[2024-06-03 22:44:37,599 INFO  L495      AbstractCegarLoop]: Abstraction has has 303 places, 515 transitions, 9505 flow
[2024-06-03 22:44:37,599 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:44:37,599 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:37,599 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:44:37,599 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-03 22:44:37,599 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-03 22:44:37,600 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:37,600 INFO  L85        PathProgramCache]: Analyzing trace with hash -751526832, now seen corresponding path program 8 times
[2024-06-03 22:44:37,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:37,600 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379698768]
[2024-06-03 22:44:37,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:37,600 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:37,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:46,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:44:46,787 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:46,787 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379698768]
[2024-06-03 22:44:46,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379698768] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:46,788 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:46,788 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:44:46,788 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332993670]
[2024-06-03 22:44:46,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:46,788 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:44:46,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:46,789 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:44:46,789 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:44:46,971 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:44:46,971 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 515 transitions, 9505 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:44:46,971 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:46,972 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:44:46,972 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:49,896 INFO  L124   PetriNetUnfolderBase]: 4957/7854 cut-off events.
[2024-06-03 22:44:49,896 INFO  L125   PetriNetUnfolderBase]: For 527362/527362 co-relation queries the response was YES.
[2024-06-03 22:44:49,953 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77691 conditions, 7854 events. 4957/7854 cut-off events. For 527362/527362 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 49174 event pairs, 1189 based on Foata normal form. 16/7868 useless extension candidates. Maximal degree in co-relation 77540. Up to 6963 conditions per place. 
[2024-06-03 22:44:49,989 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 432 selfloop transitions, 120 changer transitions 0/557 dead transitions.
[2024-06-03 22:44:49,989 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 557 transitions, 11051 flow
[2024-06-03 22:44:49,990 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:44:49,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:44:49,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-03 22:44:49,990 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-03 22:44:49,990 INFO  L175             Difference]: Start difference. First operand has 303 places, 515 transitions, 9505 flow. Second operand 9 states and 189 transitions.
[2024-06-03 22:44:49,990 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 557 transitions, 11051 flow
[2024-06-03 22:44:51,220 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 557 transitions, 10664 flow, removed 133 selfloop flow, removed 6 redundant places.
[2024-06-03 22:44:51,228 INFO  L231             Difference]: Finished difference. Result has 307 places, 517 transitions, 9491 flow
[2024-06-03 22:44:51,228 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9146, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9491, PETRI_PLACES=307, PETRI_TRANSITIONS=517}
[2024-06-03 22:44:51,229 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 264 predicate places.
[2024-06-03 22:44:51,229 INFO  L495      AbstractCegarLoop]: Abstraction has has 307 places, 517 transitions, 9491 flow
[2024-06-03 22:44:51,229 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:44:51,229 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:51,229 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:44:51,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-03 22:44:51,230 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-03 22:44:51,230 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:51,230 INFO  L85        PathProgramCache]: Analyzing trace with hash 1263263904, now seen corresponding path program 4 times
[2024-06-03 22:44:51,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:51,230 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726930789]
[2024-06-03 22:44:51,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:51,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:51,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:01,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:45:01,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:01,316 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726930789]
[2024-06-03 22:45:01,316 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726930789] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:01,316 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:01,316 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:45:01,316 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283308725]
[2024-06-03 22:45:01,316 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:01,317 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:45:01,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:01,317 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:45:01,317 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:45:01,532 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:45:01,532 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 517 transitions, 9491 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:45:01,532 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:01,532 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:45:01,532 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:04,934 INFO  L124   PetriNetUnfolderBase]: 5291/8417 cut-off events.
[2024-06-03 22:45:04,934 INFO  L125   PetriNetUnfolderBase]: For 625250/625252 co-relation queries the response was YES.
[2024-06-03 22:45:04,999 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83099 conditions, 8417 events. 5291/8417 cut-off events. For 625250/625252 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 53570 event pairs, 1261 based on Foata normal form. 59/8475 useless extension candidates. Maximal degree in co-relation 82945. Up to 6974 conditions per place. 
[2024-06-03 22:45:05,041 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 404 selfloop transitions, 192 changer transitions 0/601 dead transitions.
[2024-06-03 22:45:05,041 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 601 transitions, 12296 flow
[2024-06-03 22:45:05,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:45:05,043 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:45:05,043 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 239 transitions.
[2024-06-03 22:45:05,044 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5173160173160173
[2024-06-03 22:45:05,044 INFO  L175             Difference]: Start difference. First operand has 307 places, 517 transitions, 9491 flow. Second operand 11 states and 239 transitions.
[2024-06-03 22:45:05,044 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 601 transitions, 12296 flow
[2024-06-03 22:45:06,199 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 601 transitions, 12140 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-03 22:45:06,208 INFO  L231             Difference]: Finished difference. Result has 317 places, 548 transitions, 10868 flow
[2024-06-03 22:45:06,209 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9335, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10868, PETRI_PLACES=317, PETRI_TRANSITIONS=548}
[2024-06-03 22:45:06,209 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 274 predicate places.
[2024-06-03 22:45:06,209 INFO  L495      AbstractCegarLoop]: Abstraction has has 317 places, 548 transitions, 10868 flow
[2024-06-03 22:45:06,209 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:45:06,209 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:06,210 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:45:06,210 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-03 22:45:06,210 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-03 22:45:06,210 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:06,210 INFO  L85        PathProgramCache]: Analyzing trace with hash 1825391422, now seen corresponding path program 5 times
[2024-06-03 22:45:06,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:06,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529833275]
[2024-06-03 22:45:06,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:06,211 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:06,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:17,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:45:17,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:17,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529833275]
[2024-06-03 22:45:17,108 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529833275] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:17,108 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:17,108 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:45:17,108 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055735711]
[2024-06-03 22:45:17,108 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:17,109 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:45:17,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:17,112 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:45:17,112 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:45:17,406 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:45:17,406 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 548 transitions, 10868 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:45:17,407 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:17,407 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:45:17,407 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:20,994 INFO  L124   PetriNetUnfolderBase]: 5911/9492 cut-off events.
[2024-06-03 22:45:20,994 INFO  L125   PetriNetUnfolderBase]: For 843537/843539 co-relation queries the response was YES.
[2024-06-03 22:45:21,090 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100009 conditions, 9492 events. 5911/9492 cut-off events. For 843537/843539 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 62161 event pairs, 1132 based on Foata normal form. 48/9539 useless extension candidates. Maximal degree in co-relation 99850. Up to 4187 conditions per place. 
[2024-06-03 22:45:21,143 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 367 selfloop transitions, 256 changer transitions 0/628 dead transitions.
[2024-06-03 22:45:21,143 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 628 transitions, 13824 flow
[2024-06-03 22:45:21,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:45:21,144 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:45:21,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 247 transitions.
[2024-06-03 22:45:21,145 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5346320346320347
[2024-06-03 22:45:21,145 INFO  L175             Difference]: Start difference. First operand has 317 places, 548 transitions, 10868 flow. Second operand 11 states and 247 transitions.
[2024-06-03 22:45:21,145 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 628 transitions, 13824 flow
[2024-06-03 22:45:23,008 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 628 transitions, 13436 flow, removed 169 selfloop flow, removed 3 redundant places.
[2024-06-03 22:45:23,018 INFO  L231             Difference]: Finished difference. Result has 328 places, 558 transitions, 11591 flow
[2024-06-03 22:45:23,018 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10480, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11591, PETRI_PLACES=328, PETRI_TRANSITIONS=558}
[2024-06-03 22:45:23,018 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 285 predicate places.
[2024-06-03 22:45:23,018 INFO  L495      AbstractCegarLoop]: Abstraction has has 328 places, 558 transitions, 11591 flow
[2024-06-03 22:45:23,019 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:45:23,019 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:23,019 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:45:23,019 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-03 22:45:23,019 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-03 22:45:23,019 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:23,019 INFO  L85        PathProgramCache]: Analyzing trace with hash 1263530814, now seen corresponding path program 6 times
[2024-06-03 22:45:23,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:23,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169867141]
[2024-06-03 22:45:23,020 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:23,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:23,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:33,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:45:33,941 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:33,941 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169867141]
[2024-06-03 22:45:33,941 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169867141] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:33,941 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:33,941 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:45:33,941 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271754254]
[2024-06-03 22:45:33,942 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:33,942 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:45:33,942 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:33,942 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:45:33,942 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:45:34,097 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:45:34,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 558 transitions, 11591 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:45:34,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:34,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:45:34,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:38,476 INFO  L124   PetriNetUnfolderBase]: 6495/10514 cut-off events.
[2024-06-03 22:45:38,477 INFO  L125   PetriNetUnfolderBase]: For 1002080/1002080 co-relation queries the response was YES.
[2024-06-03 22:45:38,578 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 113997 conditions, 10514 events. 6495/10514 cut-off events. For 1002080/1002080 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 71368 event pairs, 1753 based on Foata normal form. 48/10561 useless extension candidates. Maximal degree in co-relation 113833. Up to 8327 conditions per place. 
[2024-06-03 22:45:38,633 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 502 selfloop transitions, 117 changer transitions 0/624 dead transitions.
[2024-06-03 22:45:38,633 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 624 transitions, 13913 flow
[2024-06-03 22:45:38,633 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:45:38,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:45:38,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 239 transitions.
[2024-06-03 22:45:38,634 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5173160173160173
[2024-06-03 22:45:38,634 INFO  L175             Difference]: Start difference. First operand has 328 places, 558 transitions, 11591 flow. Second operand 11 states and 239 transitions.
[2024-06-03 22:45:38,634 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 624 transitions, 13913 flow
[2024-06-03 22:45:40,778 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 624 transitions, 13543 flow, removed 83 selfloop flow, removed 5 redundant places.
[2024-06-03 22:45:40,788 INFO  L231             Difference]: Finished difference. Result has 334 places, 562 transitions, 11760 flow
[2024-06-03 22:45:40,789 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11233, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11760, PETRI_PLACES=334, PETRI_TRANSITIONS=562}
[2024-06-03 22:45:40,789 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 291 predicate places.
[2024-06-03 22:45:40,790 INFO  L495      AbstractCegarLoop]: Abstraction has has 334 places, 562 transitions, 11760 flow
[2024-06-03 22:45:40,790 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:45:40,790 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:40,790 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:45:40,790 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-03 22:45:40,790 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:45:40,791 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:40,791 INFO  L85        PathProgramCache]: Analyzing trace with hash 1255912254, now seen corresponding path program 7 times
[2024-06-03 22:45:40,791 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:40,791 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337223191]
[2024-06-03 22:45:40,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:40,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:41,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:51,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:45:51,888 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:51,888 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337223191]
[2024-06-03 22:45:51,888 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337223191] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:51,889 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:51,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:45:51,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181583958]
[2024-06-03 22:45:51,889 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:51,889 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:45:51,889 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:51,890 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:45:51,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:45:52,155 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:45:52,156 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 562 transitions, 11760 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:45:52,156 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:52,156 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:45:52,156 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:56,383 INFO  L124   PetriNetUnfolderBase]: 6415/10372 cut-off events.
[2024-06-03 22:45:56,383 INFO  L125   PetriNetUnfolderBase]: For 930346/930346 co-relation queries the response was YES.
[2024-06-03 22:45:56,475 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109246 conditions, 10372 events. 6415/10372 cut-off events. For 930346/930346 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 70241 event pairs, 1873 based on Foata normal form. 58/10429 useless extension candidates. Maximal degree in co-relation 109080. Up to 9149 conditions per place. 
[2024-06-03 22:45:56,528 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 506 selfloop transitions, 102 changer transitions 0/613 dead transitions.
[2024-06-03 22:45:56,528 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 613 transitions, 13402 flow
[2024-06-03 22:45:56,529 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:45:56,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:45:56,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 231 transitions.
[2024-06-03 22:45:56,529 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-03 22:45:56,529 INFO  L175             Difference]: Start difference. First operand has 334 places, 562 transitions, 11760 flow. Second operand 11 states and 231 transitions.
[2024-06-03 22:45:56,530 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 613 transitions, 13402 flow
[2024-06-03 22:45:58,403 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 613 transitions, 13089 flow, removed 96 selfloop flow, removed 6 redundant places.
[2024-06-03 22:45:58,414 INFO  L231             Difference]: Finished difference. Result has 339 places, 562 transitions, 11660 flow
[2024-06-03 22:45:58,415 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11447, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11660, PETRI_PLACES=339, PETRI_TRANSITIONS=562}
[2024-06-03 22:45:58,415 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 296 predicate places.
[2024-06-03 22:45:58,415 INFO  L495      AbstractCegarLoop]: Abstraction has has 339 places, 562 transitions, 11660 flow
[2024-06-03 22:45:58,415 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:45:58,415 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:58,416 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:45:58,416 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-03 22:45:58,416 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:45:58,416 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:58,416 INFO  L85        PathProgramCache]: Analyzing trace with hash 1859592178, now seen corresponding path program 8 times
[2024-06-03 22:45:58,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:58,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325283428]
[2024-06-03 22:45:58,417 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:58,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:58,669 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:09,546 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:09,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:09,547 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325283428]
[2024-06-03 22:46:09,547 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325283428] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:09,547 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:09,547 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:46:09,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702344811]
[2024-06-03 22:46:09,547 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:09,547 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:46:09,547 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:09,547 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:46:09,548 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:46:09,852 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:46:09,852 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 562 transitions, 11660 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:46:09,852 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:09,852 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:46:09,852 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:14,225 INFO  L124   PetriNetUnfolderBase]: 6631/10737 cut-off events.
[2024-06-03 22:46:14,226 INFO  L125   PetriNetUnfolderBase]: For 950714/950714 co-relation queries the response was YES.
[2024-06-03 22:46:14,673 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 112207 conditions, 10737 events. 6631/10737 cut-off events. For 950714/950714 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 73355 event pairs, 1960 based on Foata normal form. 58/10794 useless extension candidates. Maximal degree in co-relation 112039. Up to 9577 conditions per place. 
[2024-06-03 22:46:14,721 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 510 selfloop transitions, 100 changer transitions 5/620 dead transitions.
[2024-06-03 22:46:14,721 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 620 transitions, 13531 flow
[2024-06-03 22:46:14,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:46:14,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:46:14,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 233 transitions.
[2024-06-03 22:46:14,722 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5043290043290043
[2024-06-03 22:46:14,722 INFO  L175             Difference]: Start difference. First operand has 339 places, 562 transitions, 11660 flow. Second operand 11 states and 233 transitions.
[2024-06-03 22:46:14,723 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 620 transitions, 13531 flow
[2024-06-03 22:46:16,888 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 620 transitions, 13314 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-06-03 22:46:16,898 INFO  L231             Difference]: Finished difference. Result has 343 places, 568 transitions, 11867 flow
[2024-06-03 22:46:16,910 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11443, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11867, PETRI_PLACES=343, PETRI_TRANSITIONS=568}
[2024-06-03 22:46:16,914 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 300 predicate places.
[2024-06-03 22:46:16,914 INFO  L495      AbstractCegarLoop]: Abstraction has has 343 places, 568 transitions, 11867 flow
[2024-06-03 22:46:16,914 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:46:16,914 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:16,915 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:16,915 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-03 22:46:16,915 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-03 22:46:16,915 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:16,915 INFO  L85        PathProgramCache]: Analyzing trace with hash 1511692192, now seen corresponding path program 9 times
[2024-06-03 22:46:16,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:16,916 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125054853]
[2024-06-03 22:46:16,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:16,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:16,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:28,653 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:28,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:28,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125054853]
[2024-06-03 22:46:28,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125054853] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:28,654 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:28,654 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:46:28,654 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162235632]
[2024-06-03 22:46:28,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:28,659 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:46:28,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:28,659 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:46:28,659 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:46:28,842 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:46:28,843 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 568 transitions, 11867 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:46:28,843 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:28,843 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:46:28,843 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:33,883 INFO  L124   PetriNetUnfolderBase]: 6820/11057 cut-off events.
[2024-06-03 22:46:33,884 INFO  L125   PetriNetUnfolderBase]: For 970210/970210 co-relation queries the response was YES.
[2024-06-03 22:46:33,978 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 117745 conditions, 11057 events. 6820/11057 cut-off events. For 970210/970210 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 76094 event pairs, 1918 based on Foata normal form. 12/11068 useless extension candidates. Maximal degree in co-relation 117575. Up to 9582 conditions per place. 
[2024-06-03 22:46:34,030 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 464 selfloop transitions, 163 changer transitions 0/632 dead transitions.
[2024-06-03 22:46:34,031 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 632 transitions, 14325 flow
[2024-06-03 22:46:34,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:46:34,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:46:34,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 240 transitions.
[2024-06-03 22:46:34,032 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5194805194805194
[2024-06-03 22:46:34,032 INFO  L175             Difference]: Start difference. First operand has 343 places, 568 transitions, 11867 flow. Second operand 11 states and 240 transitions.
[2024-06-03 22:46:34,032 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 632 transitions, 14325 flow
[2024-06-03 22:46:36,170 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 632 transitions, 14024 flow, removed 55 selfloop flow, removed 8 redundant places.
[2024-06-03 22:46:36,180 INFO  L231             Difference]: Finished difference. Result has 347 places, 579 transitions, 12465 flow
[2024-06-03 22:46:36,180 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11566, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12465, PETRI_PLACES=347, PETRI_TRANSITIONS=579}
[2024-06-03 22:46:36,181 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 304 predicate places.
[2024-06-03 22:46:36,181 INFO  L495      AbstractCegarLoop]: Abstraction has has 347 places, 579 transitions, 12465 flow
[2024-06-03 22:46:36,181 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:46:36,181 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:36,181 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:36,181 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-03 22:46:36,182 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-03 22:46:36,182 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:36,182 INFO  L85        PathProgramCache]: Analyzing trace with hash 1511425282, now seen corresponding path program 10 times
[2024-06-03 22:46:36,182 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:36,182 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964845602]
[2024-06-03 22:46:36,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:36,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:36,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:46,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:46,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:46,253 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964845602]
[2024-06-03 22:46:46,254 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964845602] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:46,254 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:46,254 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:46:46,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101062670]
[2024-06-03 22:46:46,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:46,254 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:46:46,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:46,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:46:46,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:46:46,497 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:46:46,497 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 579 transitions, 12465 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:46:46,497 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:46,497 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:46:46,497 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:51,652 INFO  L124   PetriNetUnfolderBase]: 7000/11361 cut-off events.
[2024-06-03 22:46:51,652 INFO  L125   PetriNetUnfolderBase]: For 1078996/1078996 co-relation queries the response was YES.
[2024-06-03 22:46:51,756 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 121878 conditions, 11361 events. 7000/11361 cut-off events. For 1078996/1078996 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 78527 event pairs, 2007 based on Foata normal form. 65/11420 useless extension candidates. Maximal degree in co-relation 121706. Up to 9129 conditions per place. 
[2024-06-03 22:46:51,812 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 330 selfloop transitions, 309 changer transitions 0/644 dead transitions.
[2024-06-03 22:46:51,812 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 644 transitions, 15253 flow
[2024-06-03 22:46:51,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:46:51,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:46:51,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions.
[2024-06-03 22:46:51,815 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5166666666666667
[2024-06-03 22:46:51,815 INFO  L175             Difference]: Start difference. First operand has 347 places, 579 transitions, 12465 flow. Second operand 10 states and 217 transitions.
[2024-06-03 22:46:51,815 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 644 transitions, 15253 flow
[2024-06-03 22:46:54,391 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 644 transitions, 14387 flow, removed 304 selfloop flow, removed 7 redundant places.
[2024-06-03 22:46:54,401 INFO  L231             Difference]: Finished difference. Result has 354 places, 598 transitions, 13430 flow
[2024-06-03 22:46:54,401 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11675, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13430, PETRI_PLACES=354, PETRI_TRANSITIONS=598}
[2024-06-03 22:46:54,402 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 311 predicate places.
[2024-06-03 22:46:54,402 INFO  L495      AbstractCegarLoop]: Abstraction has has 354 places, 598 transitions, 13430 flow
[2024-06-03 22:46:54,402 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:46:54,402 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:54,402 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:54,402 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-03 22:46:54,403 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:54,403 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:54,403 INFO  L85        PathProgramCache]: Analyzing trace with hash -420323424, now seen corresponding path program 11 times
[2024-06-03 22:46:54,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:54,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575958537]
[2024-06-03 22:46:54,403 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:54,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:54,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat