./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_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/mix025_pso.opt_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/mix025_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix025_pso.opt_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-04 16:58:47,054 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 16:58:47,125 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 16:58:47,130 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 16:58:47,131 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 16:58:47,153 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 16:58:47,154 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 16:58:47,154 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 16:58:47,155 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 16:58:47,158 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 16:58:47,158 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 16:58:47,159 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 16:58:47,159 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 16:58:47,160 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 16:58:47,161 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 16:58:47,161 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 16:58:47,161 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 16:58:47,161 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 16:58:47,162 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 16:58:47,162 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 16:58:47,163 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 16:58:47,163 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 16:58:47,163 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 16:58:47,163 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 16:58:47,164 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 16:58:47,164 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 16:58:47,164 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 16:58:47,164 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 16:58:47,165 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 16:58:47,165 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 16:58:47,166 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 16:58:47,166 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 16:58:47,166 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 16:58:47,166 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 16:58:47,167 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 16:58:47,167 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 16:58:47,167 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 16:58:47,167 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 16:58:47,167 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 16:58:47,167 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 16:58:47,168 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 16:58:47,168 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 16:58:47,168 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 16:58:47,168 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-04 16:58:47,385 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 16:58:47,416 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 16:58:47,420 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 16:58:47,421 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 16:58:47,422 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 16:58:47,422 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/mix025_pso.opt_rmo.opt.yml/witness.yml
[2024-06-04 16:58:47,622 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 16:58:47,622 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 16:58:47,623 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i
[2024-06-04 16:58:48,783 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 16:58:49,000 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 16:58:49,000 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i
[2024-06-04 16:58:49,014 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a5756f8/2c8755616db842e689bf61c9c728e89b/FLAGf58d1d405
[2024-06-04 16:58:49,025 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a5756f8/2c8755616db842e689bf61c9c728e89b
[2024-06-04 16:58:49,026 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 16:58:49,027 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 16:58:49,027 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 16:58:49,028 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 16:58:49,031 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 16:58:49,032 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:58:47" (1/2) ...
[2024-06-04 16:58:49,032 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a049057 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:58:49, skipping insertion in model container
[2024-06-04 16:58:49,033 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:58:47" (1/2) ...
[2024-06-04 16:58:49,034 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@54a4ff8b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:58:49, skipping insertion in model container
[2024-06-04 16:58:49,034 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:58:49" (2/2) ...
[2024-06-04 16:58:49,035 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a049057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49, skipping insertion in model container
[2024-06-04 16:58:49,035 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:58:49" (2/2) ...
[2024-06-04 16:58:49,036 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 16:58:49,108 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 16:58:49,109 INFO  L97    edCorrectnessWitness]: Location invariant before [L837-L837] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! 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_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_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_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_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_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$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) && (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 )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 )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 )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 )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 )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$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$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$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_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_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_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_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_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_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_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$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$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 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 )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) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (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 )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 || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 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)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-04 16:58:49,110 INFO  L97    edCorrectnessWitness]: Location invariant before [L839-L839] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! 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_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_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_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_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_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$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) && (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 )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 )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 )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 )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 )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$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$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$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_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_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_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_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_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_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_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$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$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 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 )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) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (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 )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 || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 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)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-04 16:58:49,111 INFO  L97    edCorrectnessWitness]: Location invariant before [L840-L840] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! 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_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_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_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_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_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$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) && (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 )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 )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 )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 )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 )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$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$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$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_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_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_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_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_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_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_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$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$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 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 )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) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (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 )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 || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 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)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-04 16:58:49,111 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 16:58:49,111 INFO  L106   edCorrectnessWitness]: ghost_update [L835-L835] multithreaded = 1;
[2024-06-04 16:58:49,152 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 16:58:49,413 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 16:58:49,425 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-04 16:58:49,806 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 16:58:49,841 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 16:58:49,841 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49 WrapperNode
[2024-06-04 16:58:49,841 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 16:58:49,843 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 16:58:49,843 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 16:58:49,843 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 16:58:49,848 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (1/1) ...
[2024-06-04 16:58:49,897 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (1/1) ...
[2024-06-04 16:58:50,075 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126
[2024-06-04 16:58:50,076 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 16:58:50,077 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 16:58:50,077 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 16:58:50,077 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 16:58:50,086 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (1/1) ...
[2024-06-04 16:58:50,086 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (1/1) ...
[2024-06-04 16:58:50,114 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (1/1) ...
[2024-06-04 16:58:50,149 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-04 16:58:50,150 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (1/1) ...
[2024-06-04 16:58:50,150 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (1/1) ...
[2024-06-04 16:58:50,180 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (1/1) ...
[2024-06-04 16:58:50,182 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (1/1) ...
[2024-06-04 16:58:50,193 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (1/1) ...
[2024-06-04 16:58:50,197 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (1/1) ...
[2024-06-04 16:58:50,212 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 16:58:50,213 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 16:58:50,213 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 16:58:50,214 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 16:58:50,214 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (1/1) ...
[2024-06-04 16:58:50,219 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 16:58:50,226 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 16:58:50,238 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-04 16:58:50,260 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-04 16:58:50,286 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 16:58:50,287 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 16:58:50,287 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 16:58:50,287 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 16:58:50,287 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 16:58:50,287 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 16:58:50,288 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 16:58:50,288 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 16:58:50,288 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 16:58:50,288 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 16:58:50,288 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 16:58:50,288 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 16:58:50,289 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-04 16:58:50,482 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 16:58:50,484 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 16:58:51,591 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 16:58:51,593 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 16:58:51,854 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 16:58:51,855 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 16:58:51,855 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:58:51 BoogieIcfgContainer
[2024-06-04 16:58:51,855 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 16:58:51,857 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 16:58:51,857 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 16:58:51,860 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 16:58:51,860 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:58:47" (1/4) ...
[2024-06-04 16:58:51,861 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527da815 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:58:51, skipping insertion in model container
[2024-06-04 16:58:51,861 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:58:49" (2/4) ...
[2024-06-04 16:58:51,861 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527da815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:58:51, skipping insertion in model container
[2024-06-04 16:58:51,861 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:58:49" (3/4) ...
[2024-06-04 16:58:51,862 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527da815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:58:51, skipping insertion in model container
[2024-06-04 16:58:51,862 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:58:51" (4/4) ...
[2024-06-04 16:58:51,863 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i
[2024-06-04 16:58:51,876 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 16:58:51,876 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 16:58:51,876 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 16:58:51,983 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 16:58:52,005 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-04 16:58:52,041 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-04 16:58:52,042 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 16:58:52,044 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-04 16:58:52,045 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-04 16:58:52,060 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-04 16:58:52,095 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 16:58:52,100 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;@7ef1b3be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 16:58:52,100 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 16:58:52,106 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 16:58:52,107 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-04 16:58:52,120 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 16:58:52,120 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:58:52,121 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 16:58:52,122 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:58:52,125 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:58:52,126 INFO  L85        PathProgramCache]: Analyzing trace with hash -1649445791, now seen corresponding path program 1 times
[2024-06-04 16:58:52,132 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:58:52,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812945322]
[2024-06-04 16:58:52,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:58:52,134 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:58:52,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:58:57,147 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:58:57,147 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:58:57,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812945322]
[2024-06-04 16:58:57,148 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812945322] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:58:57,149 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:58:57,149 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 16:58:57,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465137235]
[2024-06-04 16:58:57,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:58:57,156 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 16:58:57,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:58:57,210 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 16:58:57,210 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 16:58:57,289 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-04 16:58:57,292 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-04 16:58:57,292 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:58:57,292 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-04 16:58:57,293 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:58:58,081 INFO  L124   PetriNetUnfolderBase]: 1152/1853 cut-off events.
[2024-06-04 16:58:58,081 INFO  L125   PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES.
[2024-06-04 16:58:58,088 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3672 conditions, 1853 events. 1152/1853 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9218 event pairs, 785 based on Foata normal form. 1/1779 useless extension candidates. Maximal degree in co-relation 3657. Up to 1732 conditions per place. 
[2024-06-04 16:58:58,096 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-04 16:58:58,096 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 175 flow
[2024-06-04 16:58:58,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 16:58:58,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 16:58:58,104 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions.
[2024-06-04 16:58:58,105 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6031746031746031
[2024-06-04 16:58:58,106 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 76 transitions.
[2024-06-04 16:58:58,107 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 175 flow
[2024-06-04 16:58:58,109 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 16:58:58,112 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-04 16:58:58,113 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-04 16:58:58,116 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-04 16:58:58,116 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-04 16:58:58,116 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-04 16:58:58,116 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:58:58,116 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:58:58,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 16:58:58,117 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:58:58,118 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:58:58,118 INFO  L85        PathProgramCache]: Analyzing trace with hash -274434560, now seen corresponding path program 1 times
[2024-06-04 16:58:58,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:58:58,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135754647]
[2024-06-04 16:58:58,119 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:58:58,119 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:58:58,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:01,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:59:01,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:01,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135754647]
[2024-06-04 16:59:01,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135754647] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:01,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:01,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 16:59:01,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075262726]
[2024-06-04 16:59:01,962 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:01,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 16:59:01,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:01,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 16:59:01,963 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-04 16:59:02,048 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 16:59:02,049 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 16:59:02,049 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:02,049 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 16:59:02,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:02,723 INFO  L124   PetriNetUnfolderBase]: 1353/2091 cut-off events.
[2024-06-04 16:59:02,724 INFO  L125   PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES.
[2024-06-04 16:59:02,727 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 2091 events. 1353/2091 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10097 event pairs, 795 based on Foata normal form. 3/2083 useless extension candidates. Maximal degree in co-relation 4734. Up to 2005 conditions per place. 
[2024-06-04 16:59:02,734 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 41 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-04 16:59:02,734 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 244 flow
[2024-06-04 16:59:02,735 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 16:59:02,735 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 16:59:02,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions.
[2024-06-04 16:59:02,736 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5654761904761905
[2024-06-04 16:59:02,736 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 95 transitions.
[2024-06-04 16:59:02,736 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 244 flow
[2024-06-04 16:59:02,737 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 16:59:02,738 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-04 16:59:02,738 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-04 16:59:02,738 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-04 16:59:02,739 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-04 16:59:02,739 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 16:59:02,739 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:02,739 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:02,739 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 16:59:02,739 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:59:02,740 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:02,740 INFO  L85        PathProgramCache]: Analyzing trace with hash 82464492, now seen corresponding path program 1 times
[2024-06-04 16:59:02,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:02,740 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362842620]
[2024-06-04 16:59:02,740 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:02,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:02,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:07,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:59:07,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:07,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362842620]
[2024-06-04 16:59:07,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362842620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:07,132 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:07,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-04 16:59:07,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744459808]
[2024-06-04 16:59:07,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:07,133 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-04 16:59:07,134 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:07,134 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-04 16:59:07,134 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-04 16:59:07,328 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 16:59:07,329 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 16:59:07,329 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:07,329 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 16:59:07,329 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:08,171 INFO  L124   PetriNetUnfolderBase]: 1347/2082 cut-off events.
[2024-06-04 16:59:08,172 INFO  L125   PetriNetUnfolderBase]: For 1108/1108 co-relation queries the response was YES.
[2024-06-04 16:59:08,175 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5265 conditions, 2082 events. 1347/2082 cut-off events. For 1108/1108 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10008 event pairs, 649 based on Foata normal form. 3/2074 useless extension candidates. Maximal degree in co-relation 5248. Up to 1981 conditions per place. 
[2024-06-04 16:59:08,182 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 10 changer transitions 0/63 dead transitions.
[2024-06-04 16:59:08,182 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 322 flow
[2024-06-04 16:59:08,183 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 16:59:08,183 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 16:59:08,184 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions.
[2024-06-04 16:59:08,184 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5523809523809524
[2024-06-04 16:59:08,184 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 116 transitions.
[2024-06-04 16:59:08,184 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 322 flow
[2024-06-04 16:59:08,186 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 308 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-04 16:59:08,187 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 174 flow
[2024-06-04 16:59:08,187 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-04 16:59:08,187 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places.
[2024-06-04 16:59:08,188 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 174 flow
[2024-06-04 16:59:08,188 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 16:59:08,188 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:08,188 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:08,188 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 16:59:08,188 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:59:08,189 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:08,189 INFO  L85        PathProgramCache]: Analyzing trace with hash 1939006827, now seen corresponding path program 1 times
[2024-06-04 16:59:08,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:08,189 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915028953]
[2024-06-04 16:59:08,189 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:08,189 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:08,246 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:12,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-04 16:59:12,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:12,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915028953]
[2024-06-04 16:59:12,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915028953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:12,587 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:12,587 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 16:59:12,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526022557]
[2024-06-04 16:59:12,587 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:12,588 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 16:59:12,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:12,589 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 16:59:12,590 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-04 16:59:12,776 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 16:59:12,776 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 174 flow. Second operand  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 16:59:12,777 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:12,777 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 16:59:12,777 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:13,768 INFO  L124   PetriNetUnfolderBase]: 1338/2067 cut-off events.
[2024-06-04 16:59:13,768 INFO  L125   PetriNetUnfolderBase]: For 2049/2049 co-relation queries the response was YES.
[2024-06-04 16:59:13,770 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5732 conditions, 2067 events. 1338/2067 cut-off events. For 2049/2049 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9953 event pairs, 485 based on Foata normal form. 6/2062 useless extension candidates. Maximal degree in co-relation 5714. Up to 1936 conditions per place. 
[2024-06-04 16:59:13,776 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 52 selfloop transitions, 12 changer transitions 0/69 dead transitions.
[2024-06-04 16:59:13,776 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 376 flow
[2024-06-04 16:59:13,777 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 16:59:13,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 16:59:13,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions.
[2024-06-04 16:59:13,780 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5277777777777778
[2024-06-04 16:59:13,780 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 174 flow. Second operand 6 states and 133 transitions.
[2024-06-04 16:59:13,780 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 376 flow
[2024-06-04 16:59:13,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 352 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 16:59:13,785 INFO  L231             Difference]: Finished difference. Result has 51 places, 43 transitions, 193 flow
[2024-06-04 16:59:13,786 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=51, PETRI_TRANSITIONS=43}
[2024-06-04 16:59:13,786 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-04 16:59:13,787 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 193 flow
[2024-06-04 16:59:13,787 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 16:59:13,787 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:13,787 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:13,787 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 16:59:13,787 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:59:13,788 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:13,788 INFO  L85        PathProgramCache]: Analyzing trace with hash 1183660943, now seen corresponding path program 1 times
[2024-06-04 16:59:13,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:13,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618135210]
[2024-06-04 16:59:13,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:13,789 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:13,834 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:19,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:59:19,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:19,547 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618135210]
[2024-06-04 16:59:19,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618135210] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:19,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:19,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 16:59:19,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677733521]
[2024-06-04 16:59:19,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:19,548 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 16:59:19,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:19,549 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 16:59:19,549 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-04 16:59:19,666 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 16:59:19,666 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 193 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-04 16:59:19,666 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:19,667 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 16:59:19,667 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:20,345 INFO  L124   PetriNetUnfolderBase]: 1126/1833 cut-off events.
[2024-06-04 16:59:20,345 INFO  L125   PetriNetUnfolderBase]: For 2644/2644 co-relation queries the response was YES.
[2024-06-04 16:59:20,349 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5319 conditions, 1833 events. 1126/1833 cut-off events. For 2644/2644 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9149 event pairs, 487 based on Foata normal form. 2/1804 useless extension candidates. Maximal degree in co-relation 5300. Up to 1683 conditions per place. 
[2024-06-04 16:59:20,357 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 43 selfloop transitions, 8 changer transitions 0/57 dead transitions.
[2024-06-04 16:59:20,357 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 339 flow
[2024-06-04 16:59:20,357 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 16:59:20,358 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 16:59:20,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions.
[2024-06-04 16:59:20,359 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-04 16:59:20,359 INFO  L175             Difference]: Start difference. First operand has 51 places, 43 transitions, 193 flow. Second operand 5 states and 100 transitions.
[2024-06-04 16:59:20,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 339 flow
[2024-06-04 16:59:20,362 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 306 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-04 16:59:20,364 INFO  L231             Difference]: Finished difference. Result has 52 places, 46 transitions, 206 flow
[2024-06-04 16:59:20,365 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=52, PETRI_TRANSITIONS=46}
[2024-06-04 16:59:20,367 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2024-06-04 16:59:20,367 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 206 flow
[2024-06-04 16:59:20,368 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-04 16:59:20,372 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:20,373 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:20,373 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 16:59:20,373 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:59:20,373 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:20,373 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961215675, now seen corresponding path program 1 times
[2024-06-04 16:59:20,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:20,374 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770676796]
[2024-06-04 16:59:20,374 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:20,374 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:20,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:26,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:59:26,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:26,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770676796]
[2024-06-04 16:59:26,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770676796] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:26,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:26,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 16:59:26,752 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589795438]
[2024-06-04 16:59:26,753 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:26,753 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 16:59:26,753 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:26,753 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 16:59:26,754 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 16:59:26,879 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 16:59:26,880 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 206 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-04 16:59:26,880 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:26,880 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 16:59:26,880 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:27,679 INFO  L124   PetriNetUnfolderBase]: 1335/2074 cut-off events.
[2024-06-04 16:59:27,680 INFO  L125   PetriNetUnfolderBase]: For 4293/4293 co-relation queries the response was YES.
[2024-06-04 16:59:27,683 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6520 conditions, 2074 events. 1335/2074 cut-off events. For 4293/4293 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10010 event pairs, 569 based on Foata normal form. 3/2076 useless extension candidates. Maximal degree in co-relation 6499. Up to 1955 conditions per place. 
[2024-06-04 16:59:27,690 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 52 selfloop transitions, 17 changer transitions 0/74 dead transitions.
[2024-06-04 16:59:27,691 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 460 flow
[2024-06-04 16:59:27,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 16:59:27,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 16:59:27,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions.
[2024-06-04 16:59:27,692 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4722222222222222
[2024-06-04 16:59:27,692 INFO  L175             Difference]: Start difference. First operand has 52 places, 46 transitions, 206 flow. Second operand 6 states and 119 transitions.
[2024-06-04 16:59:27,692 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 460 flow
[2024-06-04 16:59:27,694 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 438 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-04 16:59:27,695 INFO  L231             Difference]: Finished difference. Result has 57 places, 57 transitions, 309 flow
[2024-06-04 16:59:27,695 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=57, PETRI_TRANSITIONS=57}
[2024-06-04 16:59:27,696 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-04 16:59:27,696 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 309 flow
[2024-06-04 16:59:27,696 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-04 16:59:27,696 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:27,696 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:27,697 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 16:59:27,697 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:59:27,697 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:27,697 INFO  L85        PathProgramCache]: Analyzing trace with hash 382516018, now seen corresponding path program 1 times
[2024-06-04 16:59:27,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:27,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662062250]
[2024-06-04 16:59:27,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:27,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:27,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:34,246 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:59:34,246 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:34,246 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662062250]
[2024-06-04 16:59:34,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662062250] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:34,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:34,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 16:59:34,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694209629]
[2024-06-04 16:59:34,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:34,247 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 16:59:34,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:34,247 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 16:59:34,247 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 16:59:34,378 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 16:59:34,378 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 309 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-04 16:59:34,378 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:34,379 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 16:59:34,379 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:35,218 INFO  L124   PetriNetUnfolderBase]: 1409/2192 cut-off events.
[2024-06-04 16:59:35,219 INFO  L125   PetriNetUnfolderBase]: For 6798/6808 co-relation queries the response was YES.
[2024-06-04 16:59:35,221 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7727 conditions, 2192 events. 1409/2192 cut-off events. For 6798/6808 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10587 event pairs, 568 based on Foata normal form. 4/2184 useless extension candidates. Maximal degree in co-relation 7703. Up to 2047 conditions per place. 
[2024-06-04 16:59:35,229 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 60 selfloop transitions, 11 changer transitions 0/79 dead transitions.
[2024-06-04 16:59:35,229 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 525 flow
[2024-06-04 16:59:35,229 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 16:59:35,229 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 16:59:35,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-04 16:59:35,230 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-04 16:59:35,230 INFO  L175             Difference]: Start difference. First operand has 57 places, 57 transitions, 309 flow. Second operand 6 states and 117 transitions.
[2024-06-04 16:59:35,230 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 525 flow
[2024-06-04 16:59:35,233 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 509 flow, removed 7 selfloop flow, removed 1 redundant places.
[2024-06-04 16:59:35,234 INFO  L231             Difference]: Finished difference. Result has 62 places, 60 transitions, 353 flow
[2024-06-04 16:59:35,234 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=62, PETRI_TRANSITIONS=60}
[2024-06-04 16:59:35,234 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places.
[2024-06-04 16:59:35,234 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 353 flow
[2024-06-04 16:59:35,235 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-04 16:59:35,235 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:35,235 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:35,235 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 16:59:35,235 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:59:35,235 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:35,236 INFO  L85        PathProgramCache]: Analyzing trace with hash -668150930, now seen corresponding path program 2 times
[2024-06-04 16:59:35,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:35,236 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965925590]
[2024-06-04 16:59:35,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:35,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:35,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:42,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:59:42,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:42,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965925590]
[2024-06-04 16:59:42,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965925590] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:42,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:42,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 16:59:42,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690505434]
[2024-06-04 16:59:42,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:42,006 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 16:59:42,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:42,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 16:59:42,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 16:59:42,109 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 16:59:42,109 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 353 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-04 16:59:42,109 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:42,109 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 16:59:42,109 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:42,868 INFO  L124   PetriNetUnfolderBase]: 1415/2208 cut-off events.
[2024-06-04 16:59:42,868 INFO  L125   PetriNetUnfolderBase]: For 8844/8864 co-relation queries the response was YES.
[2024-06-04 16:59:42,871 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8305 conditions, 2208 events. 1415/2208 cut-off events. For 8844/8864 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10757 event pairs, 575 based on Foata normal form. 12/2208 useless extension candidates. Maximal degree in co-relation 8278. Up to 2029 conditions per place. 
[2024-06-04 16:59:42,879 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 56 selfloop transitions, 16 changer transitions 0/80 dead transitions.
[2024-06-04 16:59:42,879 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 573 flow
[2024-06-04 16:59:42,900 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 16:59:42,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 16:59:42,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-04 16:59:42,901 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-04 16:59:42,901 INFO  L175             Difference]: Start difference. First operand has 62 places, 60 transitions, 353 flow. Second operand 6 states and 117 transitions.
[2024-06-04 16:59:42,901 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 573 flow
[2024-06-04 16:59:42,904 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 80 transitions, 539 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-04 16:59:42,905 INFO  L231             Difference]: Finished difference. Result has 64 places, 63 transitions, 395 flow
[2024-06-04 16:59:42,906 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=64, PETRI_TRANSITIONS=63}
[2024-06-04 16:59:42,907 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places.
[2024-06-04 16:59:42,908 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 395 flow
[2024-06-04 16:59:42,908 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-04 16:59:42,908 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:42,908 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:42,908 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 16:59:42,908 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:59:42,909 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:42,909 INFO  L85        PathProgramCache]: Analyzing trace with hash -668142994, now seen corresponding path program 1 times
[2024-06-04 16:59:42,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:42,909 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701433079]
[2024-06-04 16:59:42,909 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:42,909 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:42,945 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:49,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:59:49,527 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:49,527 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701433079]
[2024-06-04 16:59:49,527 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701433079] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:49,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:49,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 16:59:49,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140734706]
[2024-06-04 16:59:49,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:49,528 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 16:59:49,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:49,529 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 16:59:49,530 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 16:59:49,660 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 16:59:49,660 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 395 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-04 16:59:49,660 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:49,660 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 16:59:49,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:50,600 INFO  L124   PetriNetUnfolderBase]: 1365/2149 cut-off events.
[2024-06-04 16:59:50,600 INFO  L125   PetriNetUnfolderBase]: For 10500/10500 co-relation queries the response was YES.
[2024-06-04 16:59:50,604 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8537 conditions, 2149 events. 1365/2149 cut-off events. For 10500/10500 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10449 event pairs, 533 based on Foata normal form. 3/2151 useless extension candidates. Maximal degree in co-relation 8509. Up to 1986 conditions per place. 
[2024-06-04 16:59:50,612 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 62 selfloop transitions, 21 changer transitions 0/88 dead transitions.
[2024-06-04 16:59:50,612 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 677 flow
[2024-06-04 16:59:50,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 16:59:50,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 16:59:50,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-04 16:59:50,625 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-04 16:59:50,625 INFO  L175             Difference]: Start difference. First operand has 64 places, 63 transitions, 395 flow. Second operand 7 states and 137 transitions.
[2024-06-04 16:59:50,625 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 677 flow
[2024-06-04 16:59:50,629 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 88 transitions, 627 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-04 16:59:50,630 INFO  L231             Difference]: Finished difference. Result has 67 places, 67 transitions, 436 flow
[2024-06-04 16:59:50,631 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=436, PETRI_PLACES=67, PETRI_TRANSITIONS=67}
[2024-06-04 16:59:50,631 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places.
[2024-06-04 16:59:50,631 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 436 flow
[2024-06-04 16:59:50,631 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-04 16:59:50,632 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:50,632 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:50,632 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 16:59:50,632 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:59:50,632 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:50,632 INFO  L85        PathProgramCache]: Analyzing trace with hash 1447349136, now seen corresponding path program 1 times
[2024-06-04 16:59:50,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:50,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206065586]
[2024-06-04 16:59:50,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:50,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:50,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 16:59:57,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 16:59:57,998 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 16:59:57,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206065586]
[2024-06-04 16:59:57,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206065586] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 16:59:57,999 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 16:59:57,999 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 16:59:57,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762766567]
[2024-06-04 16:59:57,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 16:59:58,000 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 16:59:58,002 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 16:59:58,003 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 16:59:58,005 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 16:59:58,231 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 16:59:58,232 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 436 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-04 16:59:58,232 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 16:59:58,232 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 16:59:58,232 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 16:59:59,187 INFO  L124   PetriNetUnfolderBase]: 1445/2234 cut-off events.
[2024-06-04 16:59:59,187 INFO  L125   PetriNetUnfolderBase]: For 14284/14303 co-relation queries the response was YES.
[2024-06-04 16:59:59,191 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9548 conditions, 2234 events. 1445/2234 cut-off events. For 14284/14303 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10711 event pairs, 571 based on Foata normal form. 3/2230 useless extension candidates. Maximal degree in co-relation 9519. Up to 2071 conditions per place. 
[2024-06-04 16:59:59,198 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 72 selfloop transitions, 14 changer transitions 0/95 dead transitions.
[2024-06-04 16:59:59,199 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 95 transitions, 710 flow
[2024-06-04 16:59:59,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 16:59:59,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 16:59:59,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-04 16:59:59,200 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46258503401360546
[2024-06-04 16:59:59,200 INFO  L175             Difference]: Start difference. First operand has 67 places, 67 transitions, 436 flow. Second operand 7 states and 136 transitions.
[2024-06-04 16:59:59,200 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 95 transitions, 710 flow
[2024-06-04 16:59:59,204 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 95 transitions, 649 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-04 16:59:59,205 INFO  L231             Difference]: Finished difference. Result has 69 places, 70 transitions, 455 flow
[2024-06-04 16:59:59,206 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=69, PETRI_TRANSITIONS=70}
[2024-06-04 16:59:59,206 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-04 16:59:59,206 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 455 flow
[2024-06-04 16:59:59,206 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-04 16:59:59,206 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 16:59:59,207 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 16:59:59,207 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 16:59:59,207 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 16:59:59,207 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 16:59:59,207 INFO  L85        PathProgramCache]: Analyzing trace with hash 1447469292, now seen corresponding path program 1 times
[2024-06-04 16:59:59,207 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 16:59:59,208 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980414324]
[2024-06-04 16:59:59,208 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 16:59:59,208 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 16:59:59,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:06,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:06,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:06,316 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980414324]
[2024-06-04 17:00:06,316 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980414324] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:06,316 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:06,316 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:00:06,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800094099]
[2024-06-04 17:00:06,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:06,317 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:00:06,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:06,317 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:00:06,317 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:00:06,482 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:00:06,482 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 455 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:06,482 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:06,482 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:00:06,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:07,525 INFO  L124   PetriNetUnfolderBase]: 1635/2455 cut-off events.
[2024-06-04 17:00:07,525 INFO  L125   PetriNetUnfolderBase]: For 17732/17732 co-relation queries the response was YES.
[2024-06-04 17:00:07,529 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10986 conditions, 2455 events. 1635/2455 cut-off events. For 17732/17732 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11512 event pairs, 592 based on Foata normal form. 6/2460 useless extension candidates. Maximal degree in co-relation 10956. Up to 2319 conditions per place. 
[2024-06-04 17:00:07,538 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 82 selfloop transitions, 22 changer transitions 0/108 dead transitions.
[2024-06-04 17:00:07,538 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 889 flow
[2024-06-04 17:00:07,538 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:00:07,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:00:07,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-04 17:00:07,539 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-04 17:00:07,539 INFO  L175             Difference]: Start difference. First operand has 69 places, 70 transitions, 455 flow. Second operand 7 states and 137 transitions.
[2024-06-04 17:00:07,539 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 889 flow
[2024-06-04 17:00:07,545 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 833 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-04 17:00:07,547 INFO  L231             Difference]: Finished difference. Result has 73 places, 81 transitions, 579 flow
[2024-06-04 17:00:07,547 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=579, PETRI_PLACES=73, PETRI_TRANSITIONS=81}
[2024-06-04 17:00:07,548 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places.
[2024-06-04 17:00:07,548 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 579 flow
[2024-06-04 17:00:07,548 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:07,548 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:07,548 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:07,548 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 17:00:07,548 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:07,549 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:07,549 INFO  L85        PathProgramCache]: Analyzing trace with hash 1624600812, now seen corresponding path program 2 times
[2024-06-04 17:00:07,549 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:07,549 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002418730]
[2024-06-04 17:00:07,549 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:07,549 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:07,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:14,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:14,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:14,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002418730]
[2024-06-04 17:00:14,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002418730] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:14,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:14,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:00:14,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277853380]
[2024-06-04 17:00:14,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:14,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:00:14,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:14,785 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:00:14,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:00:14,933 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:00:14,934 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 579 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:14,934 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:14,934 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:00:14,934 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:15,953 INFO  L124   PetriNetUnfolderBase]: 1703/2559 cut-off events.
[2024-06-04 17:00:15,954 INFO  L125   PetriNetUnfolderBase]: For 23525/23535 co-relation queries the response was YES.
[2024-06-04 17:00:15,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12618 conditions, 2559 events. 1703/2559 cut-off events. For 23525/23535 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12060 event pairs, 609 based on Foata normal form. 16/2574 useless extension candidates. Maximal degree in co-relation 12585. Up to 2270 conditions per place. 
[2024-06-04 17:00:15,966 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 78 selfloop transitions, 34 changer transitions 0/116 dead transitions.
[2024-06-04 17:00:15,966 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 116 transitions, 1079 flow
[2024-06-04 17:00:15,967 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:00:15,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:00:15,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions.
[2024-06-04 17:00:15,968 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47278911564625853
[2024-06-04 17:00:15,968 INFO  L175             Difference]: Start difference. First operand has 73 places, 81 transitions, 579 flow. Second operand 7 states and 139 transitions.
[2024-06-04 17:00:15,968 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 116 transitions, 1079 flow
[2024-06-04 17:00:15,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 116 transitions, 1029 flow, removed 21 selfloop flow, removed 2 redundant places.
[2024-06-04 17:00:15,979 INFO  L231             Difference]: Finished difference. Result has 79 places, 89 transitions, 717 flow
[2024-06-04 17:00:15,979 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=717, PETRI_PLACES=79, PETRI_TRANSITIONS=89}
[2024-06-04 17:00:15,980 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places.
[2024-06-04 17:00:15,980 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 89 transitions, 717 flow
[2024-06-04 17:00:15,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:15,981 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:15,981 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:15,981 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 17:00:15,981 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:15,981 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:15,981 INFO  L85        PathProgramCache]: Analyzing trace with hash 1624837962, now seen corresponding path program 3 times
[2024-06-04 17:00:15,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:15,982 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399445743]
[2024-06-04 17:00:15,982 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:15,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:16,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:23,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:23,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:23,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399445743]
[2024-06-04 17:00:23,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399445743] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:23,127 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:23,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:00:23,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842177813]
[2024-06-04 17:00:23,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:23,128 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:00:23,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:23,129 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:00:23,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:00:23,299 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:00:23,299 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 89 transitions, 717 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:23,299 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:23,299 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:00:23,299 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:24,239 INFO  L124   PetriNetUnfolderBase]: 1707/2566 cut-off events.
[2024-06-04 17:00:24,239 INFO  L125   PetriNetUnfolderBase]: For 28096/28106 co-relation queries the response was YES.
[2024-06-04 17:00:24,243 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13516 conditions, 2566 events. 1707/2566 cut-off events. For 28096/28106 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12096 event pairs, 599 based on Foata normal form. 16/2581 useless extension candidates. Maximal degree in co-relation 13480. Up to 2279 conditions per place. 
[2024-06-04 17:00:24,249 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 71 selfloop transitions, 42 changer transitions 0/117 dead transitions.
[2024-06-04 17:00:24,250 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 117 transitions, 1122 flow
[2024-06-04 17:00:24,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:00:24,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:00:24,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-04 17:00:24,251 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-04 17:00:24,251 INFO  L175             Difference]: Start difference. First operand has 79 places, 89 transitions, 717 flow. Second operand 7 states and 137 transitions.
[2024-06-04 17:00:24,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 117 transitions, 1122 flow
[2024-06-04 17:00:24,263 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 117 transitions, 1009 flow, removed 35 selfloop flow, removed 4 redundant places.
[2024-06-04 17:00:24,264 INFO  L231             Difference]: Finished difference. Result has 82 places, 93 transitions, 760 flow
[2024-06-04 17:00:24,264 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=760, PETRI_PLACES=82, PETRI_TRANSITIONS=93}
[2024-06-04 17:00:24,265 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places.
[2024-06-04 17:00:24,265 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 93 transitions, 760 flow
[2024-06-04 17:00:24,265 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:24,265 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:24,265 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:24,266 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 17:00:24,266 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:24,266 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:24,266 INFO  L85        PathProgramCache]: Analyzing trace with hash 762404484, now seen corresponding path program 1 times
[2024-06-04 17:00:24,266 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:24,266 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580186474]
[2024-06-04 17:00:24,266 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:24,267 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:24,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:30,981 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:30,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:30,981 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580186474]
[2024-06-04 17:00:30,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580186474] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:30,981 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:30,981 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:00:30,981 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109194655]
[2024-06-04 17:00:30,981 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:30,982 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:00:30,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:30,982 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:00:30,982 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:00:31,134 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:00:31,134 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 93 transitions, 760 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-04 17:00:31,134 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:31,134 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:00:31,134 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:32,253 INFO  L124   PetriNetUnfolderBase]: 1503/2359 cut-off events.
[2024-06-04 17:00:32,254 INFO  L125   PetriNetUnfolderBase]: For 25399/25399 co-relation queries the response was YES.
[2024-06-04 17:00:32,258 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12067 conditions, 2359 events. 1503/2359 cut-off events. For 25399/25399 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11551 event pairs, 506 based on Foata normal form. 6/2364 useless extension candidates. Maximal degree in co-relation 12030. Up to 2157 conditions per place. 
[2024-06-04 17:00:32,265 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 93 selfloop transitions, 24 changer transitions 0/122 dead transitions.
[2024-06-04 17:00:32,265 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 122 transitions, 1156 flow
[2024-06-04 17:00:32,266 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:00:32,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:00:32,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-04 17:00:32,267 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-04 17:00:32,267 INFO  L175             Difference]: Start difference. First operand has 82 places, 93 transitions, 760 flow. Second operand 8 states and 155 transitions.
[2024-06-04 17:00:32,267 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 122 transitions, 1156 flow
[2024-06-04 17:00:32,278 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 122 transitions, 1069 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-04 17:00:32,280 INFO  L231             Difference]: Finished difference. Result has 86 places, 96 transitions, 781 flow
[2024-06-04 17:00:32,280 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=781, PETRI_PLACES=86, PETRI_TRANSITIONS=96}
[2024-06-04 17:00:32,281 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places.
[2024-06-04 17:00:32,281 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 96 transitions, 781 flow
[2024-06-04 17:00:32,281 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-04 17:00:32,281 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:32,281 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:32,282 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 17:00:32,282 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:32,282 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:32,282 INFO  L85        PathProgramCache]: Analyzing trace with hash 1354377716, now seen corresponding path program 1 times
[2024-06-04 17:00:32,282 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:32,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037059916]
[2024-06-04 17:00:32,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:32,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:32,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:39,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:39,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:39,508 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037059916]
[2024-06-04 17:00:39,508 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037059916] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:39,508 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:39,508 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:00:39,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064913344]
[2024-06-04 17:00:39,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:39,509 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:00:39,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:39,509 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:00:39,509 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:00:39,590 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:00:39,590 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 96 transitions, 781 flow. Second operand  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:39,590 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:39,590 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:00:39,590 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:40,469 INFO  L124   PetriNetUnfolderBase]: 1500/2354 cut-off events.
[2024-06-04 17:00:40,469 INFO  L125   PetriNetUnfolderBase]: For 27386/27386 co-relation queries the response was YES.
[2024-06-04 17:00:40,474 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12258 conditions, 2354 events. 1500/2354 cut-off events. For 27386/27386 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11541 event pairs, 525 based on Foata normal form. 1/2354 useless extension candidates. Maximal degree in co-relation 12220. Up to 2226 conditions per place. 
[2024-06-04 17:00:40,481 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 90 selfloop transitions, 10 changer transitions 0/105 dead transitions.
[2024-06-04 17:00:40,482 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 105 transitions, 1014 flow
[2024-06-04 17:00:40,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:00:40,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:00:40,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-04 17:00:40,483 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4087301587301587
[2024-06-04 17:00:40,483 INFO  L175             Difference]: Start difference. First operand has 86 places, 96 transitions, 781 flow. Second operand 6 states and 103 transitions.
[2024-06-04 17:00:40,483 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 105 transitions, 1014 flow
[2024-06-04 17:00:40,495 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 105 transitions, 920 flow, removed 24 selfloop flow, removed 6 redundant places.
[2024-06-04 17:00:40,496 INFO  L231             Difference]: Finished difference. Result has 87 places, 98 transitions, 733 flow
[2024-06-04 17:00:40,497 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=733, PETRI_PLACES=87, PETRI_TRANSITIONS=98}
[2024-06-04 17:00:40,498 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places.
[2024-06-04 17:00:40,498 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 98 transitions, 733 flow
[2024-06-04 17:00:40,499 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:40,499 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:40,499 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:40,499 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 17:00:40,499 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:40,499 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:40,499 INFO  L85        PathProgramCache]: Analyzing trace with hash -1376433330, now seen corresponding path program 1 times
[2024-06-04 17:00:40,500 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:40,500 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855095919]
[2024-06-04 17:00:40,500 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:40,500 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:40,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:47,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:47,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:47,630 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855095919]
[2024-06-04 17:00:47,632 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855095919] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:47,632 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:47,633 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:00:47,633 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743241300]
[2024-06-04 17:00:47,633 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:47,634 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:00:47,635 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:47,635 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:00:47,635 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:00:47,753 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:00:47,753 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 98 transitions, 733 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:47,753 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:47,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:00:47,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:48,868 INFO  L124   PetriNetUnfolderBase]: 1709/2568 cut-off events.
[2024-06-04 17:00:48,868 INFO  L125   PetriNetUnfolderBase]: For 34700/34700 co-relation queries the response was YES.
[2024-06-04 17:00:48,873 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13614 conditions, 2568 events. 1709/2568 cut-off events. For 34700/34700 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12072 event pairs, 591 based on Foata normal form. 3/2570 useless extension candidates. Maximal degree in co-relation 13574. Up to 2450 conditions per place. 
[2024-06-04 17:00:48,879 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 108 selfloop transitions, 28 changer transitions 0/140 dead transitions.
[2024-06-04 17:00:48,880 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 140 transitions, 1315 flow
[2024-06-04 17:00:48,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:00:48,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:00:48,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-04 17:00:48,881 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-04 17:00:48,881 INFO  L175             Difference]: Start difference. First operand has 87 places, 98 transitions, 733 flow. Second operand 8 states and 155 transitions.
[2024-06-04 17:00:48,881 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 140 transitions, 1315 flow
[2024-06-04 17:00:48,892 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 140 transitions, 1290 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-04 17:00:48,893 INFO  L231             Difference]: Finished difference. Result has 93 places, 109 transitions, 940 flow
[2024-06-04 17:00:48,894 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=940, PETRI_PLACES=93, PETRI_TRANSITIONS=109}
[2024-06-04 17:00:48,894 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places.
[2024-06-04 17:00:48,894 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 109 transitions, 940 flow
[2024-06-04 17:00:48,894 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:48,895 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:48,895 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:48,895 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 17:00:48,895 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:48,895 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:48,895 INFO  L85        PathProgramCache]: Analyzing trace with hash 1921875879, now seen corresponding path program 1 times
[2024-06-04 17:00:48,895 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:48,896 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188585899]
[2024-06-04 17:00:48,896 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:48,896 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:48,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:00:56,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:00:56,165 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:00:56,165 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188585899]
[2024-06-04 17:00:56,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188585899] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:00:56,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:00:56,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:00:56,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870867461]
[2024-06-04 17:00:56,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:00:56,166 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:00:56,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:00:56,167 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:00:56,167 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:00:56,337 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:00:56,338 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 109 transitions, 940 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:56,338 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:00:56,338 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:00:56,338 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:00:57,462 INFO  L124   PetriNetUnfolderBase]: 1727/2603 cut-off events.
[2024-06-04 17:00:57,462 INFO  L125   PetriNetUnfolderBase]: For 41032/41032 co-relation queries the response was YES.
[2024-06-04 17:00:57,468 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14627 conditions, 2603 events. 1727/2603 cut-off events. For 41032/41032 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12344 event pairs, 557 based on Foata normal form. 3/2605 useless extension candidates. Maximal degree in co-relation 14585. Up to 2485 conditions per place. 
[2024-06-04 17:00:57,476 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 120 selfloop transitions, 26 changer transitions 0/150 dead transitions.
[2024-06-04 17:00:57,477 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 150 transitions, 1495 flow
[2024-06-04 17:00:57,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:00:57,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:00:57,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-04 17:00:57,478 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494047619047619
[2024-06-04 17:00:57,478 INFO  L175             Difference]: Start difference. First operand has 93 places, 109 transitions, 940 flow. Second operand 8 states and 151 transitions.
[2024-06-04 17:00:57,478 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 150 transitions, 1495 flow
[2024-06-04 17:00:57,496 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 150 transitions, 1402 flow, removed 38 selfloop flow, removed 3 redundant places.
[2024-06-04 17:00:57,498 INFO  L231             Difference]: Finished difference. Result has 100 places, 122 transitions, 1067 flow
[2024-06-04 17:00:57,499 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1067, PETRI_PLACES=100, PETRI_TRANSITIONS=122}
[2024-06-04 17:00:57,499 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places.
[2024-06-04 17:00:57,499 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 122 transitions, 1067 flow
[2024-06-04 17:00:57,499 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:00:57,499 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:00:57,500 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:00:57,500 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 17:00:57,500 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:00:57,500 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:00:57,500 INFO  L85        PathProgramCache]: Analyzing trace with hash -1169629943, now seen corresponding path program 2 times
[2024-06-04 17:00:57,500 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:00:57,501 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926652303]
[2024-06-04 17:00:57,501 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:00:57,501 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:00:57,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:03,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:01:03,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:03,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926652303]
[2024-06-04 17:01:03,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926652303] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:03,963 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:03,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:01:03,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842073672]
[2024-06-04 17:01:03,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:03,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:01:03,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:03,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:01:03,963 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:01:04,083 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:01:04,083 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 122 transitions, 1067 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:04,083 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:04,083 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:01:04,083 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:05,192 INFO  L124   PetriNetUnfolderBase]: 1763/2648 cut-off events.
[2024-06-04 17:01:05,193 INFO  L125   PetriNetUnfolderBase]: For 45954/45954 co-relation queries the response was YES.
[2024-06-04 17:01:05,199 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15586 conditions, 2648 events. 1763/2648 cut-off events. For 45954/45954 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12461 event pairs, 560 based on Foata normal form. 6/2652 useless extension candidates. Maximal degree in co-relation 15540. Up to 2283 conditions per place. 
[2024-06-04 17:01:05,208 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 84 selfloop transitions, 67 changer transitions 0/155 dead transitions.
[2024-06-04 17:01:05,208 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 155 transitions, 1601 flow
[2024-06-04 17:01:05,209 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:01:05,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:01:05,209 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-04 17:01:05,209 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-04 17:01:05,210 INFO  L175             Difference]: Start difference. First operand has 100 places, 122 transitions, 1067 flow. Second operand 8 states and 156 transitions.
[2024-06-04 17:01:05,210 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 155 transitions, 1601 flow
[2024-06-04 17:01:05,230 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 155 transitions, 1530 flow, removed 27 selfloop flow, removed 3 redundant places.
[2024-06-04 17:01:05,232 INFO  L231             Difference]: Finished difference. Result has 105 places, 127 transitions, 1226 flow
[2024-06-04 17:01:05,232 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1226, PETRI_PLACES=105, PETRI_TRANSITIONS=127}
[2024-06-04 17:01:05,232 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places.
[2024-06-04 17:01:05,232 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 127 transitions, 1226 flow
[2024-06-04 17:01:05,233 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:05,233 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:05,233 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:05,233 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 17:01:05,233 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:01:05,233 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:05,233 INFO  L85        PathProgramCache]: Analyzing trace with hash -2135273843, now seen corresponding path program 3 times
[2024-06-04 17:01:05,234 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:05,234 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366248911]
[2024-06-04 17:01:05,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:05,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:05,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:11,936 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:01:11,936 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:11,936 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366248911]
[2024-06-04 17:01:11,937 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366248911] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:11,937 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:11,937 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:01:11,937 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385589947]
[2024-06-04 17:01:11,937 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:11,939 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:01:11,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:11,940 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:01:11,940 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:01:12,112 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:01:12,114 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 127 transitions, 1226 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:12,114 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:12,114 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:01:12,114 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:13,183 INFO  L124   PetriNetUnfolderBase]: 1813/2725 cut-off events.
[2024-06-04 17:01:13,184 INFO  L125   PetriNetUnfolderBase]: For 52695/52703 co-relation queries the response was YES.
[2024-06-04 17:01:13,191 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17146 conditions, 2725 events. 1813/2725 cut-off events. For 52695/52703 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12944 event pairs, 538 based on Foata normal form. 6/2729 useless extension candidates. Maximal degree in co-relation 17098. Up to 2267 conditions per place. 
[2024-06-04 17:01:13,218 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 78 selfloop transitions, 83 changer transitions 0/165 dead transitions.
[2024-06-04 17:01:13,218 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 165 transitions, 1934 flow
[2024-06-04 17:01:13,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:01:13,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:01:13,222 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-04 17:01:13,223 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47023809523809523
[2024-06-04 17:01:13,223 INFO  L175             Difference]: Start difference. First operand has 105 places, 127 transitions, 1226 flow. Second operand 8 states and 158 transitions.
[2024-06-04 17:01:13,223 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 165 transitions, 1934 flow
[2024-06-04 17:01:13,249 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 165 transitions, 1738 flow, removed 34 selfloop flow, removed 6 redundant places.
[2024-06-04 17:01:13,253 INFO  L231             Difference]: Finished difference. Result has 108 places, 136 transitions, 1397 flow
[2024-06-04 17:01:13,254 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1397, PETRI_PLACES=108, PETRI_TRANSITIONS=136}
[2024-06-04 17:01:13,254 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places.
[2024-06-04 17:01:13,254 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 136 transitions, 1397 flow
[2024-06-04 17:01:13,254 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:13,254 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:13,254 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:13,255 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 17:01:13,255 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:01:13,255 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:13,255 INFO  L85        PathProgramCache]: Analyzing trace with hash -2142892403, now seen corresponding path program 4 times
[2024-06-04 17:01:13,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:13,255 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831563122]
[2024-06-04 17:01:13,256 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:13,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:13,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:19,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-04 17:01:19,653 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:19,653 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831563122]
[2024-06-04 17:01:19,653 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831563122] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:19,653 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:19,653 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:01:19,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636293490]
[2024-06-04 17:01:19,653 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:19,653 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:01:19,654 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:19,654 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:01:19,654 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:01:19,762 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:01:19,762 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 136 transitions, 1397 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:19,763 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:19,763 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:01:19,763 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:21,038 INFO  L124   PetriNetUnfolderBase]: 1825/2746 cut-off events.
[2024-06-04 17:01:21,038 INFO  L125   PetriNetUnfolderBase]: For 59122/59130 co-relation queries the response was YES.
[2024-06-04 17:01:21,047 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18183 conditions, 2746 events. 1825/2746 cut-off events. For 59122/59130 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13059 event pairs, 544 based on Foata normal form. 9/2753 useless extension candidates. Maximal degree in co-relation 18133. Up to 2372 conditions per place. 
[2024-06-04 17:01:21,058 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 108 selfloop transitions, 56 changer transitions 0/168 dead transitions.
[2024-06-04 17:01:21,058 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 168 transitions, 2021 flow
[2024-06-04 17:01:21,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:01:21,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:01:21,060 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-04 17:01:21,060 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-04 17:01:21,060 INFO  L175             Difference]: Start difference. First operand has 108 places, 136 transitions, 1397 flow. Second operand 8 states and 157 transitions.
[2024-06-04 17:01:21,060 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 168 transitions, 2021 flow
[2024-06-04 17:01:21,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 168 transitions, 1853 flow, removed 42 selfloop flow, removed 4 redundant places.
[2024-06-04 17:01:21,101 INFO  L231             Difference]: Finished difference. Result has 112 places, 140 transitions, 1447 flow
[2024-06-04 17:01:21,101 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1447, PETRI_PLACES=112, PETRI_TRANSITIONS=140}
[2024-06-04 17:01:21,101 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 69 predicate places.
[2024-06-04 17:01:21,101 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 140 transitions, 1447 flow
[2024-06-04 17:01:21,102 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:01:21,102 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:21,102 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:21,102 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 17:01:21,103 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:01:21,103 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:21,103 INFO  L85        PathProgramCache]: Analyzing trace with hash -963961832, now seen corresponding path program 1 times
[2024-06-04 17:01:21,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:21,103 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270601209]
[2024-06-04 17:01:21,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:21,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:21,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:32,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:01:32,577 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:32,577 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270601209]
[2024-06-04 17:01:32,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270601209] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:32,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:32,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:01:32,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092767742]
[2024-06-04 17:01:32,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:32,578 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:01:32,579 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:32,579 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:01:32,579 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:01:32,718 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:01:32,719 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 140 transitions, 1447 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-04 17:01:32,719 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:32,719 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:01:32,719 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:33,702 INFO  L124   PetriNetUnfolderBase]: 1612/2527 cut-off events.
[2024-06-04 17:01:33,702 INFO  L125   PetriNetUnfolderBase]: For 51862/51862 co-relation queries the response was YES.
[2024-06-04 17:01:33,709 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16672 conditions, 2527 events. 1612/2527 cut-off events. For 51862/51862 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12459 event pairs, 463 based on Foata normal form. 2/2528 useless extension candidates. Maximal degree in co-relation 16620. Up to 2382 conditions per place. 
[2024-06-04 17:01:33,717 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 135 selfloop transitions, 12 changer transitions 0/152 dead transitions.
[2024-06-04 17:01:33,718 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 152 transitions, 1793 flow
[2024-06-04 17:01:33,719 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:01:33,720 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:01:33,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-04 17:01:33,720 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4246031746031746
[2024-06-04 17:01:33,720 INFO  L175             Difference]: Start difference. First operand has 112 places, 140 transitions, 1447 flow. Second operand 6 states and 107 transitions.
[2024-06-04 17:01:33,720 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 152 transitions, 1793 flow
[2024-06-04 17:01:33,747 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 152 transitions, 1623 flow, removed 32 selfloop flow, removed 6 redundant places.
[2024-06-04 17:01:33,749 INFO  L231             Difference]: Finished difference. Result has 112 places, 143 transitions, 1343 flow
[2024-06-04 17:01:33,749 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1343, PETRI_PLACES=112, PETRI_TRANSITIONS=143}
[2024-06-04 17:01:33,749 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 69 predicate places.
[2024-06-04 17:01:33,749 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 143 transitions, 1343 flow
[2024-06-04 17:01:33,750 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-04 17:01:33,750 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:33,750 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:33,750 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 17:01:33,750 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:01:33,751 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:33,751 INFO  L85        PathProgramCache]: Analyzing trace with hash 868874853, now seen corresponding path program 1 times
[2024-06-04 17:01:33,751 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:33,752 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46643724]
[2024-06-04 17:01:33,752 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:33,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:33,795 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:41,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:01:41,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:41,178 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46643724]
[2024-06-04 17:01:41,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46643724] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:41,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:41,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:01:41,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223208347]
[2024-06-04 17:01:41,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:41,179 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:01:41,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:41,180 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:01:41,180 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:01:41,417 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:01:41,417 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 143 transitions, 1343 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-04 17:01:41,417 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:41,417 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:01:41,417 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:42,568 INFO  L124   PetriNetUnfolderBase]: 1752/2680 cut-off events.
[2024-06-04 17:01:42,568 INFO  L125   PetriNetUnfolderBase]: For 64114/64116 co-relation queries the response was YES.
[2024-06-04 17:01:42,575 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18134 conditions, 2680 events. 1752/2680 cut-off events. For 64114/64116 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13088 event pairs, 343 based on Foata normal form. 6/2685 useless extension candidates. Maximal degree in co-relation 18081. Up to 2393 conditions per place. 
[2024-06-04 17:01:42,586 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 133 selfloop transitions, 16 changer transitions 0/175 dead transitions.
[2024-06-04 17:01:42,586 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 175 transitions, 1777 flow
[2024-06-04 17:01:42,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:01:42,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:01:42,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 17:01:42,588 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-04 17:01:42,588 INFO  L175             Difference]: Start difference. First operand has 112 places, 143 transitions, 1343 flow. Second operand 8 states and 153 transitions.
[2024-06-04 17:01:42,588 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 175 transitions, 1777 flow
[2024-06-04 17:01:42,620 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 175 transitions, 1733 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-04 17:01:42,622 INFO  L231             Difference]: Finished difference. Result has 116 places, 145 transitions, 1398 flow
[2024-06-04 17:01:42,622 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1398, PETRI_PLACES=116, PETRI_TRANSITIONS=145}
[2024-06-04 17:01:42,622 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places.
[2024-06-04 17:01:42,622 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 145 transitions, 1398 flow
[2024-06-04 17:01:42,623 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-04 17:01:42,623 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:42,623 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:42,623 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 17:01:42,623 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:01:42,623 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:42,623 INFO  L85        PathProgramCache]: Analyzing trace with hash 871731813, now seen corresponding path program 2 times
[2024-06-04 17:01:42,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:42,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381710899]
[2024-06-04 17:01:42,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:42,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:42,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:49,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:01:49,617 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:49,617 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381710899]
[2024-06-04 17:01:49,617 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381710899] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:49,618 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:49,618 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:01:49,619 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422285495]
[2024-06-04 17:01:49,619 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:49,621 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:01:49,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:49,622 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:01:49,622 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:01:49,782 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:01:49,783 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 145 transitions, 1398 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-04 17:01:49,783 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:01:49,783 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:01:49,783 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:01:50,906 INFO  L124   PetriNetUnfolderBase]: 1769/2707 cut-off events.
[2024-06-04 17:01:50,907 INFO  L125   PetriNetUnfolderBase]: For 70276/70278 co-relation queries the response was YES.
[2024-06-04 17:01:50,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18688 conditions, 2707 events. 1769/2707 cut-off events. For 70276/70278 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13244 event pairs, 466 based on Foata normal form. 6/2712 useless extension candidates. Maximal degree in co-relation 18634. Up to 2446 conditions per place. 
[2024-06-04 17:01:50,927 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 133 selfloop transitions, 17 changer transitions 0/176 dead transitions.
[2024-06-04 17:01:50,927 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 176 transitions, 1836 flow
[2024-06-04 17:01:50,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:01:50,930 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:01:50,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 17:01:50,930 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-04 17:01:50,931 INFO  L175             Difference]: Start difference. First operand has 116 places, 145 transitions, 1398 flow. Second operand 8 states and 153 transitions.
[2024-06-04 17:01:50,931 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 176 transitions, 1836 flow
[2024-06-04 17:01:50,971 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 176 transitions, 1755 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-04 17:01:50,989 INFO  L231             Difference]: Finished difference. Result has 118 places, 147 transitions, 1422 flow
[2024-06-04 17:01:50,989 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1422, PETRI_PLACES=118, PETRI_TRANSITIONS=147}
[2024-06-04 17:01:50,990 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 75 predicate places.
[2024-06-04 17:01:50,990 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 147 transitions, 1422 flow
[2024-06-04 17:01:50,991 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-04 17:01:50,991 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:01:50,991 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:01:50,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 17:01:50,991 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:01:50,991 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:01:50,991 INFO  L85        PathProgramCache]: Analyzing trace with hash -556037465, now seen corresponding path program 1 times
[2024-06-04 17:01:50,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:01:50,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816470931]
[2024-06-04 17:01:50,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:01:50,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:01:51,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:01:59,909 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:01:59,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:01:59,909 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816470931]
[2024-06-04 17:01:59,909 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816470931] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:01:59,909 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:01:59,909 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:01:59,910 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122880574]
[2024-06-04 17:01:59,910 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:01:59,910 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:01:59,910 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:01:59,910 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:01:59,910 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:02:00,053 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:02:00,053 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 147 transitions, 1422 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:00,053 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:00,053 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:02:00,053 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:01,326 INFO  L124   PetriNetUnfolderBase]: 1868/2815 cut-off events.
[2024-06-04 17:02:01,326 INFO  L125   PetriNetUnfolderBase]: For 76757/76757 co-relation queries the response was YES.
[2024-06-04 17:02:01,350 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19618 conditions, 2815 events. 1868/2815 cut-off events. For 76757/76757 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13494 event pairs, 491 based on Foata normal form. 3/2817 useless extension candidates. Maximal degree in co-relation 19563. Up to 2672 conditions per place. 
[2024-06-04 17:02:01,359 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 150 selfloop transitions, 32 changer transitions 0/186 dead transitions.
[2024-06-04 17:02:01,360 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 186 transitions, 2102 flow
[2024-06-04 17:02:01,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:02:01,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:02:01,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-04 17:02:01,361 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-04 17:02:01,361 INFO  L175             Difference]: Start difference. First operand has 118 places, 147 transitions, 1422 flow. Second operand 9 states and 172 transitions.
[2024-06-04 17:02:01,361 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 186 transitions, 2102 flow
[2024-06-04 17:02:01,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 186 transitions, 2015 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-04 17:02:01,397 INFO  L231             Difference]: Finished difference. Result has 121 places, 151 transitions, 1502 flow
[2024-06-04 17:02:01,398 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1502, PETRI_PLACES=121, PETRI_TRANSITIONS=151}
[2024-06-04 17:02:01,398 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places.
[2024-06-04 17:02:01,398 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 151 transitions, 1502 flow
[2024-06-04 17:02:01,398 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:01,398 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:01,398 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:01,399 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 17:02:01,399 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:01,401 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:01,401 INFO  L85        PathProgramCache]: Analyzing trace with hash -551573775, now seen corresponding path program 3 times
[2024-06-04 17:02:01,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:01,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820346214]
[2024-06-04 17:02:01,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:01,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:01,457 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:08,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:02:08,797 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:08,797 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820346214]
[2024-06-04 17:02:08,797 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820346214] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:08,797 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:08,797 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:02:08,797 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731944424]
[2024-06-04 17:02:08,797 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:08,798 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:02:08,798 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:08,798 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:02:08,798 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:02:08,961 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:02:08,962 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 151 transitions, 1502 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-04 17:02:08,962 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:08,962 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:02:08,962 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:10,157 INFO  L124   PetriNetUnfolderBase]: 1804/2758 cut-off events.
[2024-06-04 17:02:10,157 INFO  L125   PetriNetUnfolderBase]: For 82114/82116 co-relation queries the response was YES.
[2024-06-04 17:02:10,165 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19528 conditions, 2758 events. 1804/2758 cut-off events. For 82114/82116 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13503 event pairs, 459 based on Foata normal form. 6/2763 useless extension candidates. Maximal degree in co-relation 19472. Up to 2502 conditions per place. 
[2024-06-04 17:02:10,175 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 137 selfloop transitions, 17 changer transitions 0/181 dead transitions.
[2024-06-04 17:02:10,175 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 181 transitions, 1955 flow
[2024-06-04 17:02:10,177 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:02:10,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:02:10,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-04 17:02:10,178 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-04 17:02:10,178 INFO  L175             Difference]: Start difference. First operand has 121 places, 151 transitions, 1502 flow. Second operand 8 states and 150 transitions.
[2024-06-04 17:02:10,178 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 181 transitions, 1955 flow
[2024-06-04 17:02:10,217 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 181 transitions, 1830 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-04 17:02:10,219 INFO  L231             Difference]: Finished difference. Result has 123 places, 155 transitions, 1505 flow
[2024-06-04 17:02:10,219 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1505, PETRI_PLACES=123, PETRI_TRANSITIONS=155}
[2024-06-04 17:02:10,219 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 80 predicate places.
[2024-06-04 17:02:10,220 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 155 transitions, 1505 flow
[2024-06-04 17:02:10,220 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-04 17:02:10,220 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:10,220 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:10,220 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 17:02:10,220 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:10,221 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:10,221 INFO  L85        PathProgramCache]: Analyzing trace with hash -551568815, now seen corresponding path program 2 times
[2024-06-04 17:02:10,221 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:10,221 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151038774]
[2024-06-04 17:02:10,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:10,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:10,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:18,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:02:18,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:18,599 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151038774]
[2024-06-04 17:02:18,599 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151038774] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:18,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:18,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:02:18,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558670050]
[2024-06-04 17:02:18,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:18,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:02:18,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:18,600 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:02:18,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:02:18,855 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:02:18,856 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 155 transitions, 1505 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:18,856 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:18,856 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:02:18,856 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:20,215 INFO  L124   PetriNetUnfolderBase]: 1921/2900 cut-off events.
[2024-06-04 17:02:20,216 INFO  L125   PetriNetUnfolderBase]: For 89114/89114 co-relation queries the response was YES.
[2024-06-04 17:02:20,226 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20605 conditions, 2900 events. 1921/2900 cut-off events. For 89114/89114 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13924 event pairs, 487 based on Foata normal form. 3/2902 useless extension candidates. Maximal degree in co-relation 20547. Up to 2722 conditions per place. 
[2024-06-04 17:02:20,238 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 154 selfloop transitions, 37 changer transitions 0/195 dead transitions.
[2024-06-04 17:02:20,239 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 195 transitions, 2245 flow
[2024-06-04 17:02:20,239 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:02:20,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:02:20,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-04 17:02:20,240 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-04 17:02:20,240 INFO  L175             Difference]: Start difference. First operand has 123 places, 155 transitions, 1505 flow. Second operand 9 states and 170 transitions.
[2024-06-04 17:02:20,240 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 195 transitions, 2245 flow
[2024-06-04 17:02:20,289 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 195 transitions, 2148 flow, removed 34 selfloop flow, removed 5 redundant places.
[2024-06-04 17:02:20,292 INFO  L231             Difference]: Finished difference. Result has 128 places, 163 transitions, 1633 flow
[2024-06-04 17:02:20,292 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1633, PETRI_PLACES=128, PETRI_TRANSITIONS=163}
[2024-06-04 17:02:20,292 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places.
[2024-06-04 17:02:20,292 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 163 transitions, 1633 flow
[2024-06-04 17:02:20,293 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:20,293 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:20,293 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:20,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 17:02:20,293 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:20,293 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:20,294 INFO  L85        PathProgramCache]: Analyzing trace with hash -551395835, now seen corresponding path program 3 times
[2024-06-04 17:02:20,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:20,294 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543747881]
[2024-06-04 17:02:20,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:20,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:20,353 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:28,495 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:02:28,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:28,495 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543747881]
[2024-06-04 17:02:28,496 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543747881] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:28,496 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:28,496 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:02:28,496 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206717824]
[2024-06-04 17:02:28,496 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:28,496 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:02:28,496 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:28,496 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:02:28,496 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:02:28,727 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:02:28,728 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 163 transitions, 1633 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:28,728 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:28,728 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:02:28,728 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:30,005 INFO  L124   PetriNetUnfolderBase]: 1915/2892 cut-off events.
[2024-06-04 17:02:30,005 INFO  L125   PetriNetUnfolderBase]: For 92606/92606 co-relation queries the response was YES.
[2024-06-04 17:02:30,014 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20659 conditions, 2892 events. 1915/2892 cut-off events. For 92606/92606 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13956 event pairs, 487 based on Foata normal form. 3/2894 useless extension candidates. Maximal degree in co-relation 20599. Up to 2714 conditions per place. 
[2024-06-04 17:02:30,026 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 151 selfloop transitions, 39 changer transitions 0/194 dead transitions.
[2024-06-04 17:02:30,026 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 194 transitions, 2197 flow
[2024-06-04 17:02:30,027 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:02:30,027 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:02:30,027 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-04 17:02:30,027 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-04 17:02:30,027 INFO  L175             Difference]: Start difference. First operand has 128 places, 163 transitions, 1633 flow. Second operand 9 states and 170 transitions.
[2024-06-04 17:02:30,028 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 194 transitions, 2197 flow
[2024-06-04 17:02:30,088 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 194 transitions, 2014 flow, removed 62 selfloop flow, removed 6 redundant places.
[2024-06-04 17:02:30,090 INFO  L231             Difference]: Finished difference. Result has 131 places, 163 transitions, 1537 flow
[2024-06-04 17:02:30,090 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1537, PETRI_PLACES=131, PETRI_TRANSITIONS=163}
[2024-06-04 17:02:30,091 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places.
[2024-06-04 17:02:30,091 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 163 transitions, 1537 flow
[2024-06-04 17:02:30,091 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:30,091 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:30,091 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:30,092 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 17:02:30,092 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:30,092 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:30,092 INFO  L85        PathProgramCache]: Analyzing trace with hash 284888657, now seen corresponding path program 4 times
[2024-06-04 17:02:30,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:30,093 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964262907]
[2024-06-04 17:02:30,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:30,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:30,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:37,398 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:02:37,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:37,398 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964262907]
[2024-06-04 17:02:37,399 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964262907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:37,399 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:37,399 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:02:37,399 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278468098]
[2024-06-04 17:02:37,399 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:37,399 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:02:37,400 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:37,400 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:02:37,400 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:02:37,551 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:02:37,552 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 163 transitions, 1537 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:37,552 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:37,552 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:02:37,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:38,951 INFO  L124   PetriNetUnfolderBase]: 1933/2926 cut-off events.
[2024-06-04 17:02:38,952 INFO  L125   PetriNetUnfolderBase]: For 97374/97374 co-relation queries the response was YES.
[2024-06-04 17:02:38,960 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20886 conditions, 2926 events. 1933/2926 cut-off events. For 97374/97374 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14164 event pairs, 480 based on Foata normal form. 3/2928 useless extension candidates. Maximal degree in co-relation 20826. Up to 2633 conditions per place. 
[2024-06-04 17:02:38,971 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 127 selfloop transitions, 67 changer transitions 0/198 dead transitions.
[2024-06-04 17:02:38,972 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 198 transitions, 2203 flow
[2024-06-04 17:02:38,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:02:38,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:02:38,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-04 17:02:38,973 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-04 17:02:38,973 INFO  L175             Difference]: Start difference. First operand has 131 places, 163 transitions, 1537 flow. Second operand 9 states and 172 transitions.
[2024-06-04 17:02:38,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 198 transitions, 2203 flow
[2024-06-04 17:02:39,016 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 198 transitions, 2019 flow, removed 26 selfloop flow, removed 10 redundant places.
[2024-06-04 17:02:39,019 INFO  L231             Difference]: Finished difference. Result has 130 places, 167 transitions, 1594 flow
[2024-06-04 17:02:39,019 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1353, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1594, PETRI_PLACES=130, PETRI_TRANSITIONS=167}
[2024-06-04 17:02:39,019 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 87 predicate places.
[2024-06-04 17:02:39,019 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 167 transitions, 1594 flow
[2024-06-04 17:02:39,020 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:39,020 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:39,020 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:39,020 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 17:02:39,020 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:39,020 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:39,021 INFO  L85        PathProgramCache]: Analyzing trace with hash -551389077, now seen corresponding path program 1 times
[2024-06-04 17:02:39,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:39,021 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892600953]
[2024-06-04 17:02:39,021 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:39,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:39,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:45,884 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:02:45,884 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:45,884 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892600953]
[2024-06-04 17:02:45,884 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892600953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:45,884 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:45,884 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:02:45,884 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915422188]
[2024-06-04 17:02:45,884 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:45,885 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:02:45,885 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:45,885 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:02:45,885 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:02:46,056 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:02:46,056 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 167 transitions, 1594 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:46,056 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:46,056 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:02:46,056 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:47,358 INFO  L124   PetriNetUnfolderBase]: 1961/2970 cut-off events.
[2024-06-04 17:02:47,358 INFO  L125   PetriNetUnfolderBase]: For 107214/107214 co-relation queries the response was YES.
[2024-06-04 17:02:47,367 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21684 conditions, 2970 events. 1961/2970 cut-off events. For 107214/107214 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14476 event pairs, 483 based on Foata normal form. 6/2975 useless extension candidates. Maximal degree in co-relation 21625. Up to 2809 conditions per place. 
[2024-06-04 17:02:47,379 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 168 selfloop transitions, 30 changer transitions 0/202 dead transitions.
[2024-06-04 17:02:47,380 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 202 transitions, 2264 flow
[2024-06-04 17:02:47,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:02:47,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:02:47,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions.
[2024-06-04 17:02:47,381 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-04 17:02:47,381 INFO  L175             Difference]: Start difference. First operand has 130 places, 167 transitions, 1594 flow. Second operand 9 states and 168 transitions.
[2024-06-04 17:02:47,381 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 202 transitions, 2264 flow
[2024-06-04 17:02:47,425 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 202 transitions, 2053 flow, removed 41 selfloop flow, removed 7 redundant places.
[2024-06-04 17:02:47,428 INFO  L231             Difference]: Finished difference. Result has 132 places, 170 transitions, 1537 flow
[2024-06-04 17:02:47,428 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1537, PETRI_PLACES=132, PETRI_TRANSITIONS=170}
[2024-06-04 17:02:47,429 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 89 predicate places.
[2024-06-04 17:02:47,429 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 170 transitions, 1537 flow
[2024-06-04 17:02:47,429 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:47,429 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:47,429 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:47,429 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 17:02:47,430 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:47,430 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:47,430 INFO  L85        PathProgramCache]: Analyzing trace with hash -345167695, now seen corresponding path program 1 times
[2024-06-04 17:02:47,430 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:47,430 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356717941]
[2024-06-04 17:02:47,430 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:47,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:47,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:02:55,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:02:55,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:02:55,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356717941]
[2024-06-04 17:02:55,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356717941] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:02:55,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:02:55,967 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:02:55,967 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089769949]
[2024-06-04 17:02:55,967 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:02:55,967 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:02:55,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:02:55,968 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:02:55,968 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:02:56,109 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:02:56,109 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 170 transitions, 1537 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:56,109 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:02:56,109 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:02:56,109 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:02:57,288 INFO  L124   PetriNetUnfolderBase]: 2011/3048 cut-off events.
[2024-06-04 17:02:57,288 INFO  L125   PetriNetUnfolderBase]: For 112435/112435 co-relation queries the response was YES.
[2024-06-04 17:02:57,296 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22405 conditions, 3048 events. 2011/3048 cut-off events. For 112435/112435 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14738 event pairs, 442 based on Foata normal form. 2/3049 useless extension candidates. Maximal degree in co-relation 22345. Up to 2900 conditions per place. 
[2024-06-04 17:02:57,307 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 167 selfloop transitions, 36 changer transitions 0/207 dead transitions.
[2024-06-04 17:02:57,307 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 207 transitions, 2347 flow
[2024-06-04 17:02:57,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:02:57,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:02:57,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions.
[2024-06-04 17:02:57,308 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4021164021164021
[2024-06-04 17:02:57,308 INFO  L175             Difference]: Start difference. First operand has 132 places, 170 transitions, 1537 flow. Second operand 9 states and 152 transitions.
[2024-06-04 17:02:57,308 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 207 transitions, 2347 flow
[2024-06-04 17:02:57,366 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 207 transitions, 2199 flow, removed 37 selfloop flow, removed 7 redundant places.
[2024-06-04 17:02:57,368 INFO  L231             Difference]: Finished difference. Result has 135 places, 187 transitions, 1680 flow
[2024-06-04 17:02:57,368 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1680, PETRI_PLACES=135, PETRI_TRANSITIONS=187}
[2024-06-04 17:02:57,369 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 92 predicate places.
[2024-06-04 17:02:57,369 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 187 transitions, 1680 flow
[2024-06-04 17:02:57,369 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:02:57,369 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:02:57,369 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:02:57,369 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 17:02:57,369 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:02:57,370 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:02:57,370 INFO  L85        PathProgramCache]: Analyzing trace with hash -2005338933, now seen corresponding path program 4 times
[2024-06-04 17:02:57,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:02:57,370 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851927456]
[2024-06-04 17:02:57,370 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:02:57,370 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:02:57,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:04,919 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:03:04,920 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:04,920 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851927456]
[2024-06-04 17:03:04,920 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851927456] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:04,920 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:04,920 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:03:04,920 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432200291]
[2024-06-04 17:03:04,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:04,921 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:03:04,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:04,921 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:03:04,921 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:03:05,148 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:03:05,148 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 187 transitions, 1680 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-04 17:03:05,148 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:05,148 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:03:05,148 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:06,401 INFO  L124   PetriNetUnfolderBase]: 1919/2957 cut-off events.
[2024-06-04 17:03:06,401 INFO  L125   PetriNetUnfolderBase]: For 116233/116247 co-relation queries the response was YES.
[2024-06-04 17:03:06,410 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21573 conditions, 2957 events. 1919/2957 cut-off events. For 116233/116247 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14694 event pairs, 398 based on Foata normal form. 18/2974 useless extension candidates. Maximal degree in co-relation 21511. Up to 2614 conditions per place. 
[2024-06-04 17:03:06,422 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 156 selfloop transitions, 25 changer transitions 0/216 dead transitions.
[2024-06-04 17:03:06,422 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 216 transitions, 2210 flow
[2024-06-04 17:03:06,424 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:03:06,424 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:03:06,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-04 17:03:06,425 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-04 17:03:06,425 INFO  L175             Difference]: Start difference. First operand has 135 places, 187 transitions, 1680 flow. Second operand 8 states and 150 transitions.
[2024-06-04 17:03:06,425 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 216 transitions, 2210 flow
[2024-06-04 17:03:06,484 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 216 transitions, 2154 flow, removed 14 selfloop flow, removed 2 redundant places.
[2024-06-04 17:03:06,486 INFO  L231             Difference]: Finished difference. Result has 142 places, 192 transitions, 1794 flow
[2024-06-04 17:03:06,486 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1794, PETRI_PLACES=142, PETRI_TRANSITIONS=192}
[2024-06-04 17:03:06,487 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 99 predicate places.
[2024-06-04 17:03:06,487 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 192 transitions, 1794 flow
[2024-06-04 17:03:06,487 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-04 17:03:06,487 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:06,487 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:06,488 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 17:03:06,488 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:06,488 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:06,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 193422507, now seen corresponding path program 5 times
[2024-06-04 17:03:06,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:06,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930771556]
[2024-06-04 17:03:06,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:06,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:06,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:15,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:03:15,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:15,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930771556]
[2024-06-04 17:03:15,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930771556] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:15,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:15,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:03:15,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042299405]
[2024-06-04 17:03:15,242 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:15,243 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:03:15,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:15,246 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:03:15,246 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:03:15,529 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:03:15,529 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 192 transitions, 1794 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:03:15,529 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:15,529 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:03:15,529 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:16,764 INFO  L124   PetriNetUnfolderBase]: 2029/3083 cut-off events.
[2024-06-04 17:03:16,764 INFO  L125   PetriNetUnfolderBase]: For 127337/127343 co-relation queries the response was YES.
[2024-06-04 17:03:16,774 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22972 conditions, 3083 events. 2029/3083 cut-off events. For 127337/127343 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15073 event pairs, 419 based on Foata normal form. 4/3085 useless extension candidates. Maximal degree in co-relation 22907. Up to 2466 conditions per place. 
[2024-06-04 17:03:16,787 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 105 selfloop transitions, 123 changer transitions 0/232 dead transitions.
[2024-06-04 17:03:16,787 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 232 transitions, 2810 flow
[2024-06-04 17:03:16,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:03:16,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:03:16,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-04 17:03:16,789 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46296296296296297
[2024-06-04 17:03:16,789 INFO  L175             Difference]: Start difference. First operand has 142 places, 192 transitions, 1794 flow. Second operand 9 states and 175 transitions.
[2024-06-04 17:03:16,789 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 232 transitions, 2810 flow
[2024-06-04 17:03:16,855 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 232 transitions, 2679 flow, removed 43 selfloop flow, removed 5 redundant places.
[2024-06-04 17:03:16,858 INFO  L231             Difference]: Finished difference. Result has 146 places, 200 transitions, 2134 flow
[2024-06-04 17:03:16,858 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2134, PETRI_PLACES=146, PETRI_TRANSITIONS=200}
[2024-06-04 17:03:16,859 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 103 predicate places.
[2024-06-04 17:03:16,859 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 200 transitions, 2134 flow
[2024-06-04 17:03:16,860 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:03:16,860 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:16,860 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:16,860 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 17:03:16,860 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:16,860 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:16,861 INFO  L85        PathProgramCache]: Analyzing trace with hash -379263193, now seen corresponding path program 2 times
[2024-06-04 17:03:16,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:16,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714117971]
[2024-06-04 17:03:16,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:16,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:16,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:24,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:03:24,672 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:24,672 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714117971]
[2024-06-04 17:03:24,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714117971] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:24,672 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:24,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:03:24,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534750190]
[2024-06-04 17:03:24,672 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:24,673 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:03:24,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:24,673 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:03:24,673 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:03:24,894 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:03:24,894 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 200 transitions, 2134 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:03:24,894 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:24,894 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:03:24,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:26,198 INFO  L124   PetriNetUnfolderBase]: 2057/3130 cut-off events.
[2024-06-04 17:03:26,198 INFO  L125   PetriNetUnfolderBase]: For 138251/138263 co-relation queries the response was YES.
[2024-06-04 17:03:26,208 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24204 conditions, 3130 events. 2057/3130 cut-off events. For 138251/138263 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15358 event pairs, 463 based on Foata normal form. 18/3147 useless extension candidates. Maximal degree in co-relation 24138. Up to 2633 conditions per place. 
[2024-06-04 17:03:26,221 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 140 selfloop transitions, 91 changer transitions 0/235 dead transitions.
[2024-06-04 17:03:26,221 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 235 transitions, 2933 flow
[2024-06-04 17:03:26,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:03:26,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:03:26,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-04 17:03:26,223 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-04 17:03:26,223 INFO  L175             Difference]: Start difference. First operand has 146 places, 200 transitions, 2134 flow. Second operand 9 states and 172 transitions.
[2024-06-04 17:03:26,223 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 235 transitions, 2933 flow
[2024-06-04 17:03:26,302 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 235 transitions, 2701 flow, removed 58 selfloop flow, removed 5 redundant places.
[2024-06-04 17:03:26,304 INFO  L231             Difference]: Finished difference. Result has 150 places, 203 transitions, 2192 flow
[2024-06-04 17:03:26,305 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2192, PETRI_PLACES=150, PETRI_TRANSITIONS=203}
[2024-06-04 17:03:26,305 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places.
[2024-06-04 17:03:26,305 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 203 transitions, 2192 flow
[2024-06-04 17:03:26,305 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:03:26,306 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:26,306 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:26,306 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 17:03:26,306 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:26,306 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:26,306 INFO  L85        PathProgramCache]: Analyzing trace with hash 1152846567, now seen corresponding path program 6 times
[2024-06-04 17:03:26,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:26,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849166842]
[2024-06-04 17:03:26,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:26,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:26,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:33,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:03:33,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:33,968 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849166842]
[2024-06-04 17:03:33,968 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849166842] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:33,968 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:33,968 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:03:33,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656342865]
[2024-06-04 17:03:33,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:33,969 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:03:33,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:33,969 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:03:33,969 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:03:34,101 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:03:34,101 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 203 transitions, 2192 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:03:34,101 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:34,101 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:03:34,101 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:35,454 INFO  L124   PetriNetUnfolderBase]: 2075/3156 cut-off events.
[2024-06-04 17:03:35,454 INFO  L125   PetriNetUnfolderBase]: For 142524/142530 co-relation queries the response was YES.
[2024-06-04 17:03:35,467 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24883 conditions, 3156 events. 2075/3156 cut-off events. For 142524/142530 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15450 event pairs, 419 based on Foata normal form. 4/3158 useless extension candidates. Maximal degree in co-relation 24815. Up to 2677 conditions per place. 
[2024-06-04 17:03:35,481 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 156 selfloop transitions, 78 changer transitions 0/238 dead transitions.
[2024-06-04 17:03:35,482 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 238 transitions, 3072 flow
[2024-06-04 17:03:35,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:03:35,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:03:35,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-04 17:03:35,483 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-04 17:03:35,483 INFO  L175             Difference]: Start difference. First operand has 150 places, 203 transitions, 2192 flow. Second operand 9 states and 165 transitions.
[2024-06-04 17:03:35,483 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 238 transitions, 3072 flow
[2024-06-04 17:03:35,573 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 238 transitions, 2810 flow, removed 42 selfloop flow, removed 7 redundant places.
[2024-06-04 17:03:35,575 INFO  L231             Difference]: Finished difference. Result has 152 places, 207 transitions, 2205 flow
[2024-06-04 17:03:35,576 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2205, PETRI_PLACES=152, PETRI_TRANSITIONS=207}
[2024-06-04 17:03:35,576 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places.
[2024-06-04 17:03:35,576 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 207 transitions, 2205 flow
[2024-06-04 17:03:35,577 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:03:35,577 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:35,577 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:35,577 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 17:03:35,577 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:35,577 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:35,577 INFO  L85        PathProgramCache]: Analyzing trace with hash -2126690197, now seen corresponding path program 3 times
[2024-06-04 17:03:35,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:35,578 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156261982]
[2024-06-04 17:03:35,578 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:35,578 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:35,614 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:42,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:03:42,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:42,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156261982]
[2024-06-04 17:03:42,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156261982] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:42,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:42,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:03:42,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682467529]
[2024-06-04 17:03:42,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:42,822 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:03:42,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:42,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:03:42,823 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:03:43,078 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:03:43,078 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 207 transitions, 2205 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:03:43,078 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:43,078 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:03:43,078 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:44,311 INFO  L124   PetriNetUnfolderBase]: 2103/3213 cut-off events.
[2024-06-04 17:03:44,311 INFO  L125   PetriNetUnfolderBase]: For 151841/151853 co-relation queries the response was YES.
[2024-06-04 17:03:44,321 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25177 conditions, 3213 events. 2103/3213 cut-off events. For 151841/151853 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15953 event pairs, 463 based on Foata normal form. 18/3230 useless extension candidates. Maximal degree in co-relation 25108. Up to 2917 conditions per place. 
[2024-06-04 17:03:44,334 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 203 selfloop transitions, 48 changer transitions 0/255 dead transitions.
[2024-06-04 17:03:44,334 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 255 transitions, 3259 flow
[2024-06-04 17:03:44,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:03:44,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:03:44,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-04 17:03:44,336 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4470899470899471
[2024-06-04 17:03:44,336 INFO  L175             Difference]: Start difference. First operand has 152 places, 207 transitions, 2205 flow. Second operand 9 states and 169 transitions.
[2024-06-04 17:03:44,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 255 transitions, 3259 flow
[2024-06-04 17:03:44,427 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 255 transitions, 3000 flow, removed 43 selfloop flow, removed 7 redundant places.
[2024-06-04 17:03:44,430 INFO  L231             Difference]: Finished difference. Result has 157 places, 223 transitions, 2361 flow
[2024-06-04 17:03:44,431 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2361, PETRI_PLACES=157, PETRI_TRANSITIONS=223}
[2024-06-04 17:03:44,431 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 114 predicate places.
[2024-06-04 17:03:44,431 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 223 transitions, 2361 flow
[2024-06-04 17:03:44,431 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:03:44,432 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:44,432 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:44,432 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 17:03:44,432 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:44,432 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:44,432 INFO  L85        PathProgramCache]: Analyzing trace with hash -379494081, now seen corresponding path program 7 times
[2024-06-04 17:03:44,432 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:44,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036003992]
[2024-06-04 17:03:44,433 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:44,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:44,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:03:54,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:03:54,693 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:03:54,693 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036003992]
[2024-06-04 17:03:54,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036003992] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:03:54,694 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:03:54,694 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:03:54,694 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644725260]
[2024-06-04 17:03:54,694 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:03:54,694 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:03:54,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:03:54,695 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:03:54,695 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:03:54,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:03:54,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 223 transitions, 2361 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:03:54,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:03:54,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:03:54,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:03:56,235 INFO  L124   PetriNetUnfolderBase]: 2097/3205 cut-off events.
[2024-06-04 17:03:56,235 INFO  L125   PetriNetUnfolderBase]: For 154812/154824 co-relation queries the response was YES.
[2024-06-04 17:03:56,245 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25274 conditions, 3205 events. 2097/3205 cut-off events. For 154812/154824 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15903 event pairs, 413 based on Foata normal form. 15/3219 useless extension candidates. Maximal degree in co-relation 25201. Up to 2799 conditions per place. 
[2024-06-04 17:03:56,260 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 176 selfloop transitions, 78 changer transitions 0/258 dead transitions.
[2024-06-04 17:03:56,261 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 258 transitions, 3126 flow
[2024-06-04 17:03:56,261 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:03:56,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:03:56,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-04 17:03:56,262 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-04 17:03:56,262 INFO  L175             Difference]: Start difference. First operand has 157 places, 223 transitions, 2361 flow. Second operand 10 states and 188 transitions.
[2024-06-04 17:03:56,262 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 258 transitions, 3126 flow
[2024-06-04 17:03:56,372 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 258 transitions, 2915 flow, removed 87 selfloop flow, removed 3 redundant places.
[2024-06-04 17:03:56,376 INFO  L231             Difference]: Finished difference. Result has 165 places, 225 transitions, 2352 flow
[2024-06-04 17:03:56,377 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2352, PETRI_PLACES=165, PETRI_TRANSITIONS=225}
[2024-06-04 17:03:56,377 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 122 predicate places.
[2024-06-04 17:03:56,377 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 225 transitions, 2352 flow
[2024-06-04 17:03:56,377 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:03:56,377 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:03:56,378 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:03:56,378 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 17:03:56,378 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:03:56,379 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:03:56,379 INFO  L85        PathProgramCache]: Analyzing trace with hash -1777253085, now seen corresponding path program 4 times
[2024-06-04 17:03:56,379 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:03:56,379 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539523341]
[2024-06-04 17:03:56,380 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:03:56,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:03:56,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:03,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:04:03,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:03,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539523341]
[2024-06-04 17:04:03,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539523341] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:03,319 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:03,320 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:04:03,320 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119066865]
[2024-06-04 17:04:03,320 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:03,320 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:04:03,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:03,320 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:04:03,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:04:03,471 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:04:03,472 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 225 transitions, 2352 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:04:03,472 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:03,472 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:04:03,472 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:04,738 INFO  L124   PetriNetUnfolderBase]: 2125/3249 cut-off events.
[2024-06-04 17:04:04,738 INFO  L125   PetriNetUnfolderBase]: For 161732/161744 co-relation queries the response was YES.
[2024-06-04 17:04:04,750 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25684 conditions, 3249 events. 2125/3249 cut-off events. For 161732/161744 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16135 event pairs, 418 based on Foata normal form. 18/3266 useless extension candidates. Maximal degree in co-relation 25608. Up to 2953 conditions per place. 
[2024-06-04 17:04:04,764 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 203 selfloop transitions, 54 changer transitions 0/261 dead transitions.
[2024-06-04 17:04:04,764 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 261 transitions, 3219 flow
[2024-06-04 17:04:04,765 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:04:04,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:04:04,765 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions.
[2024-06-04 17:04:04,766 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-04 17:04:04,766 INFO  L175             Difference]: Start difference. First operand has 165 places, 225 transitions, 2352 flow. Second operand 9 states and 168 transitions.
[2024-06-04 17:04:04,766 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 261 transitions, 3219 flow
[2024-06-04 17:04:04,851 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 261 transitions, 2859 flow, removed 33 selfloop flow, removed 9 redundant places.
[2024-06-04 17:04:04,854 INFO  L231             Difference]: Finished difference. Result has 166 places, 231 transitions, 2255 flow
[2024-06-04 17:04:04,855 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2004, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2255, PETRI_PLACES=166, PETRI_TRANSITIONS=231}
[2024-06-04 17:04:04,855 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 123 predicate places.
[2024-06-04 17:04:04,855 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 231 transitions, 2255 flow
[2024-06-04 17:04:04,855 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:04:04,855 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:04,855 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:04,856 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 17:04:04,856 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:04,856 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:04,856 INFO  L85        PathProgramCache]: Analyzing trace with hash -1768682205, now seen corresponding path program 5 times
[2024-06-04 17:04:04,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:04,856 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163202114]
[2024-06-04 17:04:04,857 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:04,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:04,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:11,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:04:11,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:11,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163202114]
[2024-06-04 17:04:11,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163202114] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:11,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:11,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:04:11,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857352056]
[2024-06-04 17:04:11,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:11,898 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:04:11,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:11,899 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:04:11,899 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:04:12,132 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:04:12,133 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 231 transitions, 2255 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:04:12,133 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:12,133 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:04:12,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:13,483 INFO  L124   PetriNetUnfolderBase]: 2128/3254 cut-off events.
[2024-06-04 17:04:13,483 INFO  L125   PetriNetUnfolderBase]: For 167897/167909 co-relation queries the response was YES.
[2024-06-04 17:04:13,494 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25332 conditions, 3254 events. 2128/3254 cut-off events. For 167897/167909 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16189 event pairs, 375 based on Foata normal form. 18/3271 useless extension candidates. Maximal degree in co-relation 25255. Up to 2768 conditions per place. 
[2024-06-04 17:04:13,507 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 178 selfloop transitions, 83 changer transitions 0/265 dead transitions.
[2024-06-04 17:04:13,508 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 265 transitions, 3112 flow
[2024-06-04 17:04:13,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:04:13,508 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:04:13,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-04 17:04:13,529 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-04 17:04:13,529 INFO  L175             Difference]: Start difference. First operand has 166 places, 231 transitions, 2255 flow. Second operand 9 states and 170 transitions.
[2024-06-04 17:04:13,529 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 265 transitions, 3112 flow
[2024-06-04 17:04:13,636 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 265 transitions, 2939 flow, removed 48 selfloop flow, removed 6 redundant places.
[2024-06-04 17:04:13,639 INFO  L231             Difference]: Finished difference. Result has 169 places, 234 transitions, 2368 flow
[2024-06-04 17:04:13,640 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2368, PETRI_PLACES=169, PETRI_TRANSITIONS=234}
[2024-06-04 17:04:13,640 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 126 predicate places.
[2024-06-04 17:04:13,640 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 234 transitions, 2368 flow
[2024-06-04 17:04:13,640 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:04:13,640 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:13,640 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:13,641 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 17:04:13,641 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:13,641 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:13,641 INFO  L85        PathProgramCache]: Analyzing trace with hash 181942355, now seen corresponding path program 2 times
[2024-06-04 17:04:13,641 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:13,641 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049379293]
[2024-06-04 17:04:13,642 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:13,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:13,673 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:21,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:04:21,435 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:21,435 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049379293]
[2024-06-04 17:04:21,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049379293] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:21,435 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:21,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:04:21,436 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279621092]
[2024-06-04 17:04:21,436 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:21,436 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:04:21,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:21,442 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:04:21,442 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:04:21,515 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:04:21,515 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 234 transitions, 2368 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:04:21,515 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:21,516 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:04:21,516 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:22,757 INFO  L124   PetriNetUnfolderBase]: 2122/3233 cut-off events.
[2024-06-04 17:04:22,757 INFO  L125   PetriNetUnfolderBase]: For 171542/171548 co-relation queries the response was YES.
[2024-06-04 17:04:22,770 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25505 conditions, 3233 events. 2122/3233 cut-off events. For 171542/171548 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15939 event pairs, 447 based on Foata normal form. 3/3234 useless extension candidates. Maximal degree in co-relation 25428. Up to 3075 conditions per place. 
[2024-06-04 17:04:22,784 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 207 selfloop transitions, 33 changer transitions 0/244 dead transitions.
[2024-06-04 17:04:22,785 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 244 transitions, 2959 flow
[2024-06-04 17:04:22,785 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:04:22,785 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:04:22,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-04 17:04:22,786 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4246031746031746
[2024-06-04 17:04:22,786 INFO  L175             Difference]: Start difference. First operand has 169 places, 234 transitions, 2368 flow. Second operand 6 states and 107 transitions.
[2024-06-04 17:04:22,786 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 244 transitions, 2959 flow
[2024-06-04 17:04:22,888 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 244 transitions, 2669 flow, removed 63 selfloop flow, removed 7 redundant places.
[2024-06-04 17:04:22,891 INFO  L231             Difference]: Finished difference. Result has 168 places, 234 transitions, 2154 flow
[2024-06-04 17:04:22,891 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2154, PETRI_PLACES=168, PETRI_TRANSITIONS=234}
[2024-06-04 17:04:22,892 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places.
[2024-06-04 17:04:22,892 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 234 transitions, 2154 flow
[2024-06-04 17:04:22,892 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:04:22,892 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:22,892 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:22,892 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 17:04:22,892 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:22,893 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:22,893 INFO  L85        PathProgramCache]: Analyzing trace with hash -1364431661, now seen corresponding path program 3 times
[2024-06-04 17:04:22,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:22,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942524912]
[2024-06-04 17:04:22,893 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:22,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:22,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:34,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:04:34,285 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:34,285 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942524912]
[2024-06-04 17:04:34,286 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942524912] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:34,286 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:34,286 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:04:34,286 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429896584]
[2024-06-04 17:04:34,286 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:34,286 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:04:34,286 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:34,287 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:04:34,287 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:04:34,367 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:04:34,368 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 234 transitions, 2154 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:04:34,368 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:34,368 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:04:34,368 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:35,558 INFO  L124   PetriNetUnfolderBase]: 2140/3267 cut-off events.
[2024-06-04 17:04:35,558 INFO  L125   PetriNetUnfolderBase]: For 173732/173734 co-relation queries the response was YES.
[2024-06-04 17:04:35,571 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25095 conditions, 3267 events. 2140/3267 cut-off events. For 173732/173734 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16201 event pairs, 429 based on Foata normal form. 4/3270 useless extension candidates. Maximal degree in co-relation 25017. Up to 3106 conditions per place. 
[2024-06-04 17:04:35,585 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 226 selfloop transitions, 34 changer transitions 0/264 dead transitions.
[2024-06-04 17:04:35,585 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 264 transitions, 2869 flow
[2024-06-04 17:04:35,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:04:35,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:04:35,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-04 17:04:35,586 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-04 17:04:35,586 INFO  L175             Difference]: Start difference. First operand has 168 places, 234 transitions, 2154 flow. Second operand 7 states and 127 transitions.
[2024-06-04 17:04:35,587 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 264 transitions, 2869 flow
[2024-06-04 17:04:35,675 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 264 transitions, 2749 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-04 17:04:35,678 INFO  L231             Difference]: Finished difference. Result has 171 places, 245 transitions, 2265 flow
[2024-06-04 17:04:35,679 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2056, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2265, PETRI_PLACES=171, PETRI_TRANSITIONS=245}
[2024-06-04 17:04:35,688 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 128 predicate places.
[2024-06-04 17:04:35,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 245 transitions, 2265 flow
[2024-06-04 17:04:35,689 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:04:35,689 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:35,689 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:35,689 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 17:04:35,690 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:35,690 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:35,690 INFO  L85        PathProgramCache]: Analyzing trace with hash 164760047, now seen corresponding path program 1 times
[2024-06-04 17:04:35,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:35,690 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224629939]
[2024-06-04 17:04:35,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:35,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:35,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:44,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:04:44,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:44,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224629939]
[2024-06-04 17:04:44,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224629939] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:44,163 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:44,163 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:04:44,164 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57593157]
[2024-06-04 17:04:44,164 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:44,164 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:04:44,164 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:44,164 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:04:44,164 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:04:44,273 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:04:44,274 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 245 transitions, 2265 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-04 17:04:44,274 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:44,274 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:04:44,274 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:45,283 INFO  L124   PetriNetUnfolderBase]: 1938/3060 cut-off events.
[2024-06-04 17:04:45,283 INFO  L125   PetriNetUnfolderBase]: For 150553/150555 co-relation queries the response was YES.
[2024-06-04 17:04:45,294 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22806 conditions, 3060 events. 1938/3060 cut-off events. For 150553/150555 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15689 event pairs, 373 based on Foata normal form. 2/3061 useless extension candidates. Maximal degree in co-relation 22726. Up to 2848 conditions per place. 
[2024-06-04 17:04:45,305 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 235 selfloop transitions, 20 changer transitions 0/260 dead transitions.
[2024-06-04 17:04:45,305 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 260 transitions, 2922 flow
[2024-06-04 17:04:45,306 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:04:45,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:04:45,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-04 17:04:45,306 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 17:04:45,306 INFO  L175             Difference]: Start difference. First operand has 171 places, 245 transitions, 2265 flow. Second operand 6 states and 114 transitions.
[2024-06-04 17:04:45,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 260 transitions, 2922 flow
[2024-06-04 17:04:45,414 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 260 transitions, 2885 flow, removed 1 selfloop flow, removed 4 redundant places.
[2024-06-04 17:04:45,417 INFO  L231             Difference]: Finished difference. Result has 173 places, 248 transitions, 2311 flow
[2024-06-04 17:04:45,417 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2311, PETRI_PLACES=173, PETRI_TRANSITIONS=248}
[2024-06-04 17:04:45,418 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places.
[2024-06-04 17:04:45,418 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 248 transitions, 2311 flow
[2024-06-04 17:04:45,418 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-04 17:04:45,418 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:45,418 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:45,418 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 17:04:45,418 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:45,419 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:45,419 INFO  L85        PathProgramCache]: Analyzing trace with hash 182294267, now seen corresponding path program 2 times
[2024-06-04 17:04:45,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:45,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720898748]
[2024-06-04 17:04:45,419 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:45,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:45,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:04:53,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:04:53,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:04:53,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720898748]
[2024-06-04 17:04:53,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720898748] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:04:53,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:04:53,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:04:53,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269032067]
[2024-06-04 17:04:53,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:04:53,643 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:04:53,643 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:04:53,644 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:04:53,644 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:04:53,793 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:04:53,794 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 248 transitions, 2311 flow. Second operand  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:04:53,794 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:04:53,794 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:04:53,794 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:04:54,769 INFO  L124   PetriNetUnfolderBase]: 1905/3006 cut-off events.
[2024-06-04 17:04:54,769 INFO  L125   PetriNetUnfolderBase]: For 154883/154885 co-relation queries the response was YES.
[2024-06-04 17:04:54,781 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22687 conditions, 3006 events. 1905/3006 cut-off events. For 154883/154885 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15327 event pairs, 371 based on Foata normal form. 1/3006 useless extension candidates. Maximal degree in co-relation 22607. Up to 2828 conditions per place. 
[2024-06-04 17:04:54,793 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 238 selfloop transitions, 13 changer transitions 0/256 dead transitions.
[2024-06-04 17:04:54,794 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 256 transitions, 2835 flow
[2024-06-04 17:04:54,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:04:54,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:04:54,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-04 17:04:54,844 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3979591836734694
[2024-06-04 17:04:54,844 INFO  L175             Difference]: Start difference. First operand has 173 places, 248 transitions, 2311 flow. Second operand 7 states and 117 transitions.
[2024-06-04 17:04:54,844 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 256 transitions, 2835 flow
[2024-06-04 17:04:54,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 256 transitions, 2804 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 17:04:54,969 INFO  L231             Difference]: Finished difference. Result has 177 places, 248 transitions, 2312 flow
[2024-06-04 17:04:54,969 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2312, PETRI_PLACES=177, PETRI_TRANSITIONS=248}
[2024-06-04 17:04:54,969 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places.
[2024-06-04 17:04:54,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 248 transitions, 2312 flow
[2024-06-04 17:04:54,970 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:04:54,970 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:04:54,970 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:04:54,970 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 17:04:54,970 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:04:54,971 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:04:54,971 INFO  L85        PathProgramCache]: Analyzing trace with hash -57297365, now seen corresponding path program 1 times
[2024-06-04 17:04:54,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:04:54,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631400816]
[2024-06-04 17:04:54,972 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:04:54,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:04:55,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:03,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:05:03,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:03,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631400816]
[2024-06-04 17:05:03,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631400816] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:03,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:03,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:05:03,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636999968]
[2024-06-04 17:05:03,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:03,108 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:05:03,108 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:03,109 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:05:03,109 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:05:03,372 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-04 17:05:03,373 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 248 transitions, 2312 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:03,373 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:03,373 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-04 17:05:03,373 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:04,731 INFO  L124   PetriNetUnfolderBase]: 2137/3266 cut-off events.
[2024-06-04 17:05:04,732 INFO  L125   PetriNetUnfolderBase]: For 197610/197618 co-relation queries the response was YES.
[2024-06-04 17:05:04,743 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25755 conditions, 3266 events. 2137/3266 cut-off events. For 197610/197618 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16216 event pairs, 428 based on Foata normal form. 14/3279 useless extension candidates. Maximal degree in co-relation 25674. Up to 3013 conditions per place. 
[2024-06-04 17:05:04,756 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 228 selfloop transitions, 53 changer transitions 0/285 dead transitions.
[2024-06-04 17:05:04,756 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 285 transitions, 3161 flow
[2024-06-04 17:05:04,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:05:04,757 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:05:04,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions.
[2024-06-04 17:05:04,757 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42592592592592593
[2024-06-04 17:05:04,757 INFO  L175             Difference]: Start difference. First operand has 177 places, 248 transitions, 2312 flow. Second operand 9 states and 161 transitions.
[2024-06-04 17:05:04,757 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 285 transitions, 3161 flow
[2024-06-04 17:05:04,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 285 transitions, 3110 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-04 17:05:04,863 INFO  L231             Difference]: Finished difference. Result has 179 places, 251 transitions, 2477 flow
[2024-06-04 17:05:04,864 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2477, PETRI_PLACES=179, PETRI_TRANSITIONS=251}
[2024-06-04 17:05:04,864 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 136 predicate places.
[2024-06-04 17:05:04,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 251 transitions, 2477 flow
[2024-06-04 17:05:04,864 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:04,865 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:04,865 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:05:04,865 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 17:05:04,865 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:05:04,865 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:04,865 INFO  L85        PathProgramCache]: Analyzing trace with hash 1253883183, now seen corresponding path program 2 times
[2024-06-04 17:05:04,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:04,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137725838]
[2024-06-04 17:05:04,866 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:04,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:04,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:11,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:05:11,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:11,623 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137725838]
[2024-06-04 17:05:11,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137725838] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:11,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:11,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:05:11,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922777114]
[2024-06-04 17:05:11,624 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:11,624 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:05:11,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:11,624 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:05:11,625 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:05:11,879 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:05:11,880 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 251 transitions, 2477 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:11,880 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:11,880 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:05:11,880 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:13,328 INFO  L124   PetriNetUnfolderBase]: 2281/3479 cut-off events.
[2024-06-04 17:05:13,329 INFO  L125   PetriNetUnfolderBase]: For 214825/214829 co-relation queries the response was YES.
[2024-06-04 17:05:13,340 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28139 conditions, 3479 events. 2281/3479 cut-off events. For 214825/214829 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17473 event pairs, 433 based on Foata normal form. 10/3488 useless extension candidates. Maximal degree in co-relation 28057. Up to 3153 conditions per place. 
[2024-06-04 17:05:13,353 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 246 selfloop transitions, 57 changer transitions 0/307 dead transitions.
[2024-06-04 17:05:13,353 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 307 transitions, 3785 flow
[2024-06-04 17:05:13,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:05:13,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:05:13,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions.
[2024-06-04 17:05:13,355 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-04 17:05:13,355 INFO  L175             Difference]: Start difference. First operand has 179 places, 251 transitions, 2477 flow. Second operand 10 states and 182 transitions.
[2024-06-04 17:05:13,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 307 transitions, 3785 flow
[2024-06-04 17:05:13,493 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 307 transitions, 3475 flow, removed 90 selfloop flow, removed 7 redundant places.
[2024-06-04 17:05:13,505 INFO  L231             Difference]: Finished difference. Result has 185 places, 269 transitions, 2742 flow
[2024-06-04 17:05:13,505 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2742, PETRI_PLACES=185, PETRI_TRANSITIONS=269}
[2024-06-04 17:05:13,505 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places.
[2024-06-04 17:05:13,506 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 269 transitions, 2742 flow
[2024-06-04 17:05:13,506 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:13,506 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:13,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-04 17:05:13,506 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 17:05:13,507 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:05:13,507 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:13,507 INFO  L85        PathProgramCache]: Analyzing trace with hash 1165317423, now seen corresponding path program 3 times
[2024-06-04 17:05:13,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:13,510 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68572155]
[2024-06-04 17:05:13,510 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:13,510 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:13,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:20,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:05:20,668 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:20,668 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68572155]
[2024-06-04 17:05:20,668 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68572155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:20,669 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:20,669 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:05:20,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395673563]
[2024-06-04 17:05:20,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:20,669 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:05:20,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:20,670 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:05:20,670 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:05:20,885 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:05:20,885 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 269 transitions, 2742 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:20,885 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:20,885 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:05:20,885 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:22,307 INFO  L124   PetriNetUnfolderBase]: 2383/3637 cut-off events.
[2024-06-04 17:05:22,307 INFO  L125   PetriNetUnfolderBase]: For 232266/232270 co-relation queries the response was YES.
[2024-06-04 17:05:22,320 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29723 conditions, 3637 events. 2383/3637 cut-off events. For 232266/232270 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 18449 event pairs, 445 based on Foata normal form. 10/3646 useless extension candidates. Maximal degree in co-relation 29637. Up to 3333 conditions per place. 
[2024-06-04 17:05:22,335 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 260 selfloop transitions, 51 changer transitions 0/315 dead transitions.
[2024-06-04 17:05:22,335 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 315 transitions, 3904 flow
[2024-06-04 17:05:22,336 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:05:22,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:05:22,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions.
[2024-06-04 17:05:22,337 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-04 17:05:22,337 INFO  L175             Difference]: Start difference. First operand has 185 places, 269 transitions, 2742 flow. Second operand 10 states and 182 transitions.
[2024-06-04 17:05:22,337 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 315 transitions, 3904 flow
[2024-06-04 17:05:22,488 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 315 transitions, 3765 flow, removed 59 selfloop flow, removed 3 redundant places.
[2024-06-04 17:05:22,492 INFO  L231             Difference]: Finished difference. Result has 194 places, 279 transitions, 2987 flow
[2024-06-04 17:05:22,492 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2603, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2987, PETRI_PLACES=194, PETRI_TRANSITIONS=279}
[2024-06-04 17:05:22,492 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-04 17:05:22,492 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 279 transitions, 2987 flow
[2024-06-04 17:05:22,492 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:22,493 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:22,493 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:05:22,493 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 17:05:22,493 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:05:22,493 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:22,493 INFO  L85        PathProgramCache]: Analyzing trace with hash 532945877, now seen corresponding path program 4 times
[2024-06-04 17:05:22,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:22,494 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260006438]
[2024-06-04 17:05:22,494 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:22,494 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:22,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:31,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:05:31,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:31,434 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260006438]
[2024-06-04 17:05:31,434 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260006438] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:31,434 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:31,434 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:05:31,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362217846]
[2024-06-04 17:05:31,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:31,435 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:05:31,436 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:31,436 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:05:31,436 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:05:31,652 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:05:31,652 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 279 transitions, 2987 flow. Second operand  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:31,652 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:31,652 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:05:31,652 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:33,230 INFO  L124   PetriNetUnfolderBase]: 2411/3685 cut-off events.
[2024-06-04 17:05:33,231 INFO  L125   PetriNetUnfolderBase]: For 246311/246319 co-relation queries the response was YES.
[2024-06-04 17:05:33,245 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30637 conditions, 3685 events. 2411/3685 cut-off events. For 246311/246319 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 18825 event pairs, 464 based on Foata normal form. 14/3698 useless extension candidates. Maximal degree in co-relation 30547. Up to 3430 conditions per place. 
[2024-06-04 17:05:33,261 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 265 selfloop transitions, 46 changer transitions 0/315 dead transitions.
[2024-06-04 17:05:33,261 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 315 transitions, 4008 flow
[2024-06-04 17:05:33,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:05:33,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:05:33,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-04 17:05:33,262 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4708994708994709
[2024-06-04 17:05:33,262 INFO  L175             Difference]: Start difference. First operand has 194 places, 279 transitions, 2987 flow. Second operand 9 states and 178 transitions.
[2024-06-04 17:05:33,263 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 315 transitions, 4008 flow
[2024-06-04 17:05:33,417 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 315 transitions, 3812 flow, removed 73 selfloop flow, removed 5 redundant places.
[2024-06-04 17:05:33,421 INFO  L231             Difference]: Finished difference. Result has 198 places, 282 transitions, 3013 flow
[2024-06-04 17:05:33,421 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2793, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3013, PETRI_PLACES=198, PETRI_TRANSITIONS=282}
[2024-06-04 17:05:33,422 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 155 predicate places.
[2024-06-04 17:05:33,422 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 282 transitions, 3013 flow
[2024-06-04 17:05:33,422 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:33,422 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:33,422 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:05:33,422 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 17:05:33,422 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:05:33,423 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:33,423 INFO  L85        PathProgramCache]: Analyzing trace with hash 81082915, now seen corresponding path program 5 times
[2024-06-04 17:05:33,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:33,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292289625]
[2024-06-04 17:05:33,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:33,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:33,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:41,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:05:41,460 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:41,460 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292289625]
[2024-06-04 17:05:41,460 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292289625] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:41,460 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:41,460 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:05:41,460 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311052666]
[2024-06-04 17:05:41,460 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:41,461 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:05:41,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:41,461 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:05:41,461 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:05:41,602 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:05:41,603 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 282 transitions, 3013 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:41,603 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:41,603 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:05:41,603 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:43,259 INFO  L124   PetriNetUnfolderBase]: 2490/3806 cut-off events.
[2024-06-04 17:05:43,260 INFO  L125   PetriNetUnfolderBase]: For 265608/265616 co-relation queries the response was YES.
[2024-06-04 17:05:43,277 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32373 conditions, 3806 events. 2490/3806 cut-off events. For 265608/265616 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19563 event pairs, 471 based on Foata normal form. 14/3819 useless extension candidates. Maximal degree in co-relation 32281. Up to 3434 conditions per place. 
[2024-06-04 17:05:43,294 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 272 selfloop transitions, 49 changer transitions 0/325 dead transitions.
[2024-06-04 17:05:43,295 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 325 transitions, 4388 flow
[2024-06-04 17:05:43,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:05:43,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:05:43,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-04 17:05:43,296 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-04 17:05:43,296 INFO  L175             Difference]: Start difference. First operand has 198 places, 282 transitions, 3013 flow. Second operand 9 states and 172 transitions.
[2024-06-04 17:05:43,296 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 325 transitions, 4388 flow
[2024-06-04 17:05:43,531 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 325 transitions, 4192 flow, removed 54 selfloop flow, removed 7 redundant places.
[2024-06-04 17:05:43,535 INFO  L231             Difference]: Finished difference. Result has 201 places, 288 transitions, 3147 flow
[2024-06-04 17:05:43,535 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2817, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3147, PETRI_PLACES=201, PETRI_TRANSITIONS=288}
[2024-06-04 17:05:43,535 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 158 predicate places.
[2024-06-04 17:05:43,535 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 288 transitions, 3147 flow
[2024-06-04 17:05:43,535 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:43,536 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:43,536 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:05:43,536 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 17:05:43,536 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:05:43,536 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:43,536 INFO  L85        PathProgramCache]: Analyzing trace with hash 86593165, now seen corresponding path program 6 times
[2024-06-04 17:05:43,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:43,537 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042146275]
[2024-06-04 17:05:43,537 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:43,537 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:43,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:05:50,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:05:50,998 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:05:50,998 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042146275]
[2024-06-04 17:05:50,998 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042146275] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:05:50,998 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:05:50,998 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:05:50,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798387936]
[2024-06-04 17:05:50,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:05:50,999 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:05:50,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:05:50,999 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:05:50,999 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:05:51,136 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:05:51,137 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 288 transitions, 3147 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:51,137 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:05:51,137 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:05:51,137 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:05:52,685 INFO  L124   PetriNetUnfolderBase]: 2493/3811 cut-off events.
[2024-06-04 17:05:52,686 INFO  L125   PetriNetUnfolderBase]: For 276213/276221 co-relation queries the response was YES.
[2024-06-04 17:05:52,706 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32618 conditions, 3811 events. 2493/3811 cut-off events. For 276213/276221 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19658 event pairs, 477 based on Foata normal form. 14/3824 useless extension candidates. Maximal degree in co-relation 32524. Up to 3556 conditions per place. 
[2024-06-04 17:05:52,725 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 271 selfloop transitions, 48 changer transitions 0/323 dead transitions.
[2024-06-04 17:05:52,725 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 323 transitions, 4108 flow
[2024-06-04 17:05:52,726 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:05:52,726 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:05:52,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-04 17:05:52,727 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4470899470899471
[2024-06-04 17:05:52,727 INFO  L175             Difference]: Start difference. First operand has 201 places, 288 transitions, 3147 flow. Second operand 9 states and 169 transitions.
[2024-06-04 17:05:52,727 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 323 transitions, 4108 flow
[2024-06-04 17:05:52,964 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 323 transitions, 3888 flow, removed 83 selfloop flow, removed 5 redundant places.
[2024-06-04 17:05:52,968 INFO  L231             Difference]: Finished difference. Result has 205 places, 291 transitions, 3165 flow
[2024-06-04 17:05:52,968 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2947, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3165, PETRI_PLACES=205, PETRI_TRANSITIONS=291}
[2024-06-04 17:05:52,968 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places.
[2024-06-04 17:05:52,968 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 291 transitions, 3165 flow
[2024-06-04 17:05:52,969 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:05:52,969 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:05:52,969 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:05:52,969 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 17:05:52,969 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:05:52,969 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:05:52,970 INFO  L85        PathProgramCache]: Analyzing trace with hash 1254037005, now seen corresponding path program 1 times
[2024-06-04 17:05:52,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:05:52,970 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870398018]
[2024-06-04 17:05:52,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:05:52,970 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:05:53,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:06:02,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:06:02,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:06:02,262 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870398018]
[2024-06-04 17:06:02,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870398018] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:06:02,262 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:06:02,262 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:06:02,262 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055592402]
[2024-06-04 17:06:02,262 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:06:02,263 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:06:02,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:06:02,263 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:06:02,263 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:06:02,552 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:06:02,552 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 291 transitions, 3165 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:06:02,552 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:06:02,552 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:06:02,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:06:04,279 INFO  L124   PetriNetUnfolderBase]: 2589/3981 cut-off events.
[2024-06-04 17:06:04,279 INFO  L125   PetriNetUnfolderBase]: For 318317/318325 co-relation queries the response was YES.
[2024-06-04 17:06:04,298 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34075 conditions, 3981 events. 2589/3981 cut-off events. For 318317/318325 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20950 event pairs, 449 based on Foata normal form. 32/4012 useless extension candidates. Maximal degree in co-relation 33979. Up to 3562 conditions per place. 
[2024-06-04 17:06:04,319 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 265 selfloop transitions, 65 changer transitions 0/334 dead transitions.
[2024-06-04 17:06:04,320 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 334 transitions, 4186 flow
[2024-06-04 17:06:04,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:06:04,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:06:04,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-04 17:06:04,321 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-04 17:06:04,321 INFO  L175             Difference]: Start difference. First operand has 205 places, 291 transitions, 3165 flow. Second operand 10 states and 189 transitions.
[2024-06-04 17:06:04,321 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 334 transitions, 4186 flow
[2024-06-04 17:06:04,563 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 334 transitions, 3998 flow, removed 48 selfloop flow, removed 7 redundant places.
[2024-06-04 17:06:04,566 INFO  L231             Difference]: Finished difference. Result has 208 places, 293 transitions, 3229 flow
[2024-06-04 17:06:04,567 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2977, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3229, PETRI_PLACES=208, PETRI_TRANSITIONS=293}
[2024-06-04 17:06:04,567 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 165 predicate places.
[2024-06-04 17:06:04,567 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 293 transitions, 3229 flow
[2024-06-04 17:06:04,567 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:06:04,568 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:06:04,568 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:06:04,568 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 17:06:04,568 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:06:04,568 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:06:04,568 INFO  L85        PathProgramCache]: Analyzing trace with hash 538667609, now seen corresponding path program 2 times
[2024-06-04 17:06:04,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:06:04,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823924731]
[2024-06-04 17:06:04,569 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:06:04,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:06:04,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:06:14,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:06:14,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:06:14,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823924731]
[2024-06-04 17:06:14,195 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823924731] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:06:14,195 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:06:14,195 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:06:14,195 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280628639]
[2024-06-04 17:06:14,196 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:06:14,196 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:06:14,196 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:06:14,196 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:06:14,196 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:06:14,403 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:06:14,403 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 293 transitions, 3229 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:06:14,403 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:06:14,403 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:06:14,403 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:06:16,291 INFO  L124   PetriNetUnfolderBase]: 2789/4315 cut-off events.
[2024-06-04 17:06:16,291 INFO  L125   PetriNetUnfolderBase]: For 364801/364809 co-relation queries the response was YES.
[2024-06-04 17:06:16,311 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38652 conditions, 4315 events. 2789/4315 cut-off events. For 364801/364809 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23326 event pairs, 520 based on Foata normal form. 26/4340 useless extension candidates. Maximal degree in co-relation 38555. Up to 3678 conditions per place. 
[2024-06-04 17:06:16,330 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 271 selfloop transitions, 66 changer transitions 0/341 dead transitions.
[2024-06-04 17:06:16,331 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 341 transitions, 4590 flow
[2024-06-04 17:06:16,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:06:16,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:06:16,332 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-04 17:06:16,332 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4595238095238095
[2024-06-04 17:06:16,332 INFO  L175             Difference]: Start difference. First operand has 208 places, 293 transitions, 3229 flow. Second operand 10 states and 193 transitions.
[2024-06-04 17:06:16,332 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 341 transitions, 4590 flow
[2024-06-04 17:06:16,613 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 341 transitions, 4388 flow, removed 38 selfloop flow, removed 8 redundant places.
[2024-06-04 17:06:16,617 INFO  L231             Difference]: Finished difference. Result has 210 places, 297 transitions, 3398 flow
[2024-06-04 17:06:16,618 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3027, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3398, PETRI_PLACES=210, PETRI_TRANSITIONS=297}
[2024-06-04 17:06:16,618 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places.
[2024-06-04 17:06:16,618 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 297 transitions, 3398 flow
[2024-06-04 17:06:16,618 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:06:16,619 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:06:16,619 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:06:16,619 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 17:06:16,619 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:06:16,619 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:06:16,619 INFO  L85        PathProgramCache]: Analyzing trace with hash 533095979, now seen corresponding path program 3 times
[2024-06-04 17:06:16,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:06:16,620 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741155287]
[2024-06-04 17:06:16,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:06:16,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:06:16,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:06:26,215 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:06:26,216 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:06:26,216 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741155287]
[2024-06-04 17:06:26,216 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741155287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:06:26,216 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:06:26,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:06:26,217 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891424483]
[2024-06-04 17:06:26,217 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:06:26,217 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:06:26,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:06:26,218 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:06:26,218 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:06:26,454 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:06:26,460 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 297 transitions, 3398 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:06:26,460 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:06:26,460 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:06:26,461 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:06:28,285 INFO  L124   PetriNetUnfolderBase]: 2953/4591 cut-off events.
[2024-06-04 17:06:28,285 INFO  L125   PetriNetUnfolderBase]: For 425978/425986 co-relation queries the response was YES.
[2024-06-04 17:06:28,309 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41201 conditions, 4591 events. 2953/4591 cut-off events. For 425978/425986 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 25407 event pairs, 592 based on Foata normal form. 50/4640 useless extension candidates. Maximal degree in co-relation 41103. Up to 4069 conditions per place. 
[2024-06-04 17:06:28,332 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 284 selfloop transitions, 53 changer transitions 0/341 dead transitions.
[2024-06-04 17:06:28,333 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 341 transitions, 4659 flow
[2024-06-04 17:06:28,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:06:28,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:06:28,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-04 17:06:28,334 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-04 17:06:28,334 INFO  L175             Difference]: Start difference. First operand has 210 places, 297 transitions, 3398 flow. Second operand 10 states and 189 transitions.
[2024-06-04 17:06:28,334 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 341 transitions, 4659 flow
[2024-06-04 17:06:28,768 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 341 transitions, 4477 flow, removed 51 selfloop flow, removed 6 redundant places.
[2024-06-04 17:06:28,772 INFO  L231             Difference]: Finished difference. Result has 214 places, 301 transitions, 3579 flow
[2024-06-04 17:06:28,773 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3224, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3579, PETRI_PLACES=214, PETRI_TRANSITIONS=301}
[2024-06-04 17:06:28,773 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 171 predicate places.
[2024-06-04 17:06:28,773 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 301 transitions, 3579 flow
[2024-06-04 17:06:28,774 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:06:28,774 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:06:28,774 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:06:28,774 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 17:06:28,774 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:06:28,774 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:06:28,775 INFO  L85        PathProgramCache]: Analyzing trace with hash 538660169, now seen corresponding path program 4 times
[2024-06-04 17:06:28,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:06:28,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003448177]
[2024-06-04 17:06:28,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:06:28,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:06:28,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:06:38,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:06:38,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:06:38,499 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003448177]
[2024-06-04 17:06:38,499 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003448177] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:06:38,499 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:06:38,499 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:06:38,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854317758]
[2024-06-04 17:06:38,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:06:38,499 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:06:38,500 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:06:38,500 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:06:38,500 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:06:38,721 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:06:38,721 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 301 transitions, 3579 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:06:38,721 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:06:38,721 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:06:38,721 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:06:40,615 INFO  L124   PetriNetUnfolderBase]: 3049/4745 cut-off events.
[2024-06-04 17:06:40,616 INFO  L125   PetriNetUnfolderBase]: For 424643/424645 co-relation queries the response was YES.
[2024-06-04 17:06:40,639 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42670 conditions, 4745 events. 3049/4745 cut-off events. For 424643/424645 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 26497 event pairs, 617 based on Foata normal form. 24/4768 useless extension candidates. Maximal degree in co-relation 42570. Up to 4177 conditions per place. 
[2024-06-04 17:06:40,662 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 238 selfloop transitions, 98 changer transitions 0/340 dead transitions.
[2024-06-04 17:06:40,663 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 340 transitions, 4603 flow
[2024-06-04 17:06:40,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:06:40,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:06:40,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-04 17:06:40,664 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 17:06:40,664 INFO  L175             Difference]: Start difference. First operand has 214 places, 301 transitions, 3579 flow. Second operand 10 states and 190 transitions.
[2024-06-04 17:06:40,664 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 340 transitions, 4603 flow
[2024-06-04 17:06:41,146 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 340 transitions, 4368 flow, removed 69 selfloop flow, removed 8 redundant places.
[2024-06-04 17:06:41,150 INFO  L231             Difference]: Finished difference. Result has 216 places, 303 transitions, 3666 flow
[2024-06-04 17:06:41,150 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3344, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3666, PETRI_PLACES=216, PETRI_TRANSITIONS=303}
[2024-06-04 17:06:41,150 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 173 predicate places.
[2024-06-04 17:06:41,151 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 303 transitions, 3666 flow
[2024-06-04 17:06:41,151 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:06:41,151 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:06:41,151 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:06:41,151 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 17:06:41,151 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:06:41,152 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:06:41,152 INFO  L85        PathProgramCache]: Analyzing trace with hash 538458359, now seen corresponding path program 5 times
[2024-06-04 17:06:41,152 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:06:41,152 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592383340]
[2024-06-04 17:06:41,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:06:41,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:06:41,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:06:51,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:06:51,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:06:51,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592383340]
[2024-06-04 17:06:51,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592383340] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:06:51,127 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:06:51,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:06:51,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123581168]
[2024-06-04 17:06:51,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:06:51,128 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:06:51,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:06:51,129 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:06:51,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:06:51,393 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:06:51,393 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 303 transitions, 3666 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:06:51,393 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:06:51,393 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:06:51,393 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:06:53,397 INFO  L124   PetriNetUnfolderBase]: 3081/4815 cut-off events.
[2024-06-04 17:06:53,397 INFO  L125   PetriNetUnfolderBase]: For 417508/417516 co-relation queries the response was YES.
[2024-06-04 17:06:53,420 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41611 conditions, 4815 events. 3081/4815 cut-off events. For 417508/417516 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 27102 event pairs, 614 based on Foata normal form. 50/4864 useless extension candidates. Maximal degree in co-relation 41510. Up to 4293 conditions per place. 
[2024-06-04 17:06:53,443 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 285 selfloop transitions, 55 changer transitions 0/344 dead transitions.
[2024-06-04 17:06:53,443 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 344 transitions, 4721 flow
[2024-06-04 17:06:53,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:06:53,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:06:53,444 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-04 17:06:53,444 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-04 17:06:53,444 INFO  L175             Difference]: Start difference. First operand has 216 places, 303 transitions, 3666 flow. Second operand 10 states and 189 transitions.
[2024-06-04 17:06:53,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 344 transitions, 4721 flow
[2024-06-04 17:06:53,893 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 344 transitions, 4385 flow, removed 72 selfloop flow, removed 8 redundant places.
[2024-06-04 17:06:53,897 INFO  L231             Difference]: Finished difference. Result has 218 places, 305 transitions, 3579 flow
[2024-06-04 17:06:53,897 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3330, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3579, PETRI_PLACES=218, PETRI_TRANSITIONS=305}
[2024-06-04 17:06:53,897 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 175 predicate places.
[2024-06-04 17:06:53,897 INFO  L495      AbstractCegarLoop]: Abstraction has has 218 places, 305 transitions, 3579 flow
[2024-06-04 17:06:53,898 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:06:53,898 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:06:53,898 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:06:53,898 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 17:06:53,898 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:06:53,898 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:06:53,898 INFO  L85        PathProgramCache]: Analyzing trace with hash -2110262021, now seen corresponding path program 1 times
[2024-06-04 17:06:53,899 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:06:53,899 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068716054]
[2024-06-04 17:06:53,899 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:06:53,899 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:06:53,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:07:06,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:07:06,779 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:07:06,779 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068716054]
[2024-06-04 17:07:06,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068716054] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:07:06,779 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:07:06,779 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:07:06,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684439302]
[2024-06-04 17:07:06,779 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:07:06,780 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:07:06,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:07:06,780 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:07:06,780 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:07:06,933 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:07:06,933 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 305 transitions, 3579 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:07:06,933 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:07:06,933 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:07:06,933 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:07:08,714 INFO  L124   PetriNetUnfolderBase]: 3091/4825 cut-off events.
[2024-06-04 17:07:08,714 INFO  L125   PetriNetUnfolderBase]: For 361454/361456 co-relation queries the response was YES.
[2024-06-04 17:07:08,737 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40650 conditions, 4825 events. 3091/4825 cut-off events. For 361454/361456 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 27089 event pairs, 617 based on Foata normal form. 2/4826 useless extension candidates. Maximal degree in co-relation 40548. Up to 4600 conditions per place. 
[2024-06-04 17:07:08,757 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 279 selfloop transitions, 51 changer transitions 0/334 dead transitions.
[2024-06-04 17:07:08,757 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 334 transitions, 4555 flow
[2024-06-04 17:07:08,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:07:08,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:07:08,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-04 17:07:08,758 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-04 17:07:08,758 INFO  L175             Difference]: Start difference. First operand has 218 places, 305 transitions, 3579 flow. Second operand 9 states and 153 transitions.
[2024-06-04 17:07:08,758 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 334 transitions, 4555 flow
[2024-06-04 17:07:09,154 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 334 transitions, 4362 flow, removed 45 selfloop flow, removed 8 redundant places.
[2024-06-04 17:07:09,158 INFO  L231             Difference]: Finished difference. Result has 220 places, 314 transitions, 3615 flow
[2024-06-04 17:07:09,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3388, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3615, PETRI_PLACES=220, PETRI_TRANSITIONS=314}
[2024-06-04 17:07:09,158 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places.
[2024-06-04 17:07:09,158 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 314 transitions, 3615 flow
[2024-06-04 17:07:09,158 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:07:09,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:07:09,159 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:07:09,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 17:07:09,159 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-04 17:07:09,159 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:07:09,159 INFO  L85        PathProgramCache]: Analyzing trace with hash -2030453773, now seen corresponding path program 7 times
[2024-06-04 17:07:09,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:07:09,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557364401]
[2024-06-04 17:07:09,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:07:09,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:07:09,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:07:16,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:07:16,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:07:16,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557364401]
[2024-06-04 17:07:16,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557364401] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:07:16,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:07:16,372 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:07:16,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877207978]
[2024-06-04 17:07:16,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:07:16,372 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:07:16,372 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:07:16,372 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:07:16,372 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:07:16,496 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:07:16,497 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 314 transitions, 3615 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:07:16,497 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:07:16,497 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:07:16,497 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:07:18,333 INFO  L124   PetriNetUnfolderBase]: 3137/4906 cut-off events.
[2024-06-04 17:07:18,333 INFO  L125   PetriNetUnfolderBase]: For 375406/375414 co-relation queries the response was YES.
[2024-06-04 17:07:18,353 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41092 conditions, 4906 events. 3137/4906 cut-off events. For 375406/375414 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 27725 event pairs, 612 based on Foata normal form. 14/4919 useless extension candidates. Maximal degree in co-relation 40988. Up to 4481 conditions per place. 
[2024-06-04 17:07:18,373 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 275 selfloop transitions, 73 changer transitions 0/352 dead transitions.
[2024-06-04 17:07:18,373 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 352 transitions, 4801 flow
[2024-06-04 17:07:18,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:07:18,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:07:18,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-04 17:07:18,374 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 17:07:18,374 INFO  L175             Difference]: Start difference. First operand has 220 places, 314 transitions, 3615 flow. Second operand 9 states and 171 transitions.
[2024-06-04 17:07:18,374 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 352 transitions, 4801 flow
[2024-06-04 17:07:18,735 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 352 transitions, 4710 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-04 17:07:18,739 INFO  L231             Difference]: Finished difference. Result has 224 places, 321 transitions, 3861 flow
[2024-06-04 17:07:18,739 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3524, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3861, PETRI_PLACES=224, PETRI_TRANSITIONS=321}
[2024-06-04 17:07:18,739 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 181 predicate places.
[2024-06-04 17:07:18,739 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 321 transitions, 3861 flow
[2024-06-04 17:07:18,739 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:07:18,740 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:07:18,740 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:07:18,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 17:07:18,740 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:07:18,740 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:07:18,740 INFO  L85        PathProgramCache]: Analyzing trace with hash -2035816153, now seen corresponding path program 8 times
[2024-06-04 17:07:18,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:07:18,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731051882]
[2024-06-04 17:07:18,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:07:18,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:07:18,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:07:26,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:07:26,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:07:26,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731051882]
[2024-06-04 17:07:26,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731051882] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:07:26,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:07:26,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:07:26,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817084992]
[2024-06-04 17:07:26,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:07:26,485 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:07:26,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:07:26,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:07:26,486 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:07:26,668 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:07:26,668 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 321 transitions, 3861 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:07:26,668 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:07:26,668 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:07:26,668 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:07:28,669 INFO  L124   PetriNetUnfolderBase]: 3165/4960 cut-off events.
[2024-06-04 17:07:28,670 INFO  L125   PetriNetUnfolderBase]: For 391038/391046 co-relation queries the response was YES.
[2024-06-04 17:07:28,697 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42177 conditions, 4960 events. 3165/4960 cut-off events. For 391038/391046 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 28131 event pairs, 621 based on Foata normal form. 14/4973 useless extension candidates. Maximal degree in co-relation 42072. Up to 4525 conditions per place. 
[2024-06-04 17:07:28,721 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 280 selfloop transitions, 72 changer transitions 0/356 dead transitions.
[2024-06-04 17:07:28,721 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 356 transitions, 5144 flow
[2024-06-04 17:07:28,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:07:28,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:07:28,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-04 17:07:28,722 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 17:07:28,722 INFO  L175             Difference]: Start difference. First operand has 224 places, 321 transitions, 3861 flow. Second operand 9 states and 171 transitions.
[2024-06-04 17:07:28,722 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 356 transitions, 5144 flow
[2024-06-04 17:07:29,159 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 356 transitions, 4860 flow, removed 72 selfloop flow, removed 6 redundant places.
[2024-06-04 17:07:29,163 INFO  L231             Difference]: Finished difference. Result has 227 places, 324 transitions, 3885 flow
[2024-06-04 17:07:29,164 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3577, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3885, PETRI_PLACES=227, PETRI_TRANSITIONS=324}
[2024-06-04 17:07:29,164 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 184 predicate places.
[2024-06-04 17:07:29,164 INFO  L495      AbstractCegarLoop]: Abstraction has has 227 places, 324 transitions, 3885 flow
[2024-06-04 17:07:29,164 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:07:29,165 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:07:29,165 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:07:29,165 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 17:07:29,165 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:07:29,166 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:07:29,166 INFO  L85        PathProgramCache]: Analyzing trace with hash 1266867055, now seen corresponding path program 9 times
[2024-06-04 17:07:29,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:07:29,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968396493]
[2024-06-04 17:07:29,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:07:29,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:07:29,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:07:36,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:07:36,713 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:07:36,713 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968396493]
[2024-06-04 17:07:36,713 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968396493] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:07:36,713 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:07:36,713 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:07:36,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709054984]
[2024-06-04 17:07:36,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:07:36,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:07:36,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:07:36,714 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:07:36,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:07:36,905 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:07:36,928 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 324 transitions, 3885 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:07:36,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:07:36,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:07:36,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:07:38,853 INFO  L124   PetriNetUnfolderBase]: 3190/4989 cut-off events.
[2024-06-04 17:07:38,853 INFO  L125   PetriNetUnfolderBase]: For 406682/406690 co-relation queries the response was YES.
[2024-06-04 17:07:38,875 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42671 conditions, 4989 events. 3190/4989 cut-off events. For 406682/406690 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 28288 event pairs, 617 based on Foata normal form. 14/5002 useless extension candidates. Maximal degree in co-relation 42565. Up to 4566 conditions per place. 
[2024-06-04 17:07:38,896 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 270 selfloop transitions, 83 changer transitions 0/357 dead transitions.
[2024-06-04 17:07:38,896 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 357 transitions, 4954 flow
[2024-06-04 17:07:38,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:07:38,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:07:38,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-04 17:07:38,897 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4470899470899471
[2024-06-04 17:07:38,898 INFO  L175             Difference]: Start difference. First operand has 227 places, 324 transitions, 3885 flow. Second operand 9 states and 169 transitions.
[2024-06-04 17:07:38,898 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 357 transitions, 4954 flow
[2024-06-04 17:07:39,335 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 357 transitions, 4649 flow, removed 78 selfloop flow, removed 8 redundant places.
[2024-06-04 17:07:39,339 INFO  L231             Difference]: Finished difference. Result has 228 places, 327 transitions, 3916 flow
[2024-06-04 17:07:39,340 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3580, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3916, PETRI_PLACES=228, PETRI_TRANSITIONS=327}
[2024-06-04 17:07:39,340 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-04 17:07:39,340 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 327 transitions, 3916 flow
[2024-06-04 17:07:39,341 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:07:39,341 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:07:39,341 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:07:39,341 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 17:07:39,341 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:07:39,341 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:07:39,341 INFO  L85        PathProgramCache]: Analyzing trace with hash -1508611549, now seen corresponding path program 10 times
[2024-06-04 17:07:39,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:07:39,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579941471]
[2024-06-04 17:07:39,342 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:07:39,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:07:39,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:07:46,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:07:46,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:07:46,722 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579941471]
[2024-06-04 17:07:46,723 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579941471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:07:46,723 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:07:46,723 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:07:46,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56794008]
[2024-06-04 17:07:46,723 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:07:46,723 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:07:46,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:07:46,724 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:07:46,724 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:07:46,978 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:07:46,978 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 327 transitions, 3916 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:07:46,978 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:07:46,978 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:07:46,978 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:07:48,851 INFO  L124   PetriNetUnfolderBase]: 3244/5071 cut-off events.
[2024-06-04 17:07:48,852 INFO  L125   PetriNetUnfolderBase]: For 432070/432078 co-relation queries the response was YES.
[2024-06-04 17:07:48,879 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43965 conditions, 5071 events. 3244/5071 cut-off events. For 432070/432078 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 28780 event pairs, 625 based on Foata normal form. 14/5084 useless extension candidates. Maximal degree in co-relation 43860. Up to 4504 conditions per place. 
[2024-06-04 17:07:48,904 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 284 selfloop transitions, 79 changer transitions 0/367 dead transitions.
[2024-06-04 17:07:48,905 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 367 transitions, 5473 flow
[2024-06-04 17:07:48,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:07:48,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:07:48,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-04 17:07:48,906 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4576719576719577
[2024-06-04 17:07:48,906 INFO  L175             Difference]: Start difference. First operand has 228 places, 327 transitions, 3916 flow. Second operand 9 states and 173 transitions.
[2024-06-04 17:07:48,906 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 367 transitions, 5473 flow
[2024-06-04 17:07:49,393 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 367 transitions, 5161 flow, removed 75 selfloop flow, removed 7 redundant places.
[2024-06-04 17:07:49,398 INFO  L231             Difference]: Finished difference. Result has 231 places, 333 transitions, 4067 flow
[2024-06-04 17:07:49,398 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3604, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4067, PETRI_PLACES=231, PETRI_TRANSITIONS=333}
[2024-06-04 17:07:49,398 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places.
[2024-06-04 17:07:49,399 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 333 transitions, 4067 flow
[2024-06-04 17:07:49,399 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:07:49,399 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:07:49,399 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:07:49,399 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 17:07:49,399 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:07:49,400 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:07:49,400 INFO  L85        PathProgramCache]: Analyzing trace with hash -1503095347, now seen corresponding path program 6 times
[2024-06-04 17:07:49,400 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:07:49,400 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219111866]
[2024-06-04 17:07:49,400 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:07:49,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:07:49,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:07:58,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:07:58,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:07:58,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219111866]
[2024-06-04 17:07:58,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219111866] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:07:58,417 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:07:58,417 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:07:58,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688009716]
[2024-06-04 17:07:58,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:07:58,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:07:58,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:07:58,418 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:07:58,418 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:07:58,657 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:07:58,658 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 333 transitions, 4067 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:07:58,658 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:07:58,658 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:07:58,658 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:08:00,691 INFO  L124   PetriNetUnfolderBase]: 3358/5250 cut-off events.
[2024-06-04 17:08:00,692 INFO  L125   PetriNetUnfolderBase]: For 489724/489726 co-relation queries the response was YES.
[2024-06-04 17:08:00,719 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46298 conditions, 5250 events. 3358/5250 cut-off events. For 489724/489726 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 30047 event pairs, 667 based on Foata normal form. 24/5273 useless extension candidates. Maximal degree in co-relation 46191. Up to 4547 conditions per place. 
[2024-06-04 17:08:00,744 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 264 selfloop transitions, 107 changer transitions 0/375 dead transitions.
[2024-06-04 17:08:00,744 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 375 transitions, 5347 flow
[2024-06-04 17:08:00,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:08:00,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:08:00,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions.
[2024-06-04 17:08:00,745 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45714285714285713
[2024-06-04 17:08:00,746 INFO  L175             Difference]: Start difference. First operand has 231 places, 333 transitions, 4067 flow. Second operand 10 states and 192 transitions.
[2024-06-04 17:08:00,746 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 375 transitions, 5347 flow
[2024-06-04 17:08:01,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 375 transitions, 5065 flow, removed 99 selfloop flow, removed 5 redundant places.
[2024-06-04 17:08:01,219 INFO  L231             Difference]: Finished difference. Result has 237 places, 339 transitions, 4199 flow
[2024-06-04 17:08:01,220 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3785, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4199, PETRI_PLACES=237, PETRI_TRANSITIONS=339}
[2024-06-04 17:08:01,220 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 194 predicate places.
[2024-06-04 17:08:01,220 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 339 transitions, 4199 flow
[2024-06-04 17:08:01,221 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:08:01,221 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:08:01,221 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:08:01,221 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 17:08:01,221 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:08:01,221 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:08:01,221 INFO  L85        PathProgramCache]: Analyzing trace with hash -2035810201, now seen corresponding path program 7 times
[2024-06-04 17:08:01,222 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:08:01,222 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575871757]
[2024-06-04 17:08:01,222 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:08:01,222 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:08:01,278 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:08:10,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:08:10,732 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:08:10,732 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575871757]
[2024-06-04 17:08:10,732 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575871757] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:08:10,732 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:08:10,732 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:08:10,733 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650260713]
[2024-06-04 17:08:10,733 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:08:10,733 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:08:10,733 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:08:10,733 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:08:10,733 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:08:10,957 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:08:10,957 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 339 transitions, 4199 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:08:10,957 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:08:10,957 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:08:10,957 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:08:13,396 INFO  L124   PetriNetUnfolderBase]: 3454/5427 cut-off events.
[2024-06-04 17:08:13,397 INFO  L125   PetriNetUnfolderBase]: For 515586/515594 co-relation queries the response was YES.
[2024-06-04 17:08:13,421 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48426 conditions, 5427 events. 3454/5427 cut-off events. For 515586/515594 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 31520 event pairs, 676 based on Foata normal form. 32/5458 useless extension candidates. Maximal degree in co-relation 48316. Up to 4869 conditions per place. 
[2024-06-04 17:08:13,445 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 301 selfloop transitions, 75 changer transitions 0/380 dead transitions.
[2024-06-04 17:08:13,445 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 380 transitions, 5600 flow
[2024-06-04 17:08:13,446 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:08:13,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:08:13,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-04 17:08:13,447 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 17:08:13,447 INFO  L175             Difference]: Start difference. First operand has 237 places, 339 transitions, 4199 flow. Second operand 10 states and 190 transitions.
[2024-06-04 17:08:13,447 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 380 transitions, 5600 flow
[2024-06-04 17:08:13,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 380 transitions, 5292 flow, removed 53 selfloop flow, removed 7 redundant places.
[2024-06-04 17:08:13,820 INFO  L231             Difference]: Finished difference. Result has 240 places, 341 transitions, 4199 flow
[2024-06-04 17:08:13,820 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3891, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4199, PETRI_PLACES=240, PETRI_TRANSITIONS=341}
[2024-06-04 17:08:13,821 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places.
[2024-06-04 17:08:13,821 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 341 transitions, 4199 flow
[2024-06-04 17:08:13,821 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:08:13,821 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:08:13,821 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:08:13,822 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 17:08:13,822 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:08:13,822 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:08:13,822 INFO  L85        PathProgramCache]: Analyzing trace with hash -2030238571, now seen corresponding path program 8 times
[2024-06-04 17:08:13,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:08:13,822 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131679436]
[2024-06-04 17:08:13,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:08:13,823 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:08:13,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:08:22,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:08:22,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:08:22,343 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131679436]
[2024-06-04 17:08:22,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131679436] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:08:22,344 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:08:22,344 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:08:22,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902070996]
[2024-06-04 17:08:22,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:08:22,344 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:08:22,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:08:22,345 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:08:22,345 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:08:22,663 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:08:22,664 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 341 transitions, 4199 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:08:22,664 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:08:22,664 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:08:22,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:08:24,940 INFO  L124   PetriNetUnfolderBase]: 3722/5877 cut-off events.
[2024-06-04 17:08:24,940 INFO  L125   PetriNetUnfolderBase]: For 593277/593285 co-relation queries the response was YES.
[2024-06-04 17:08:24,971 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53762 conditions, 5877 events. 3722/5877 cut-off events. For 593277/593285 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 34915 event pairs, 721 based on Foata normal form. 26/5902 useless extension candidates. Maximal degree in co-relation 53651. Up to 4830 conditions per place. 
[2024-06-04 17:08:24,997 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 291 selfloop transitions, 95 changer transitions 0/390 dead transitions.
[2024-06-04 17:08:24,997 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 390 transitions, 5960 flow
[2024-06-04 17:08:24,998 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:08:24,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:08:24,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions.
[2024-06-04 17:08:24,999 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4880952380952381
[2024-06-04 17:08:24,999 INFO  L175             Difference]: Start difference. First operand has 240 places, 341 transitions, 4199 flow. Second operand 10 states and 205 transitions.
[2024-06-04 17:08:24,999 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 390 transitions, 5960 flow
[2024-06-04 17:08:25,527 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 390 transitions, 5670 flow, removed 62 selfloop flow, removed 10 redundant places.
[2024-06-04 17:08:25,531 INFO  L231             Difference]: Finished difference. Result has 241 places, 347 transitions, 4476 flow
[2024-06-04 17:08:25,531 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3909, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4476, PETRI_PLACES=241, PETRI_TRANSITIONS=347}
[2024-06-04 17:08:25,533 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 198 predicate places.
[2024-06-04 17:08:25,533 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 347 transitions, 4476 flow
[2024-06-04 17:08:25,533 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:08:25,533 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:08:25,533 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:08:25,534 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-04 17:08:25,534 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:08:25,534 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:08:25,534 INFO  L85        PathProgramCache]: Analyzing trace with hash -2030246011, now seen corresponding path program 9 times
[2024-06-04 17:08:25,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:08:25,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865284979]
[2024-06-04 17:08:25,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:08:25,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:08:25,613 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:08:35,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:08:35,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:08:35,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865284979]
[2024-06-04 17:08:35,555 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865284979] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:08:35,555 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:08:35,555 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:08:35,555 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155386995]
[2024-06-04 17:08:35,555 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:08:35,556 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:08:35,556 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:08:35,556 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:08:35,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:08:35,747 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:08:35,747 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 347 transitions, 4476 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:08:35,747 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:08:35,747 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:08:35,747 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:08:37,941 INFO  L124   PetriNetUnfolderBase]: 3686/5835 cut-off events.
[2024-06-04 17:08:37,941 INFO  L125   PetriNetUnfolderBase]: For 561760/561768 co-relation queries the response was YES.
[2024-06-04 17:08:37,972 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51446 conditions, 5835 events. 3686/5835 cut-off events. For 561760/561768 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 34799 event pairs, 726 based on Foata normal form. 32/5866 useless extension candidates. Maximal degree in co-relation 51335. Up to 5196 conditions per place. 
[2024-06-04 17:08:38,000 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 294 selfloop transitions, 91 changer transitions 0/389 dead transitions.
[2024-06-04 17:08:38,001 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 389 transitions, 5649 flow
[2024-06-04 17:08:38,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 17:08:38,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 17:08:38,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions.
[2024-06-04 17:08:38,002 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 17:08:38,002 INFO  L175             Difference]: Start difference. First operand has 241 places, 347 transitions, 4476 flow. Second operand 11 states and 209 transitions.
[2024-06-04 17:08:38,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 389 transitions, 5649 flow
[2024-06-04 17:08:38,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 389 transitions, 5311 flow, removed 115 selfloop flow, removed 6 redundant places.
[2024-06-04 17:08:38,657 INFO  L231             Difference]: Finished difference. Result has 246 places, 347 transitions, 4332 flow
[2024-06-04 17:08:38,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4138, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4332, PETRI_PLACES=246, PETRI_TRANSITIONS=347}
[2024-06-04 17:08:38,658 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places.
[2024-06-04 17:08:38,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 347 transitions, 4332 flow
[2024-06-04 17:08:38,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:08:38,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:08:38,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:08:38,658 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-04 17:08:38,658 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:08:38,659 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:08:38,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -1829149321, now seen corresponding path program 10 times
[2024-06-04 17:08:38,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:08:38,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437997569]
[2024-06-04 17:08:38,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:08:38,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:08:38,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:08:46,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:08:46,509 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:08:46,509 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437997569]
[2024-06-04 17:08:46,509 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437997569] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:08:46,509 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:08:46,510 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:08:46,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548669161]
[2024-06-04 17:08:46,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:08:46,510 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:08:46,510 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:08:46,511 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:08:46,511 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:08:46,719 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:08:46,719 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 347 transitions, 4332 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:08:46,719 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:08:46,719 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:08:46,719 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:08:49,157 INFO  L124   PetriNetUnfolderBase]: 3879/6157 cut-off events.
[2024-06-04 17:08:49,157 INFO  L125   PetriNetUnfolderBase]: For 599936/599938 co-relation queries the response was YES.
[2024-06-04 17:08:49,186 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55468 conditions, 6157 events. 3879/6157 cut-off events. For 599936/599938 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 37311 event pairs, 790 based on Foata normal form. 18/6174 useless extension candidates. Maximal degree in co-relation 55355. Up to 5113 conditions per place. 
[2024-06-04 17:08:49,212 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 214 selfloop transitions, 173 changer transitions 0/391 dead transitions.
[2024-06-04 17:08:49,212 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 391 transitions, 5934 flow
[2024-06-04 17:08:49,213 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:08:49,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:08:49,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 206 transitions.
[2024-06-04 17:08:49,215 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49047619047619045
[2024-06-04 17:08:49,215 INFO  L175             Difference]: Start difference. First operand has 246 places, 347 transitions, 4332 flow. Second operand 10 states and 206 transitions.
[2024-06-04 17:08:49,215 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 391 transitions, 5934 flow
[2024-06-04 17:08:49,766 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 391 transitions, 5752 flow, removed 4 selfloop flow, removed 9 redundant places.
[2024-06-04 17:08:49,771 INFO  L231             Difference]: Finished difference. Result has 247 places, 351 transitions, 4815 flow
[2024-06-04 17:08:49,771 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4150, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4815, PETRI_PLACES=247, PETRI_TRANSITIONS=351}
[2024-06-04 17:08:49,772 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 204 predicate places.
[2024-06-04 17:08:49,772 INFO  L495      AbstractCegarLoop]: Abstraction has has 247 places, 351 transitions, 4815 flow
[2024-06-04 17:08:49,772 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:08:49,772 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:08:49,772 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:08:49,773 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-04 17:08:49,773 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:08:49,773 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:08:49,773 INFO  L85        PathProgramCache]: Analyzing trace with hash 996222853, now seen corresponding path program 11 times
[2024-06-04 17:08:49,773 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:08:49,774 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95555497]
[2024-06-04 17:08:49,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:08:49,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:08:49,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:08:58,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:08:58,476 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:08:58,476 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95555497]
[2024-06-04 17:08:58,476 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95555497] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:08:58,476 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:08:58,476 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:08:58,477 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092787629]
[2024-06-04 17:08:58,477 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:08:58,477 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:08:58,477 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:08:58,480 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:08:58,480 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:08:58,755 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:08:58,755 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 351 transitions, 4815 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:08:58,755 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:08:58,756 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:08:58,756 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:09:01,192 INFO  L124   PetriNetUnfolderBase]: 3833/6087 cut-off events.
[2024-06-04 17:09:01,193 INFO  L125   PetriNetUnfolderBase]: For 575751/575753 co-relation queries the response was YES.
[2024-06-04 17:09:01,223 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53821 conditions, 6087 events. 3833/6087 cut-off events. For 575751/575753 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 36874 event pairs, 793 based on Foata normal form. 24/6110 useless extension candidates. Maximal degree in co-relation 53707. Up to 5214 conditions per place. 
[2024-06-04 17:09:01,249 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 213 selfloop transitions, 169 changer transitions 0/386 dead transitions.
[2024-06-04 17:09:01,250 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 386 transitions, 5837 flow
[2024-06-04 17:09:01,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:09:01,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:09:01,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions.
[2024-06-04 17:09:01,251 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45476190476190476
[2024-06-04 17:09:01,251 INFO  L175             Difference]: Start difference. First operand has 247 places, 351 transitions, 4815 flow. Second operand 10 states and 191 transitions.
[2024-06-04 17:09:01,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 386 transitions, 5837 flow
[2024-06-04 17:09:01,794 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 386 transitions, 5379 flow, removed 120 selfloop flow, removed 6 redundant places.
[2024-06-04 17:09:01,799 INFO  L231             Difference]: Finished difference. Result has 251 places, 351 transitions, 4703 flow
[2024-06-04 17:09:01,799 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4357, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4703, PETRI_PLACES=251, PETRI_TRANSITIONS=351}
[2024-06-04 17:09:01,800 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 208 predicate places.
[2024-06-04 17:09:01,800 INFO  L495      AbstractCegarLoop]: Abstraction has has 251 places, 351 transitions, 4703 flow
[2024-06-04 17:09:01,800 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:09:01,800 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:09:01,800 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:09:01,800 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-04 17:09:01,801 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:09:01,801 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:09:01,801 INFO  L85        PathProgramCache]: Analyzing trace with hash 1005427063, now seen corresponding path program 12 times
[2024-06-04 17:09:01,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:09:01,801 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020459508]
[2024-06-04 17:09:01,801 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:09:01,801 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:09:01,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:09:09,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:09:09,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:09:09,007 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020459508]
[2024-06-04 17:09:09,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020459508] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:09:09,007 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:09:09,007 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:09:09,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675441172]
[2024-06-04 17:09:09,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:09:09,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:09:09,008 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:09:09,008 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:09:09,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:09:09,285 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:09:09,285 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 351 transitions, 4703 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:09:09,285 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:09:09,285 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:09:09,286 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:09:11,685 INFO  L124   PetriNetUnfolderBase]: 4001/6367 cut-off events.
[2024-06-04 17:09:11,685 INFO  L125   PetriNetUnfolderBase]: For 617482/617484 co-relation queries the response was YES.
[2024-06-04 17:09:11,716 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57578 conditions, 6367 events. 4001/6367 cut-off events. For 617482/617484 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 38745 event pairs, 763 based on Foata normal form. 18/6384 useless extension candidates. Maximal degree in co-relation 57462. Up to 3787 conditions per place. 
[2024-06-04 17:09:11,744 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 187 selfloop transitions, 205 changer transitions 0/396 dead transitions.
[2024-06-04 17:09:11,744 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 396 transitions, 6337 flow
[2024-06-04 17:09:11,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:09:11,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:09:11,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions.
[2024-06-04 17:09:11,745 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4666666666666667
[2024-06-04 17:09:11,746 INFO  L175             Difference]: Start difference. First operand has 251 places, 351 transitions, 4703 flow. Second operand 10 states and 196 transitions.
[2024-06-04 17:09:11,746 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 396 transitions, 6337 flow
[2024-06-04 17:09:12,327 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 396 transitions, 5991 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-04 17:09:12,332 INFO  L231             Difference]: Finished difference. Result has 252 places, 355 transitions, 5094 flow
[2024-06-04 17:09:12,332 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4357, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5094, PETRI_PLACES=252, PETRI_TRANSITIONS=355}
[2024-06-04 17:09:12,332 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 209 predicate places.
[2024-06-04 17:09:12,333 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 355 transitions, 5094 flow
[2024-06-04 17:09:12,333 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:09:12,333 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:09:12,333 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:09:12,333 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-04 17:09:12,333 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:09:12,333 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:09:12,334 INFO  L85        PathProgramCache]: Analyzing trace with hash 739520533, now seen corresponding path program 13 times
[2024-06-04 17:09:12,334 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:09:12,334 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640915061]
[2024-06-04 17:09:12,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:09:12,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:09:12,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:09:21,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:09:21,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:09:21,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640915061]
[2024-06-04 17:09:21,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640915061] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:09:21,456 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:09:21,456 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:09:21,456 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416467111]
[2024-06-04 17:09:21,456 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:09:21,456 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:09:21,456 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:09:21,456 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:09:21,456 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:09:21,600 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:09:21,600 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 355 transitions, 5094 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:09:21,600 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:09:21,600 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:09:21,600 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:09:24,269 INFO  L124   PetriNetUnfolderBase]: 4148/6612 cut-off events.
[2024-06-04 17:09:24,269 INFO  L125   PetriNetUnfolderBase]: For 724198/724200 co-relation queries the response was YES.
[2024-06-04 17:09:24,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61429 conditions, 6612 events. 4148/6612 cut-off events. For 724198/724200 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 41120 event pairs, 880 based on Foata normal form. 42/6653 useless extension candidates. Maximal degree in co-relation 61312. Up to 5803 conditions per place. 
[2024-06-04 17:09:24,331 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 268 selfloop transitions, 122 changer transitions 0/394 dead transitions.
[2024-06-04 17:09:24,332 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 394 transitions, 6460 flow
[2024-06-04 17:09:24,332 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:09:24,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:09:24,332 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-04 17:09:24,333 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 17:09:24,333 INFO  L175             Difference]: Start difference. First operand has 252 places, 355 transitions, 5094 flow. Second operand 10 states and 190 transitions.
[2024-06-04 17:09:24,333 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 394 transitions, 6460 flow
[2024-06-04 17:09:25,037 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 394 transitions, 6074 flow, removed 83 selfloop flow, removed 6 redundant places.
[2024-06-04 17:09:25,042 INFO  L231             Difference]: Finished difference. Result has 256 places, 359 transitions, 5297 flow
[2024-06-04 17:09:25,042 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4726, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5297, PETRI_PLACES=256, PETRI_TRANSITIONS=359}
[2024-06-04 17:09:25,042 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places.
[2024-06-04 17:09:25,043 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 359 transitions, 5297 flow
[2024-06-04 17:09:25,043 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:09:25,043 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:09:25,043 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:09:25,043 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-04 17:09:25,043 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:09:25,043 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:09:25,044 INFO  L85        PathProgramCache]: Analyzing trace with hash -1836306601, now seen corresponding path program 14 times
[2024-06-04 17:09:25,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:09:25,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253577336]
[2024-06-04 17:09:25,044 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:09:25,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:09:25,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:09:34,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:09:34,857 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:09:34,857 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253577336]
[2024-06-04 17:09:34,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253577336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:09:34,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:09:34,857 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:09:34,857 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874126440]
[2024-06-04 17:09:34,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:09:34,857 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:09:34,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:09:34,858 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:09:34,858 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:09:35,065 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:09:35,065 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 359 transitions, 5297 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:09:35,065 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:09:35,065 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:09:35,065 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:09:37,593 INFO  L124   PetriNetUnfolderBase]: 4196/6717 cut-off events.
[2024-06-04 17:09:37,593 INFO  L125   PetriNetUnfolderBase]: For 694364/694372 co-relation queries the response was YES.
[2024-06-04 17:09:37,634 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61693 conditions, 6717 events. 4196/6717 cut-off events. For 694364/694372 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 42061 event pairs, 873 based on Foata normal form. 32/6748 useless extension candidates. Maximal degree in co-relation 61574. Up to 6076 conditions per place. 
[2024-06-04 17:09:37,666 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 301 selfloop transitions, 97 changer transitions 0/402 dead transitions.
[2024-06-04 17:09:37,667 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 402 transitions, 6538 flow
[2024-06-04 17:09:37,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 17:09:37,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 17:09:37,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions.
[2024-06-04 17:09:37,668 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44805194805194803
[2024-06-04 17:09:37,668 INFO  L175             Difference]: Start difference. First operand has 256 places, 359 transitions, 5297 flow. Second operand 11 states and 207 transitions.
[2024-06-04 17:09:37,668 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 402 transitions, 6538 flow
[2024-06-04 17:09:38,313 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 402 transitions, 6071 flow, removed 111 selfloop flow, removed 9 redundant places.
[2024-06-04 17:09:38,318 INFO  L231             Difference]: Finished difference. Result has 258 places, 361 transitions, 5196 flow
[2024-06-04 17:09:38,319 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4830, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5196, PETRI_PLACES=258, PETRI_TRANSITIONS=361}
[2024-06-04 17:09:38,319 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 215 predicate places.
[2024-06-04 17:09:38,319 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 361 transitions, 5196 flow
[2024-06-04 17:09:38,319 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:09:38,319 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:09:38,319 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:09:38,320 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-04 17:09:38,320 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:09:38,320 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:09:38,320 INFO  L85        PathProgramCache]: Analyzing trace with hash 1267082257, now seen corresponding path program 15 times
[2024-06-04 17:09:38,320 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:09:38,320 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879366615]
[2024-06-04 17:09:38,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:09:38,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:09:38,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:09:46,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:09:46,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:09:46,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879366615]
[2024-06-04 17:09:46,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879366615] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:09:46,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:09:46,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:09:46,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288385352]
[2024-06-04 17:09:46,624 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:09:46,624 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:09:46,635 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:09:46,636 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:09:46,636 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:09:46,923 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:09:46,923 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 361 transitions, 5196 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:09:46,923 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:09:46,923 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:09:46,923 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:09:49,363 INFO  L124   PetriNetUnfolderBase]: 4163/6666 cut-off events.
[2024-06-04 17:09:49,363 INFO  L125   PetriNetUnfolderBase]: For 638733/638741 co-relation queries the response was YES.
[2024-06-04 17:09:49,406 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58593 conditions, 6666 events. 4163/6666 cut-off events. For 638733/638741 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 41686 event pairs, 832 based on Foata normal form. 26/6691 useless extension candidates. Maximal degree in co-relation 58474. Up to 5808 conditions per place. 
[2024-06-04 17:09:49,439 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 298 selfloop transitions, 99 changer transitions 0/401 dead transitions.
[2024-06-04 17:09:49,440 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 401 transitions, 6297 flow
[2024-06-04 17:09:49,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:09:49,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:09:49,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-04 17:09:49,441 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48095238095238096
[2024-06-04 17:09:49,441 INFO  L175             Difference]: Start difference. First operand has 258 places, 361 transitions, 5196 flow. Second operand 10 states and 202 transitions.
[2024-06-04 17:09:49,441 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 401 transitions, 6297 flow
[2024-06-04 17:09:50,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 401 transitions, 5935 flow, removed 88 selfloop flow, removed 9 redundant places.
[2024-06-04 17:09:50,233 INFO  L231             Difference]: Finished difference. Result has 259 places, 361 transitions, 5039 flow
[2024-06-04 17:09:50,234 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4834, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5039, PETRI_PLACES=259, PETRI_TRANSITIONS=361}
[2024-06-04 17:09:50,234 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 216 predicate places.
[2024-06-04 17:09:50,234 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 361 transitions, 5039 flow
[2024-06-04 17:09:50,234 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:09:50,235 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:09:50,235 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:09:50,235 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-04 17:09:50,235 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:09:50,235 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:09:50,235 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345663351, now seen corresponding path program 2 times
[2024-06-04 17:09:50,235 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:09:50,236 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740901493]
[2024-06-04 17:09:50,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:09:50,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:09:50,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:09:58,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:09:58,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:09:58,721 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740901493]
[2024-06-04 17:09:58,722 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740901493] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:09:58,722 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:09:58,722 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:09:58,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129967326]
[2024-06-04 17:09:58,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:09:58,722 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:09:58,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:09:58,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:09:58,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:09:58,929 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:09:58,930 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 361 transitions, 5039 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:09:58,930 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:09:58,930 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:09:58,930 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:10:01,152 INFO  L124   PetriNetUnfolderBase]: 4173/6673 cut-off events.
[2024-06-04 17:10:01,152 INFO  L125   PetriNetUnfolderBase]: For 582288/582290 co-relation queries the response was YES.
[2024-06-04 17:10:01,193 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57708 conditions, 6673 events. 4173/6673 cut-off events. For 582288/582290 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 41684 event pairs, 865 based on Foata normal form. 2/6674 useless extension candidates. Maximal degree in co-relation 57588. Up to 6382 conditions per place. 
[2024-06-04 17:10:01,222 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 318 selfloop transitions, 54 changer transitions 0/376 dead transitions.
[2024-06-04 17:10:01,222 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 376 transitions, 6039 flow
[2024-06-04 17:10:01,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:10:01,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:10:01,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-04 17:10:01,224 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41496598639455784
[2024-06-04 17:10:01,224 INFO  L175             Difference]: Start difference. First operand has 259 places, 361 transitions, 5039 flow. Second operand 7 states and 122 transitions.
[2024-06-04 17:10:01,224 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 376 transitions, 6039 flow
[2024-06-04 17:10:01,953 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 376 transitions, 5544 flow, removed 34 selfloop flow, removed 10 redundant places.
[2024-06-04 17:10:01,957 INFO  L231             Difference]: Finished difference. Result has 256 places, 364 transitions, 4704 flow
[2024-06-04 17:10:01,958 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4544, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4704, PETRI_PLACES=256, PETRI_TRANSITIONS=364}
[2024-06-04 17:10:01,958 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places.
[2024-06-04 17:10:01,958 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 364 transitions, 4704 flow
[2024-06-04 17:10:01,958 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:01,958 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:10:01,958 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:10:01,958 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-04 17:10:01,959 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:10:01,959 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:10:01,959 INFO  L85        PathProgramCache]: Analyzing trace with hash 818840671, now seen corresponding path program 3 times
[2024-06-04 17:10:01,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:10:01,959 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873740320]
[2024-06-04 17:10:01,959 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:10:01,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:10:01,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:10:14,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:10:14,792 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:10:14,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873740320]
[2024-06-04 17:10:14,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873740320] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:10:14,792 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:10:14,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:10:14,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901476053]
[2024-06-04 17:10:14,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:10:14,793 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:10:14,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:10:14,793 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:10:14,793 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:10:15,007 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:10:15,007 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 364 transitions, 4704 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:15,007 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:10:15,007 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:10:15,007 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:10:17,294 INFO  L124   PetriNetUnfolderBase]: 4167/6665 cut-off events.
[2024-06-04 17:10:17,294 INFO  L125   PetriNetUnfolderBase]: For 582118/582120 co-relation queries the response was YES.
[2024-06-04 17:10:17,335 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55911 conditions, 6665 events. 4167/6665 cut-off events. For 582118/582120 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 41608 event pairs, 865 based on Foata normal form. 2/6666 useless extension candidates. Maximal degree in co-relation 55792. Up to 6377 conditions per place. 
[2024-06-04 17:10:17,365 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 325 selfloop transitions, 48 changer transitions 0/377 dead transitions.
[2024-06-04 17:10:17,365 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 377 transitions, 5563 flow
[2024-06-04 17:10:17,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:10:17,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:10:17,366 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-04 17:10:17,366 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41496598639455784
[2024-06-04 17:10:17,366 INFO  L175             Difference]: Start difference. First operand has 256 places, 364 transitions, 4704 flow. Second operand 7 states and 122 transitions.
[2024-06-04 17:10:17,366 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 377 transitions, 5563 flow
[2024-06-04 17:10:18,205 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 377 transitions, 5401 flow, removed 26 selfloop flow, removed 5 redundant places.
[2024-06-04 17:10:18,209 INFO  L231             Difference]: Finished difference. Result has 258 places, 364 transitions, 4646 flow
[2024-06-04 17:10:18,210 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4543, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4646, PETRI_PLACES=258, PETRI_TRANSITIONS=364}
[2024-06-04 17:10:18,210 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 215 predicate places.
[2024-06-04 17:10:18,210 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 364 transitions, 4646 flow
[2024-06-04 17:10:18,210 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:18,210 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:10:18,211 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:10:18,211 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-04 17:10:18,211 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:10:18,211 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:10:18,211 INFO  L85        PathProgramCache]: Analyzing trace with hash -49079115, now seen corresponding path program 11 times
[2024-06-04 17:10:18,211 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:10:18,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380417342]
[2024-06-04 17:10:18,212 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:10:18,212 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:10:18,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:10:27,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:10:27,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:10:27,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380417342]
[2024-06-04 17:10:27,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380417342] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:10:27,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:10:27,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:10:27,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998105428]
[2024-06-04 17:10:27,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:10:27,225 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:10:27,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:10:27,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:10:27,226 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:10:27,490 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:10:27,491 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 364 transitions, 4646 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:27,491 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:10:27,491 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:10:27,491 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:10:30,056 INFO  L124   PetriNetUnfolderBase]: 4482/7165 cut-off events.
[2024-06-04 17:10:30,056 INFO  L125   PetriNetUnfolderBase]: For 703660/703666 co-relation queries the response was YES.
[2024-06-04 17:10:30,097 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62185 conditions, 7165 events. 4482/7165 cut-off events. For 703660/703666 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 45298 event pairs, 857 based on Foata normal form. 30/7194 useless extension candidates. Maximal degree in co-relation 62066. Up to 6510 conditions per place. 
[2024-06-04 17:10:30,128 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 370 selfloop transitions, 71 changer transitions 0/445 dead transitions.
[2024-06-04 17:10:30,129 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 445 transitions, 6697 flow
[2024-06-04 17:10:30,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:10:30,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:10:30,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions.
[2024-06-04 17:10:30,130 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46190476190476193
[2024-06-04 17:10:30,130 INFO  L175             Difference]: Start difference. First operand has 258 places, 364 transitions, 4646 flow. Second operand 10 states and 194 transitions.
[2024-06-04 17:10:30,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 445 transitions, 6697 flow
[2024-06-04 17:10:30,801 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 445 transitions, 6575 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-06-04 17:10:30,806 INFO  L231             Difference]: Finished difference. Result has 265 places, 393 transitions, 5414 flow
[2024-06-04 17:10:30,806 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4544, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5414, PETRI_PLACES=265, PETRI_TRANSITIONS=393}
[2024-06-04 17:10:30,808 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 222 predicate places.
[2024-06-04 17:10:30,808 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 393 transitions, 5414 flow
[2024-06-04 17:10:30,808 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:30,808 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:10:30,808 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:10:30,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-04 17:10:30,809 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:10:30,809 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:10:30,809 INFO  L85        PathProgramCache]: Analyzing trace with hash -1935485837, now seen corresponding path program 12 times
[2024-06-04 17:10:30,809 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:10:30,809 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135550531]
[2024-06-04 17:10:30,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:10:30,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:10:30,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:10:38,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:10:38,105 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:10:38,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135550531]
[2024-06-04 17:10:38,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135550531] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:10:38,105 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:10:38,105 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:10:38,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050035604]
[2024-06-04 17:10:38,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:10:38,106 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:10:38,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:10:38,106 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:10:38,106 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:10:38,246 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:10:38,246 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 393 transitions, 5414 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:38,246 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:10:38,246 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:10:38,246 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:10:40,926 INFO  L124   PetriNetUnfolderBase]: 4762/7600 cut-off events.
[2024-06-04 17:10:40,927 INFO  L125   PetriNetUnfolderBase]: For 759575/759577 co-relation queries the response was YES.
[2024-06-04 17:10:40,980 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 69028 conditions, 7600 events. 4762/7600 cut-off events. For 759575/759577 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 48494 event pairs, 1085 based on Foata normal form. 8/7607 useless extension candidates. Maximal degree in co-relation 68905. Up to 7049 conditions per place. 
[2024-06-04 17:10:41,019 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 396 selfloop transitions, 71 changer transitions 0/471 dead transitions.
[2024-06-04 17:10:41,019 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 471 transitions, 7867 flow
[2024-06-04 17:10:41,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:10:41,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:10:41,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-04 17:10:41,020 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-04 17:10:41,020 INFO  L175             Difference]: Start difference. First operand has 265 places, 393 transitions, 5414 flow. Second operand 10 states and 188 transitions.
[2024-06-04 17:10:41,021 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 471 transitions, 7867 flow
[2024-06-04 17:10:42,150 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 471 transitions, 7520 flow, removed 138 selfloop flow, removed 4 redundant places.
[2024-06-04 17:10:42,156 INFO  L231             Difference]: Finished difference. Result has 274 places, 429 transitions, 6429 flow
[2024-06-04 17:10:42,156 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5216, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6429, PETRI_PLACES=274, PETRI_TRANSITIONS=429}
[2024-06-04 17:10:42,157 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 231 predicate places.
[2024-06-04 17:10:42,161 INFO  L495      AbstractCegarLoop]: Abstraction has has 274 places, 429 transitions, 6429 flow
[2024-06-04 17:10:42,161 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:42,161 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:10:42,161 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:10:42,161 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-04 17:10:42,161 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:10:42,162 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:10:42,162 INFO  L85        PathProgramCache]: Analyzing trace with hash -1276983627, now seen corresponding path program 13 times
[2024-06-04 17:10:42,162 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:10:42,162 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899842463]
[2024-06-04 17:10:42,162 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:10:42,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:10:42,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:10:51,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:10:51,039 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:10:51,039 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899842463]
[2024-06-04 17:10:51,039 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899842463] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:10:51,039 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:10:51,039 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:10:51,039 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223985132]
[2024-06-04 17:10:51,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:10:51,040 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:10:51,040 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:10:51,040 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:10:51,040 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:10:51,243 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:10:51,243 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 429 transitions, 6429 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:51,243 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:10:51,243 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:10:51,243 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:10:54,230 INFO  L124   PetriNetUnfolderBase]: 5024/7995 cut-off events.
[2024-06-04 17:10:54,230 INFO  L125   PetriNetUnfolderBase]: For 808474/808476 co-relation queries the response was YES.
[2024-06-04 17:10:54,278 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72885 conditions, 7995 events. 5024/7995 cut-off events. For 808474/808476 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 51274 event pairs, 1129 based on Foata normal form. 8/8002 useless extension candidates. Maximal degree in co-relation 72757. Up to 7446 conditions per place. 
[2024-06-04 17:10:54,313 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 408 selfloop transitions, 95 changer transitions 0/507 dead transitions.
[2024-06-04 17:10:54,314 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 507 transitions, 8518 flow
[2024-06-04 17:10:54,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:10:54,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:10:54,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-04 17:10:54,315 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 17:10:54,315 INFO  L175             Difference]: Start difference. First operand has 274 places, 429 transitions, 6429 flow. Second operand 10 states and 190 transitions.
[2024-06-04 17:10:54,315 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 507 transitions, 8518 flow
[2024-06-04 17:10:55,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 507 transitions, 8176 flow, removed 156 selfloop flow, removed 3 redundant places.
[2024-06-04 17:10:55,621 INFO  L231             Difference]: Finished difference. Result has 283 places, 461 transitions, 7005 flow
[2024-06-04 17:10:55,622 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6087, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7005, PETRI_PLACES=283, PETRI_TRANSITIONS=461}
[2024-06-04 17:10:55,622 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 240 predicate places.
[2024-06-04 17:10:55,622 INFO  L495      AbstractCegarLoop]: Abstraction has has 283 places, 461 transitions, 7005 flow
[2024-06-04 17:10:55,622 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:10:55,622 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:10:55,623 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:10:55,623 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-04 17:10:55,623 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:10:55,623 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:10:55,623 INFO  L85        PathProgramCache]: Analyzing trace with hash -605000365, now seen corresponding path program 14 times
[2024-06-04 17:10:55,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:10:55,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22376315]
[2024-06-04 17:10:55,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:10:55,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:10:55,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:03,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:11:03,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:03,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22376315]
[2024-06-04 17:11:03,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22376315] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:03,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:03,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:11:03,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523625982]
[2024-06-04 17:11:03,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:03,445 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:11:03,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:03,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:11:03,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:11:03,722 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:11:03,722 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 461 transitions, 7005 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:11:03,722 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:03,722 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:11:03,723 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:11:06,819 INFO  L124   PetriNetUnfolderBase]: 5327/8458 cut-off events.
[2024-06-04 17:11:06,820 INFO  L125   PetriNetUnfolderBase]: For 896022/896024 co-relation queries the response was YES.
[2024-06-04 17:11:06,879 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79359 conditions, 8458 events. 5327/8458 cut-off events. For 896022/896024 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 54492 event pairs, 896 based on Foata normal form. 8/8465 useless extension candidates. Maximal degree in co-relation 79227. Up to 7613 conditions per place. 
[2024-06-04 17:11:06,923 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 419 selfloop transitions, 118 changer transitions 0/541 dead transitions.
[2024-06-04 17:11:06,924 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 541 transitions, 9736 flow
[2024-06-04 17:11:06,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:11:06,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:11:06,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-04 17:11:06,925 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 17:11:06,925 INFO  L175             Difference]: Start difference. First operand has 283 places, 461 transitions, 7005 flow. Second operand 10 states and 190 transitions.
[2024-06-04 17:11:06,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 541 transitions, 9736 flow
[2024-06-04 17:11:08,656 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 541 transitions, 9423 flow, removed 118 selfloop flow, removed 5 redundant places.
[2024-06-04 17:11:08,663 INFO  L231             Difference]: Finished difference. Result has 291 places, 498 transitions, 8159 flow
[2024-06-04 17:11:08,663 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6692, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8159, PETRI_PLACES=291, PETRI_TRANSITIONS=498}
[2024-06-04 17:11:08,663 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 248 predicate places.
[2024-06-04 17:11:08,663 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 498 transitions, 8159 flow
[2024-06-04 17:11:08,664 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:11:08,664 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:11:08,664 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:11:08,664 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-04 17:11:08,664 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:11:08,664 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:11:08,665 INFO  L85        PathProgramCache]: Analyzing trace with hash -106444441, now seen corresponding path program 15 times
[2024-06-04 17:11:08,665 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:11:08,665 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355984424]
[2024-06-04 17:11:08,665 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:11:08,665 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:11:08,725 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:16,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:11:16,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:16,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355984424]
[2024-06-04 17:11:16,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355984424] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:16,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:16,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:11:16,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468800165]
[2024-06-04 17:11:16,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:16,625 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:11:16,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:16,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:11:16,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:11:16,791 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:11:16,791 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 498 transitions, 8159 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:11:16,791 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:16,792 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:11:16,792 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:11:20,118 INFO  L124   PetriNetUnfolderBase]: 5566/8814 cut-off events.
[2024-06-04 17:11:20,119 INFO  L125   PetriNetUnfolderBase]: For 945354/945356 co-relation queries the response was YES.
[2024-06-04 17:11:20,173 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83754 conditions, 8814 events. 5566/8814 cut-off events. For 945354/945356 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 57198 event pairs, 1355 based on Foata normal form. 8/8821 useless extension candidates. Maximal degree in co-relation 83617. Up to 8191 conditions per place. 
[2024-06-04 17:11:20,216 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 485 selfloop transitions, 91 changer transitions 0/580 dead transitions.
[2024-06-04 17:11:20,216 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 580 transitions, 10606 flow
[2024-06-04 17:11:20,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:11:20,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:11:20,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-04 17:11:20,217 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-04 17:11:20,217 INFO  L175             Difference]: Start difference. First operand has 291 places, 498 transitions, 8159 flow. Second operand 10 states and 188 transitions.
[2024-06-04 17:11:20,217 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 580 transitions, 10606 flow
[2024-06-04 17:11:22,011 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 580 transitions, 10206 flow, removed 162 selfloop flow, removed 5 redundant places.
[2024-06-04 17:11:22,019 INFO  L231             Difference]: Finished difference. Result has 298 places, 536 transitions, 8905 flow
[2024-06-04 17:11:22,019 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7759, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8905, PETRI_PLACES=298, PETRI_TRANSITIONS=536}
[2024-06-04 17:11:22,019 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 255 predicate places.
[2024-06-04 17:11:22,020 INFO  L495      AbstractCegarLoop]: Abstraction has has 298 places, 536 transitions, 8905 flow
[2024-06-04 17:11:22,020 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:11:22,020 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:11:22,020 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:11:22,020 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-04 17:11:22,020 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:11:22,021 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:11:22,021 INFO  L85        PathProgramCache]: Analyzing trace with hash -102298895, now seen corresponding path program 1 times
[2024-06-04 17:11:22,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:11:22,021 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509205373]
[2024-06-04 17:11:22,021 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:11:22,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:11:22,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:30,227 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:11:30,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:30,227 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509205373]
[2024-06-04 17:11:30,227 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509205373] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:30,227 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:30,227 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:11:30,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520804502]
[2024-06-04 17:11:30,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:30,228 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:11:30,228 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:30,228 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:11:30,228 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:11:30,351 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:11:30,352 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 536 transitions, 8905 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-04 17:11:30,352 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:30,352 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:11:30,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:11:33,512 INFO  L124   PetriNetUnfolderBase]: 5465/8731 cut-off events.
[2024-06-04 17:11:33,513 INFO  L125   PetriNetUnfolderBase]: For 889385/889385 co-relation queries the response was YES.
[2024-06-04 17:11:33,565 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81693 conditions, 8731 events. 5465/8731 cut-off events. For 889385/889385 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 57456 event pairs, 1468 based on Foata normal form. 4/8729 useless extension candidates. Maximal degree in co-relation 81553. Up to 8364 conditions per place. 
[2024-06-04 17:11:33,606 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 524 selfloop transitions, 29 changer transitions 0/562 dead transitions.
[2024-06-04 17:11:33,606 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 562 transitions, 10415 flow
[2024-06-04 17:11:33,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:11:33,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:11:33,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-04 17:11:33,608 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 17:11:33,608 INFO  L175             Difference]: Start difference. First operand has 298 places, 536 transitions, 8905 flow. Second operand 7 states and 133 transitions.
[2024-06-04 17:11:33,608 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 562 transitions, 10415 flow
[2024-06-04 17:11:35,192 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 562 transitions, 10114 flow, removed 124 selfloop flow, removed 5 redundant places.
[2024-06-04 17:11:35,199 INFO  L231             Difference]: Finished difference. Result has 301 places, 546 transitions, 8856 flow
[2024-06-04 17:11:35,199 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8604, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8856, PETRI_PLACES=301, PETRI_TRANSITIONS=546}
[2024-06-04 17:11:35,200 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 258 predicate places.
[2024-06-04 17:11:35,200 INFO  L495      AbstractCegarLoop]: Abstraction has has 301 places, 546 transitions, 8856 flow
[2024-06-04 17:11:35,200 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-04 17:11:35,200 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:11:35,200 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:11:35,200 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-04 17:11:35,201 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:11:35,201 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:11:35,203 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345669303, now seen corresponding path program 2 times
[2024-06-04 17:11:35,203 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:11:35,203 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294300229]
[2024-06-04 17:11:35,203 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:11:35,203 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:11:35,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:43,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:11:43,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:43,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294300229]
[2024-06-04 17:11:43,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294300229] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:43,765 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:43,765 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:11:43,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962934458]
[2024-06-04 17:11:43,765 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:43,766 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:11:43,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:43,766 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:11:43,766 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:11:43,840 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:11:43,841 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 546 transitions, 8856 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-04 17:11:43,841 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:43,841 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:11:43,841 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:11:46,869 INFO  L124   PetriNetUnfolderBase]: 5462/8730 cut-off events.
[2024-06-04 17:11:46,869 INFO  L125   PetriNetUnfolderBase]: For 891264/891264 co-relation queries the response was YES.
[2024-06-04 17:11:46,929 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81555 conditions, 8730 events. 5462/8730 cut-off events. For 891264/891264 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 57445 event pairs, 1468 based on Foata normal form. 3/8729 useless extension candidates. Maximal degree in co-relation 81412. Up to 8431 conditions per place. 
[2024-06-04 17:11:46,971 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 532 selfloop transitions, 18 changer transitions 0/559 dead transitions.
[2024-06-04 17:11:46,971 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 559 transitions, 10056 flow
[2024-06-04 17:11:46,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:11:46,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:11:46,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-04 17:11:46,972 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39285714285714285
[2024-06-04 17:11:46,972 INFO  L175             Difference]: Start difference. First operand has 301 places, 546 transitions, 8856 flow. Second operand 8 states and 132 transitions.
[2024-06-04 17:11:46,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 559 transitions, 10056 flow
[2024-06-04 17:11:48,834 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 559 transitions, 9940 flow, removed 54 selfloop flow, removed 2 redundant places.
[2024-06-04 17:11:48,842 INFO  L231             Difference]: Finished difference. Result has 307 places, 549 transitions, 8857 flow
[2024-06-04 17:11:48,842 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8740, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8857, PETRI_PLACES=307, PETRI_TRANSITIONS=549}
[2024-06-04 17:11:48,842 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 264 predicate places.
[2024-06-04 17:11:48,842 INFO  L495      AbstractCegarLoop]: Abstraction has has 307 places, 549 transitions, 8857 flow
[2024-06-04 17:11:48,843 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-04 17:11:48,843 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:11:48,843 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:11:48,843 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-04 17:11:48,843 INFO  L420      AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:11:48,843 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:11:48,844 INFO  L85        PathProgramCache]: Analyzing trace with hash 819025183, now seen corresponding path program 3 times
[2024-06-04 17:11:48,844 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:11:48,844 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254997145]
[2024-06-04 17:11:48,844 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:11:48,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:11:48,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:11:57,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:11:57,857 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:11:57,857 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254997145]
[2024-06-04 17:11:57,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254997145] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:11:57,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:11:57,858 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:11:57,858 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601660830]
[2024-06-04 17:11:57,858 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:11:57,858 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:11:57,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:11:57,858 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:11:57,859 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:11:57,979 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 17:11:57,980 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 549 transitions, 8857 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-04 17:11:57,980 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:11:57,980 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 17:11:57,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:12:01,081 INFO  L124   PetriNetUnfolderBase]: 5455/8720 cut-off events.
[2024-06-04 17:12:01,081 INFO  L125   PetriNetUnfolderBase]: For 899865/899865 co-relation queries the response was YES.
[2024-06-04 17:12:01,147 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81462 conditions, 8720 events. 5455/8720 cut-off events. For 899865/899865 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 57453 event pairs, 1465 based on Foata normal form. 2/8716 useless extension candidates. Maximal degree in co-relation 81316. Up to 8416 conditions per place. 
[2024-06-04 17:12:01,191 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 532 selfloop transitions, 22 changer transitions 0/563 dead transitions.
[2024-06-04 17:12:01,192 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 563 transitions, 10075 flow
[2024-06-04 17:12:01,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:12:01,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:12:01,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-04 17:12:01,193 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4217687074829932
[2024-06-04 17:12:01,193 INFO  L175             Difference]: Start difference. First operand has 307 places, 549 transitions, 8857 flow. Second operand 7 states and 124 transitions.
[2024-06-04 17:12:01,193 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 563 transitions, 10075 flow
[2024-06-04 17:12:03,057 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 563 transitions, 9981 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-04 17:12:03,064 INFO  L231             Difference]: Finished difference. Result has 308 places, 552 transitions, 8893 flow
[2024-06-04 17:12:03,065 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8763, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8893, PETRI_PLACES=308, PETRI_TRANSITIONS=552}
[2024-06-04 17:12:03,065 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 265 predicate places.
[2024-06-04 17:12:03,065 INFO  L495      AbstractCegarLoop]: Abstraction has has 308 places, 552 transitions, 8893 flow
[2024-06-04 17:12:03,065 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-04 17:12:03,065 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:12:03,065 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:12:03,065 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-04 17:12:03,066 INFO  L420      AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:12:03,066 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:12:03,066 INFO  L85        PathProgramCache]: Analyzing trace with hash 215789116, now seen corresponding path program 1 times
[2024-06-04 17:12:03,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:12:03,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491161390]
[2024-06-04 17:12:03,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:12:03,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:12:03,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:12:11,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:12:11,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:12:11,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491161390]
[2024-06-04 17:12:11,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491161390] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:12:11,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:12:11,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:12:11,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199036364]
[2024-06-04 17:12:11,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:12:11,659 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:12:11,660 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:12:11,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:12:11,660 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:12:11,917 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:12:11,917 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 552 transitions, 8893 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:12:11,917 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:12:11,917 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:12:11,917 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:12:15,441 INFO  L124   PetriNetUnfolderBase]: 5686/9010 cut-off events.
[2024-06-04 17:12:15,441 INFO  L125   PetriNetUnfolderBase]: For 1085344/1085346 co-relation queries the response was YES.
[2024-06-04 17:12:15,504 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 86530 conditions, 9010 events. 5686/9010 cut-off events. For 1085344/1085346 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 58748 event pairs, 1275 based on Foata normal form. 20/9029 useless extension candidates. Maximal degree in co-relation 86384. Up to 8230 conditions per place. 
[2024-06-04 17:12:15,547 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 469 selfloop transitions, 120 changer transitions 0/593 dead transitions.
[2024-06-04 17:12:15,547 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 593 transitions, 10555 flow
[2024-06-04 17:12:15,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:12:15,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:12:15,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-04 17:12:15,549 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-04 17:12:15,549 INFO  L175             Difference]: Start difference. First operand has 308 places, 552 transitions, 8893 flow. Second operand 10 states and 188 transitions.
[2024-06-04 17:12:15,549 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 593 transitions, 10555 flow
[2024-06-04 17:12:17,441 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 593 transitions, 10451 flow, removed 32 selfloop flow, removed 5 redundant places.
[2024-06-04 17:12:17,449 INFO  L231             Difference]: Finished difference. Result has 313 places, 554 transitions, 9223 flow
[2024-06-04 17:12:17,450 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8789, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9223, PETRI_PLACES=313, PETRI_TRANSITIONS=554}
[2024-06-04 17:12:17,450 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 270 predicate places.
[2024-06-04 17:12:17,450 INFO  L495      AbstractCegarLoop]: Abstraction has has 313 places, 554 transitions, 9223 flow
[2024-06-04 17:12:17,450 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:12:17,450 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:12:17,450 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:12:17,451 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-04 17:12:17,451 INFO  L420      AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:12:17,451 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:12:17,451 INFO  L85        PathProgramCache]: Analyzing trace with hash 215673796, now seen corresponding path program 2 times
[2024-06-04 17:12:17,451 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:12:17,451 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093489215]
[2024-06-04 17:12:17,451 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:12:17,452 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:12:17,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:12:26,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:12:26,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:12:26,398 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093489215]
[2024-06-04 17:12:26,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093489215] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:12:26,398 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:12:26,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:12:26,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141253826]
[2024-06-04 17:12:26,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:12:26,398 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:12:26,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:12:26,398 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:12:26,399 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:12:26,692 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:12:26,693 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 554 transitions, 9223 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:12:26,693 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:12:26,693 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:12:26,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:12:30,192 INFO  L124   PetriNetUnfolderBase]: 5754/9120 cut-off events.
[2024-06-04 17:12:30,192 INFO  L125   PetriNetUnfolderBase]: For 1136207/1136209 co-relation queries the response was YES.
[2024-06-04 17:12:30,258 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88906 conditions, 9120 events. 5754/9120 cut-off events. For 1136207/1136209 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 59451 event pairs, 1203 based on Foata normal form. 20/9139 useless extension candidates. Maximal degree in co-relation 88759. Up to 7896 conditions per place. 
[2024-06-04 17:12:30,303 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 435 selfloop transitions, 158 changer transitions 0/597 dead transitions.
[2024-06-04 17:12:30,304 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 597 transitions, 11061 flow
[2024-06-04 17:12:30,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:12:30,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:12:30,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-04 17:12:30,305 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 17:12:30,305 INFO  L175             Difference]: Start difference. First operand has 313 places, 554 transitions, 9223 flow. Second operand 10 states and 190 transitions.
[2024-06-04 17:12:30,305 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 597 transitions, 11061 flow
[2024-06-04 17:12:32,397 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 597 transitions, 10675 flow, removed 77 selfloop flow, removed 8 redundant places.
[2024-06-04 17:12:32,405 INFO  L231             Difference]: Finished difference. Result has 315 places, 556 transitions, 9351 flow
[2024-06-04 17:12:32,405 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8837, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9351, PETRI_PLACES=315, PETRI_TRANSITIONS=556}
[2024-06-04 17:12:32,405 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 272 predicate places.
[2024-06-04 17:12:32,405 INFO  L495      AbstractCegarLoop]: Abstraction has has 315 places, 556 transitions, 9351 flow
[2024-06-04 17:12:32,406 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:12:32,406 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:12:32,406 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:12:32,406 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-04 17:12:32,406 INFO  L420      AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:12:32,406 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:12:32,407 INFO  L85        PathProgramCache]: Analyzing trace with hash 642367918, now seen corresponding path program 3 times
[2024-06-04 17:12:32,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:12:32,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355032247]
[2024-06-04 17:12:32,407 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:12:32,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:12:32,474 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:12:40,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:12:40,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:12:40,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355032247]
[2024-06-04 17:12:40,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355032247] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:12:40,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:12:40,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:12:40,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444813075]
[2024-06-04 17:12:40,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:12:40,585 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:12:40,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:12:40,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:12:40,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:12:40,812 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 17:12:40,812 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 556 transitions, 9351 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:12:40,812 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:12:40,812 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 17:12:40,812 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:12:44,637 INFO  L124   PetriNetUnfolderBase]: 5822/9229 cut-off events.
[2024-06-04 17:12:44,637 INFO  L125   PetriNetUnfolderBase]: For 1173071/1173073 co-relation queries the response was YES.
[2024-06-04 17:12:44,696 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90176 conditions, 9229 events. 5822/9229 cut-off events. For 1173071/1173073 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 60034 event pairs, 959 based on Foata normal form. 20/9248 useless extension candidates. Maximal degree in co-relation 90028. Up to 7631 conditions per place. 
[2024-06-04 17:12:44,739 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 443 selfloop transitions, 158 changer transitions 0/605 dead transitions.
[2024-06-04 17:12:44,740 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 605 transitions, 11429 flow
[2024-06-04 17:12:44,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:12:44,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:12:44,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-04 17:12:44,741 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-04 17:12:44,741 INFO  L175             Difference]: Start difference. First operand has 315 places, 556 transitions, 9351 flow. Second operand 10 states and 189 transitions.
[2024-06-04 17:12:44,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 605 transitions, 11429 flow
[2024-06-04 17:12:46,826 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 605 transitions, 10963 flow, removed 79 selfloop flow, removed 8 redundant places.
[2024-06-04 17:12:46,835 INFO  L231             Difference]: Finished difference. Result has 318 places, 563 transitions, 9691 flow
[2024-06-04 17:12:46,836 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8885, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9691, PETRI_PLACES=318, PETRI_TRANSITIONS=563}
[2024-06-04 17:12:46,836 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 275 predicate places.
[2024-06-04 17:12:46,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 318 places, 563 transitions, 9691 flow
[2024-06-04 17:12:46,836 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-04 17:12:46,836 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:12:46,837 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:12:46,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-04 17:12:46,837 INFO  L420      AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:12:46,837 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:12:46,837 INFO  L85        PathProgramCache]: Analyzing trace with hash -1781396144, now seen corresponding path program 4 times
[2024-06-04 17:12:46,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:12:46,837 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680755487]
[2024-06-04 17:12:46,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:12:46,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:12:46,893 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15