./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_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/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version cde23df1
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/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe001_power.opt_pso.oepc_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-cde23df-m
[2024-06-14 15:47:52,453 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 15:47:52,497 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 15:47:52,500 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 15:47:52,500 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 15:47:52,519 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 15:47:52,519 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 15:47:52,520 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 15:47:52,520 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 15:47:52,520 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 15:47:52,520 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 15:47:52,521 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 15:47:52,521 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 15:47:52,521 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 15:47:52,522 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 15:47:52,522 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 15:47:52,522 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 15:47:52,522 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 15:47:52,523 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 15:47:52,523 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 15:47:52,523 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 15:47:52,524 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 15:47:52,524 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 15:47:52,524 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 15:47:52,525 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 15:47:52,525 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 15:47:52,525 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 15:47:52,525 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 15:47:52,526 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 15:47:52,526 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 15:47:52,526 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 15:47:52,526 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 15:47:52,526 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:47:52,527 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 15:47:52,527 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 15:47:52,527 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 15:47:52,527 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 15:47:52,528 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 15:47:52,528 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 15:47:52,528 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 15:47:52,528 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 15:47:52,532 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 15:47:52,532 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 15:47:52,533 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-14 15:47:52,693 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 15:47:52,713 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 15:47:52,715 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 15:47:52,716 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 15:47:52,716 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 15:47:52,717 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-06-14 15:47:53,710 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 15:47:53,885 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 15:47:53,885 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-06-14 15:47:53,913 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ed3f71a/510a04fd04f24440981e050fc3a51b5d/FLAG5ef4e66b4
[2024-06-14 15:47:53,925 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ed3f71a/510a04fd04f24440981e050fc3a51b5d
[2024-06-14 15:47:53,927 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 15:47:53,928 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 15:47:53,929 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/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.yml/witness.yml
[2024-06-14 15:47:54,056 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 15:47:54,058 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 15:47:54,061 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 15:47:54,061 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 15:47:54,064 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 15:47:54,065 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:47:53" (1/2) ...
[2024-06-14 15:47:54,066 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d89d507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:47:54, skipping insertion in model container
[2024-06-14 15:47:54,066 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:47:53" (1/2) ...
[2024-06-14 15:47:54,067 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7a7a22fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:47:54, skipping insertion in model container
[2024-06-14 15:47:54,068 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:47:54" (2/2) ...
[2024-06-14 15:47:54,068 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d89d507 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54, skipping insertion in model container
[2024-06-14 15:47:54,068 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:47:54" (2/2) ...
[2024-06-14 15:47:54,068 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 15:47:54,138 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 15:47:54,139 INFO  L97    edCorrectnessWitness]: Location invariant before [L823-L823] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_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 == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_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) && (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) && (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) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-14 15:47:54,140 INFO  L97    edCorrectnessWitness]: Location invariant before [L821-L821] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_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 == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_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) && (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) && (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) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-14 15:47:54,140 INFO  L97    edCorrectnessWitness]: Location invariant before [L824-L824] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_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 == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_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) && (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) && (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) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-14 15:47:54,141 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 15:47:54,141 INFO  L106   edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1;
[2024-06-14 15:47:54,175 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 15:47:54,455 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:47:54,462 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 15:47:54,773 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:47:54,814 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 15:47:54,816 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54 WrapperNode
[2024-06-14 15:47:54,816 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 15:47:54,818 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 15:47:54,818 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 15:47:54,818 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 15:47:54,823 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (1/1) ...
[2024-06-14 15:47:54,859 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (1/1) ...
[2024-06-14 15:47:54,939 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143
[2024-06-14 15:47:54,940 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 15:47:54,941 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 15:47:54,941 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 15:47:54,941 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 15:47:54,950 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (1/1) ...
[2024-06-14 15:47:54,950 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (1/1) ...
[2024-06-14 15:47:54,973 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (1/1) ...
[2024-06-14 15:47:55,021 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-14 15:47:55,022 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (1/1) ...
[2024-06-14 15:47:55,022 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (1/1) ...
[2024-06-14 15:47:55,059 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (1/1) ...
[2024-06-14 15:47:55,061 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (1/1) ...
[2024-06-14 15:47:55,080 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (1/1) ...
[2024-06-14 15:47:55,084 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (1/1) ...
[2024-06-14 15:47:55,110 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 15:47:55,111 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 15:47:55,111 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 15:47:55,111 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 15:47:55,112 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (1/1) ...
[2024-06-14 15:47:55,116 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:47:55,122 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 15:47:55,134 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-14 15:47:55,136 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-14 15:47:55,165 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 15:47:55,165 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 15:47:55,165 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 15:47:55,166 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 15:47:55,166 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 15:47:55,166 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 15:47:55,166 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 15:47:55,166 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 15:47:55,166 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 15:47:55,166 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 15:47:55,167 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 15:47:55,167 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 15:47:55,167 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 15:47:55,273 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 15:47:55,275 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 15:47:56,175 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 15:47:56,175 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 15:47:56,421 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 15:47:56,421 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 15:47:56,422 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:47:56 BoogieIcfgContainer
[2024-06-14 15:47:56,422 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 15:47:56,424 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 15:47:56,424 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 15:47:56,427 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 15:47:56,427 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:47:53" (1/4) ...
[2024-06-14 15:47:56,428 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bf9241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:47:56, skipping insertion in model container
[2024-06-14 15:47:56,428 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:47:54" (2/4) ...
[2024-06-14 15:47:56,429 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bf9241 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:47:56, skipping insertion in model container
[2024-06-14 15:47:56,429 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:47:54" (3/4) ...
[2024-06-14 15:47:56,429 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bf9241 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:47:56, skipping insertion in model container
[2024-06-14 15:47:56,430 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:47:56" (4/4) ...
[2024-06-14 15:47:56,431 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-06-14 15:47:56,445 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 15:47:56,446 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 15:47:56,446 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 15:47:56,530 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 15:47:56,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow
[2024-06-14 15:47:56,607 INFO  L124   PetriNetUnfolderBase]: 0/38 cut-off events.
[2024-06-14 15:47:56,608 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:47:56,610 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 15:47:56,610 INFO  L82        GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow
[2024-06-14 15:47:56,613 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow
[2024-06-14 15:47:56,647 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 15:47:56,651 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;@69204d22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 15:47:56,652 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 15:47:56,657 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 15:47:56,657 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 15:47:56,657 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:47:56,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:47:56,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 15:47:56,658 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-14 15:47:56,685 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:47:56,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -1456369184, now seen corresponding path program 1 times
[2024-06-14 15:47:56,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:47:56,695 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152206105]
[2024-06-14 15:47:56,695 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:47:56,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:47:57,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:00,894 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:00,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:00,895 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152206105]
[2024-06-14 15:48:00,895 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152206105] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:00,895 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:00,895 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 15:48:00,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756914902]
[2024-06-14 15:48:00,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:00,903 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 15:48:00,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:00,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 15:48:00,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 15:48:00,990 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-14 15:48:00,993 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:00,993 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:00,993 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-14 15:48:00,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:01,663 INFO  L124   PetriNetUnfolderBase]: 1152/1747 cut-off events.
[2024-06-14 15:48:01,663 INFO  L125   PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES.
[2024-06-14 15:48:01,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3566 conditions, 1747 events. 1152/1747 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7996 event pairs, 785 based on Foata normal form. 1/1711 useless extension candidates. Maximal degree in co-relation 3551. Up to 1732 conditions per place. 
[2024-06-14 15:48:01,674 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 33 selfloop transitions, 4 changer transitions 0/42 dead transitions.
[2024-06-14 15:48:01,674 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 173 flow
[2024-06-14 15:48:01,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 15:48:01,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 15:48:01,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions.
[2024-06-14 15:48:01,683 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5691056910569106
[2024-06-14 15:48:01,684 INFO  L175             Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 70 transitions.
[2024-06-14 15:48:01,685 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 173 flow
[2024-06-14 15:48:01,686 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 15:48:01,688 INFO  L231             Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow
[2024-06-14 15:48:01,689 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35}
[2024-06-14 15:48:01,692 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2024-06-14 15:48:01,692 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow
[2024-06-14 15:48:01,692 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:01,692 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:01,692 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:01,693 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 15:48:01,693 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-14 15:48:01,693 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:01,693 INFO  L85        PathProgramCache]: Analyzing trace with hash 1065920051, now seen corresponding path program 1 times
[2024-06-14 15:48:01,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:01,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757821194]
[2024-06-14 15:48:01,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:01,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:01,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:04,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:04,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:04,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757821194]
[2024-06-14 15:48:04,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757821194] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:04,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:04,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 15:48:04,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133505755]
[2024-06-14 15:48:04,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:04,482 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 15:48:04,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:04,483 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 15:48:04,483 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-14 15:48:04,560 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:48:04,560 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:04,560 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:04,560 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:48:04,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:05,211 INFO  L124   PetriNetUnfolderBase]: 1389/2095 cut-off events.
[2024-06-14 15:48:05,212 INFO  L125   PetriNetUnfolderBase]: For 402/426 co-relation queries the response was YES.
[2024-06-14 15:48:05,214 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4831 conditions, 2095 events. 1389/2095 cut-off events. For 402/426 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9475 event pairs, 621 based on Foata normal form. 13/2101 useless extension candidates. Maximal degree in co-relation 4816. Up to 2033 conditions per place. 
[2024-06-14 15:48:05,220 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 43 selfloop transitions, 7 changer transitions 0/54 dead transitions.
[2024-06-14 15:48:05,221 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 250 flow
[2024-06-14 15:48:05,222 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 15:48:05,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 15:48:05,222 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions.
[2024-06-14 15:48:05,223 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5426829268292683
[2024-06-14 15:48:05,223 INFO  L175             Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 89 transitions.
[2024-06-14 15:48:05,223 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 250 flow
[2024-06-14 15:48:05,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 15:48:05,225 INFO  L231             Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow
[2024-06-14 15:48:05,225 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38}
[2024-06-14 15:48:05,226 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places.
[2024-06-14 15:48:05,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow
[2024-06-14 15:48:05,226 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:05,226 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:05,227 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:05,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 15:48:05,227 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-14 15:48:05,227 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:05,228 INFO  L85        PathProgramCache]: Analyzing trace with hash 677389008, now seen corresponding path program 1 times
[2024-06-14 15:48:05,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:05,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921683221]
[2024-06-14 15:48:05,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:05,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:05,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:08,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:08,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:08,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921683221]
[2024-06-14 15:48:08,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921683221] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:08,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:08,660 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:48:08,660 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549893849]
[2024-06-14 15:48:08,660 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:08,661 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:48:08,661 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:08,661 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:48:08,662 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:48:08,753 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:48:08,754 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-14 15:48:08,754 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:08,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:48:08,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:09,479 INFO  L124   PetriNetUnfolderBase]: 1380/2080 cut-off events.
[2024-06-14 15:48:09,480 INFO  L125   PetriNetUnfolderBase]: For 1134/1173 co-relation queries the response was YES.
[2024-06-14 15:48:09,482 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5322 conditions, 2080 events. 1380/2080 cut-off events. For 1134/1173 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9400 event pairs, 481 based on Foata normal form. 18/2091 useless extension candidates. Maximal degree in co-relation 5305. Up to 1988 conditions per place. 
[2024-06-14 15:48:09,488 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 47 selfloop transitions, 9 changer transitions 0/60 dead transitions.
[2024-06-14 15:48:09,488 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 306 flow
[2024-06-14 15:48:09,491 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:48:09,491 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:48:09,492 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions.
[2024-06-14 15:48:09,492 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5073170731707317
[2024-06-14 15:48:09,492 INFO  L175             Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 104 transitions.
[2024-06-14 15:48:09,493 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 306 flow
[2024-06-14 15:48:09,494 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 292 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-14 15:48:09,495 INFO  L231             Difference]: Finished difference. Result has 47 places, 39 transitions, 157 flow
[2024-06-14 15:48:09,495 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=47, PETRI_TRANSITIONS=39}
[2024-06-14 15:48:09,495 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places.
[2024-06-14 15:48:09,496 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 157 flow
[2024-06-14 15:48:09,496 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-14 15:48:09,496 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:09,496 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:09,496 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 15:48:09,496 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:48:09,497 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:09,497 INFO  L85        PathProgramCache]: Analyzing trace with hash 1906018500, now seen corresponding path program 1 times
[2024-06-14 15:48:09,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:09,497 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884517296]
[2024-06-14 15:48:09,497 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:09,497 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:09,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:14,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-14 15:48:14,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:14,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884517296]
[2024-06-14 15:48:14,320 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884517296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:14,320 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:14,320 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:48:14,320 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006118058]
[2024-06-14 15:48:14,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:14,321 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:48:14,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:14,322 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:48:14,323 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:48:14,413 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:48:14,413 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 157 flow. Second operand  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:14,413 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:14,414 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:48:14,414 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:15,012 INFO  L124   PetriNetUnfolderBase]: 1126/1707 cut-off events.
[2024-06-14 15:48:15,012 INFO  L125   PetriNetUnfolderBase]: For 1636/1639 co-relation queries the response was YES.
[2024-06-14 15:48:15,015 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4745 conditions, 1707 events. 1126/1707 cut-off events. For 1636/1639 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7642 event pairs, 594 based on Foata normal form. 4/1707 useless extension candidates. Maximal degree in co-relation 4727. Up to 1683 conditions per place. 
[2024-06-14 15:48:15,021 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 40 selfloop transitions, 8 changer transitions 0/53 dead transitions.
[2024-06-14 15:48:15,021 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 295 flow
[2024-06-14 15:48:15,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:48:15,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:48:15,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions.
[2024-06-14 15:48:15,023 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:48:15,024 INFO  L175             Difference]: Start difference. First operand has 47 places, 39 transitions, 157 flow. Second operand 5 states and 90 transitions.
[2024-06-14 15:48:15,024 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 295 flow
[2024-06-14 15:48:15,027 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 272 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 15:48:15,029 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 178 flow
[2024-06-14 15:48:15,029 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-14 15:48:15,030 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places.
[2024-06-14 15:48:15,030 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 178 flow
[2024-06-14 15:48:15,030 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:15,030 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:15,031 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:15,031 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 15:48:15,031 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-14 15:48:15,031 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:15,031 INFO  L85        PathProgramCache]: Analyzing trace with hash -1081397346, now seen corresponding path program 1 times
[2024-06-14 15:48:15,032 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:15,032 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422501823]
[2024-06-14 15:48:15,032 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:15,032 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:15,068 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:20,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:20,389 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:20,389 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422501823]
[2024-06-14 15:48:20,390 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422501823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:20,390 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:20,390 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:48:20,390 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355277715]
[2024-06-14 15:48:20,390 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:20,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:48:20,391 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:20,391 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:48:20,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:48:20,539 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:48:20,539 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 178 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:20,539 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:20,540 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:48:20,540 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:21,359 INFO  L124   PetriNetUnfolderBase]: 1594/2384 cut-off events.
[2024-06-14 15:48:21,359 INFO  L125   PetriNetUnfolderBase]: For 3233/3233 co-relation queries the response was YES.
[2024-06-14 15:48:21,364 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6966 conditions, 2384 events. 1594/2384 cut-off events. For 3233/3233 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10758 event pairs, 784 based on Foata normal form. 2/2384 useless extension candidates. Maximal degree in co-relation 6946. Up to 2353 conditions per place. 
[2024-06-14 15:48:21,372 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 52 selfloop transitions, 11 changer transitions 0/66 dead transitions.
[2024-06-14 15:48:21,372 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 368 flow
[2024-06-14 15:48:21,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:48:21,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:48:21,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-14 15:48:21,375 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-14 15:48:21,376 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 178 flow. Second operand 6 states and 96 transitions.
[2024-06-14 15:48:21,376 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 368 flow
[2024-06-14 15:48:21,380 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 346 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 15:48:21,382 INFO  L231             Difference]: Finished difference. Result has 54 places, 51 transitions, 230 flow
[2024-06-14 15:48:21,382 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=54, PETRI_TRANSITIONS=51}
[2024-06-14 15:48:21,384 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places.
[2024-06-14 15:48:21,384 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 230 flow
[2024-06-14 15:48:21,384 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:21,388 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:21,389 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:21,389 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 15:48:21,389 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-14 15:48:21,389 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:21,390 INFO  L85        PathProgramCache]: Analyzing trace with hash 836422361, now seen corresponding path program 1 times
[2024-06-14 15:48:21,390 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:21,390 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711070866]
[2024-06-14 15:48:21,390 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:21,390 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:21,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:27,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:27,160 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:27,160 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711070866]
[2024-06-14 15:48:27,160 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711070866] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:27,161 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:27,161 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:48:27,161 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394198958]
[2024-06-14 15:48:27,161 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:27,161 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:48:27,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:27,162 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:48:27,162 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:48:27,277 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:48:27,277 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 230 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:27,277 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:27,277 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:48:27,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:28,063 INFO  L124   PetriNetUnfolderBase]: 1589/2377 cut-off events.
[2024-06-14 15:48:28,063 INFO  L125   PetriNetUnfolderBase]: For 4362/4362 co-relation queries the response was YES.
[2024-06-14 15:48:28,067 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7533 conditions, 2377 events. 1589/2377 cut-off events. For 4362/4362 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10771 event pairs, 766 based on Foata normal form. 2/2377 useless extension candidates. Maximal degree in co-relation 7510. Up to 2337 conditions per place. 
[2024-06-14 15:48:28,074 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 56 selfloop transitions, 14 changer transitions 0/73 dead transitions.
[2024-06-14 15:48:28,074 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 428 flow
[2024-06-14 15:48:28,075 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:48:28,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:48:28,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions.
[2024-06-14 15:48:28,076 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3832752613240418
[2024-06-14 15:48:28,076 INFO  L175             Difference]: Start difference. First operand has 54 places, 51 transitions, 230 flow. Second operand 7 states and 110 transitions.
[2024-06-14 15:48:28,076 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 428 flow
[2024-06-14 15:48:28,078 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 15:48:28,079 INFO  L231             Difference]: Finished difference. Result has 60 places, 54 transitions, 280 flow
[2024-06-14 15:48:28,079 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=280, PETRI_PLACES=60, PETRI_TRANSITIONS=54}
[2024-06-14 15:48:28,079 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places.
[2024-06-14 15:48:28,079 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 280 flow
[2024-06-14 15:48:28,080 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:28,080 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:28,080 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:28,080 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 15:48:28,080 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-14 15:48:28,080 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:28,081 INFO  L85        PathProgramCache]: Analyzing trace with hash -18206589, now seen corresponding path program 1 times
[2024-06-14 15:48:28,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:28,081 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146301806]
[2024-06-14 15:48:28,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:28,081 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:28,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:32,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:32,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:32,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146301806]
[2024-06-14 15:48:32,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146301806] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:32,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:32,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:48:32,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076938130]
[2024-06-14 15:48:32,960 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:32,960 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:48:32,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:32,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:48:32,960 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:48:33,091 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:48:33,092 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 280 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:33,092 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:33,092 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:48:33,092 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:33,939 INFO  L124   PetriNetUnfolderBase]: 1575/2372 cut-off events.
[2024-06-14 15:48:33,939 INFO  L125   PetriNetUnfolderBase]: For 6832/6919 co-relation queries the response was YES.
[2024-06-14 15:48:33,943 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8270 conditions, 2372 events. 1575/2372 cut-off events. For 6832/6919 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10929 event pairs, 573 based on Foata normal form. 27/2344 useless extension candidates. Maximal degree in co-relation 8244. Up to 2240 conditions per place. 
[2024-06-14 15:48:33,954 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 57 selfloop transitions, 15 changer transitions 0/80 dead transitions.
[2024-06-14 15:48:33,954 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 80 transitions, 506 flow
[2024-06-14 15:48:33,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:48:33,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:48:33,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-14 15:48:33,956 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4349593495934959
[2024-06-14 15:48:33,956 INFO  L175             Difference]: Start difference. First operand has 60 places, 54 transitions, 280 flow. Second operand 6 states and 107 transitions.
[2024-06-14 15:48:33,956 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 80 transitions, 506 flow
[2024-06-14 15:48:33,959 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 478 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-14 15:48:33,960 INFO  L231             Difference]: Finished difference. Result has 62 places, 60 transitions, 330 flow
[2024-06-14 15:48:33,961 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=62, PETRI_TRANSITIONS=60}
[2024-06-14 15:48:33,961 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places.
[2024-06-14 15:48:33,961 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 330 flow
[2024-06-14 15:48:33,962 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:33,962 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:33,962 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:33,962 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 15:48:33,962 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-14 15:48:33,962 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:33,962 INFO  L85        PathProgramCache]: Analyzing trace with hash 1588017765, now seen corresponding path program 2 times
[2024-06-14 15:48:33,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:33,963 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071412448]
[2024-06-14 15:48:33,963 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:33,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:33,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:39,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:39,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:39,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071412448]
[2024-06-14 15:48:39,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071412448] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:39,096 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:39,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:48:39,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069171119]
[2024-06-14 15:48:39,096 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:39,096 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:48:39,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:39,097 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:48:39,097 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:48:39,213 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:48:39,213 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 330 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:39,213 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:39,213 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:48:39,213 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:40,008 INFO  L124   PetriNetUnfolderBase]: 1581/2383 cut-off events.
[2024-06-14 15:48:40,008 INFO  L125   PetriNetUnfolderBase]: For 9284/9359 co-relation queries the response was YES.
[2024-06-14 15:48:40,013 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9083 conditions, 2383 events. 1581/2383 cut-off events. For 9284/9359 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10960 event pairs, 564 based on Foata normal form. 29/2358 useless extension candidates. Maximal degree in co-relation 9055. Up to 2183 conditions per place. 
[2024-06-14 15:48:40,025 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 56 selfloop transitions, 23 changer transitions 0/87 dead transitions.
[2024-06-14 15:48:40,027 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 626 flow
[2024-06-14 15:48:40,029 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:48:40,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:48:40,029 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-14 15:48:40,030 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44715447154471544
[2024-06-14 15:48:40,030 INFO  L175             Difference]: Start difference. First operand has 62 places, 60 transitions, 330 flow. Second operand 6 states and 110 transitions.
[2024-06-14 15:48:40,030 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 626 flow
[2024-06-14 15:48:40,033 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 601 flow, removed 6 selfloop flow, removed 2 redundant places.
[2024-06-14 15:48:40,034 INFO  L231             Difference]: Finished difference. Result has 66 places, 66 transitions, 413 flow
[2024-06-14 15:48:40,035 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=413, PETRI_PLACES=66, PETRI_TRANSITIONS=66}
[2024-06-14 15:48:40,035 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places.
[2024-06-14 15:48:40,035 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 413 flow
[2024-06-14 15:48:40,035 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:40,035 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:40,036 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:40,036 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 15:48:40,036 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-14 15:48:40,036 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:40,036 INFO  L85        PathProgramCache]: Analyzing trace with hash 1588017951, now seen corresponding path program 1 times
[2024-06-14 15:48:40,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:40,036 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065968997]
[2024-06-14 15:48:40,037 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:40,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:40,066 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:45,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:45,175 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:45,175 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065968997]
[2024-06-14 15:48:45,175 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065968997] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:45,175 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:45,175 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:48:45,175 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709276825]
[2024-06-14 15:48:45,175 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:45,176 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:48:45,176 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:45,176 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:48:45,176 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:48:45,247 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:48:45,247 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 413 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:45,247 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:45,247 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:48:45,248 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:46,139 INFO  L124   PetriNetUnfolderBase]: 1779/2647 cut-off events.
[2024-06-14 15:48:46,139 INFO  L125   PetriNetUnfolderBase]: For 10991/11000 co-relation queries the response was YES.
[2024-06-14 15:48:46,144 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10420 conditions, 2647 events. 1779/2647 cut-off events. For 10991/11000 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12044 event pairs, 602 based on Foata normal form. 14/2658 useless extension candidates. Maximal degree in co-relation 10390. Up to 2473 conditions per place. 
[2024-06-14 15:48:46,150 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 75 selfloop transitions, 30 changer transitions 0/108 dead transitions.
[2024-06-14 15:48:46,151 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 108 transitions, 830 flow
[2024-06-14 15:48:46,151 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:48:46,151 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:48:46,152 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-14 15:48:46,152 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4250871080139373
[2024-06-14 15:48:46,152 INFO  L175             Difference]: Start difference. First operand has 66 places, 66 transitions, 413 flow. Second operand 7 states and 122 transitions.
[2024-06-14 15:48:46,152 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 108 transitions, 830 flow
[2024-06-14 15:48:46,158 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 801 flow, removed 9 selfloop flow, removed 2 redundant places.
[2024-06-14 15:48:46,159 INFO  L231             Difference]: Finished difference. Result has 73 places, 85 transitions, 617 flow
[2024-06-14 15:48:46,159 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=617, PETRI_PLACES=73, PETRI_TRANSITIONS=85}
[2024-06-14 15:48:46,160 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places.
[2024-06-14 15:48:46,160 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 85 transitions, 617 flow
[2024-06-14 15:48:46,160 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:46,160 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:46,160 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:46,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 15:48:46,160 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-14 15:48:46,161 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:46,161 INFO  L85        PathProgramCache]: Analyzing trace with hash -13438293, now seen corresponding path program 2 times
[2024-06-14 15:48:46,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:46,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930817948]
[2024-06-14 15:48:46,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:46,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:46,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:51,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:51,378 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:51,378 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930817948]
[2024-06-14 15:48:51,378 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930817948] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:51,378 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:51,378 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:48:51,378 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421821567]
[2024-06-14 15:48:51,378 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:51,378 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:48:51,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:51,379 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:48:51,379 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:48:51,552 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:48:51,552 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 85 transitions, 617 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:51,552 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:51,552 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:48:51,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:52,352 INFO  L124   PetriNetUnfolderBase]: 1790/2663 cut-off events.
[2024-06-14 15:48:52,352 INFO  L125   PetriNetUnfolderBase]: For 14402/14411 co-relation queries the response was YES.
[2024-06-14 15:48:52,357 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11944 conditions, 2663 events. 1790/2663 cut-off events. For 14402/14411 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12137 event pairs, 617 based on Foata normal form. 8/2668 useless extension candidates. Maximal degree in co-relation 11910. Up to 2568 conditions per place. 
[2024-06-14 15:48:52,364 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 92 selfloop transitions, 27 changer transitions 0/122 dead transitions.
[2024-06-14 15:48:52,364 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 122 transitions, 1092 flow
[2024-06-14 15:48:52,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:48:52,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:48:52,366 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-14 15:48:52,366 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40069686411149824
[2024-06-14 15:48:52,366 INFO  L175             Difference]: Start difference. First operand has 73 places, 85 transitions, 617 flow. Second operand 7 states and 115 transitions.
[2024-06-14 15:48:52,366 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 122 transitions, 1092 flow
[2024-06-14 15:48:52,378 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 122 transitions, 1053 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-14 15:48:52,379 INFO  L231             Difference]: Finished difference. Result has 81 places, 101 transitions, 839 flow
[2024-06-14 15:48:52,380 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=839, PETRI_PLACES=81, PETRI_TRANSITIONS=101}
[2024-06-14 15:48:52,380 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places.
[2024-06-14 15:48:52,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 101 transitions, 839 flow
[2024-06-14 15:48:52,381 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:52,381 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:52,381 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:52,381 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 15:48:52,381 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-14 15:48:52,381 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:52,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 159045087, now seen corresponding path program 3 times
[2024-06-14 15:48:52,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:52,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533703247]
[2024-06-14 15:48:52,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:52,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:52,410 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:57,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:57,932 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:57,932 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533703247]
[2024-06-14 15:48:57,932 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533703247] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:57,933 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:57,933 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:48:57,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905807059]
[2024-06-14 15:48:57,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:57,933 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:48:57,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:57,934 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:48:57,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:48:58,041 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:48:58,041 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 101 transitions, 839 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:58,041 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:58,041 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:48:58,041 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:59,009 INFO  L124   PetriNetUnfolderBase]: 1841/2734 cut-off events.
[2024-06-14 15:48:59,009 INFO  L125   PetriNetUnfolderBase]: For 18059/18073 co-relation queries the response was YES.
[2024-06-14 15:48:59,015 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12997 conditions, 2734 events. 1841/2734 cut-off events. For 18059/18073 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12454 event pairs, 621 based on Foata normal form. 15/2746 useless extension candidates. Maximal degree in co-relation 12958. Up to 2609 conditions per place. 
[2024-06-14 15:48:59,023 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 99 selfloop transitions, 35 changer transitions 0/137 dead transitions.
[2024-06-14 15:48:59,024 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 137 transitions, 1297 flow
[2024-06-14 15:48:59,024 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:48:59,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:48:59,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-14 15:48:59,025 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4024390243902439
[2024-06-14 15:48:59,025 INFO  L175             Difference]: Start difference. First operand has 81 places, 101 transitions, 839 flow. Second operand 8 states and 132 transitions.
[2024-06-14 15:48:59,025 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 137 transitions, 1297 flow
[2024-06-14 15:48:59,041 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 137 transitions, 1253 flow, removed 21 selfloop flow, removed 1 redundant places.
[2024-06-14 15:48:59,043 INFO  L231             Difference]: Finished difference. Result has 90 places, 114 transitions, 1027 flow
[2024-06-14 15:48:59,043 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1027, PETRI_PLACES=90, PETRI_TRANSITIONS=114}
[2024-06-14 15:48:59,044 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places.
[2024-06-14 15:48:59,044 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 114 transitions, 1027 flow
[2024-06-14 15:48:59,044 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:59,044 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:59,044 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:59,044 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 15:48:59,044 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-14 15:48:59,045 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:59,045 INFO  L85        PathProgramCache]: Analyzing trace with hash 159291165, now seen corresponding path program 1 times
[2024-06-14 15:48:59,045 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:59,045 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663974277]
[2024-06-14 15:48:59,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:59,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:59,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:04,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:04,729 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:04,730 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663974277]
[2024-06-14 15:49:04,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663974277] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:04,730 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:04,730 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:49:04,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89437473]
[2024-06-14 15:49:04,730 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:04,730 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:49:04,730 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:04,731 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:49:04,731 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:49:04,947 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:04,947 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 114 transitions, 1027 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:04,947 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:04,947 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:04,947 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:05,866 INFO  L124   PetriNetUnfolderBase]: 1833/2720 cut-off events.
[2024-06-14 15:49:05,866 INFO  L125   PetriNetUnfolderBase]: For 22209/22209 co-relation queries the response was YES.
[2024-06-14 15:49:05,873 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13932 conditions, 2720 events. 1833/2720 cut-off events. For 22209/22209 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12321 event pairs, 596 based on Foata normal form. 4/2722 useless extension candidates. Maximal degree in co-relation 13888. Up to 2662 conditions per place. 
[2024-06-14 15:49:05,881 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 121 selfloop transitions, 16 changer transitions 0/140 dead transitions.
[2024-06-14 15:49:05,881 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 140 transitions, 1383 flow
[2024-06-14 15:49:05,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:05,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:05,883 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-14 15:49:05,883 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-14 15:49:05,883 INFO  L175             Difference]: Start difference. First operand has 90 places, 114 transitions, 1027 flow. Second operand 8 states and 124 transitions.
[2024-06-14 15:49:05,884 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 140 transitions, 1383 flow
[2024-06-14 15:49:05,903 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 140 transitions, 1302 flow, removed 28 selfloop flow, removed 3 redundant places.
[2024-06-14 15:49:05,905 INFO  L231             Difference]: Finished difference. Result has 95 places, 116 transitions, 1011 flow
[2024-06-14 15:49:05,906 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1011, PETRI_PLACES=95, PETRI_TRANSITIONS=116}
[2024-06-14 15:49:05,906 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places.
[2024-06-14 15:49:05,906 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 116 transitions, 1011 flow
[2024-06-14 15:49:05,906 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:05,907 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:05,907 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:05,907 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 15:49:05,907 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-14 15:49:05,907 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:05,907 INFO  L85        PathProgramCache]: Analyzing trace with hash -564492936, now seen corresponding path program 1 times
[2024-06-14 15:49:05,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:05,908 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101408031]
[2024-06-14 15:49:05,908 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:05,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:05,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:11,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:11,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:11,149 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101408031]
[2024-06-14 15:49:11,149 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101408031] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:11,149 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:11,149 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:49:11,149 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029820271]
[2024-06-14 15:49:11,149 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:11,149 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:49:11,150 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:11,150 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:49:11,150 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:49:11,241 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:49:11,241 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 116 transitions, 1011 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:11,241 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:11,241 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:49:11,241 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:12,125 INFO  L124   PetriNetUnfolderBase]: 1746/2611 cut-off events.
[2024-06-14 15:49:12,125 INFO  L125   PetriNetUnfolderBase]: For 25003/25115 co-relation queries the response was YES.
[2024-06-14 15:49:12,131 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13692 conditions, 2611 events. 1746/2611 cut-off events. For 25003/25115 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11913 event pairs, 572 based on Foata normal form. 47/2630 useless extension candidates. Maximal degree in co-relation 13646. Up to 2450 conditions per place. 
[2024-06-14 15:49:12,138 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 101 selfloop transitions, 19 changer transitions 0/135 dead transitions.
[2024-06-14 15:49:12,138 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 135 transitions, 1301 flow
[2024-06-14 15:49:12,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:49:12,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:49:12,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-14 15:49:12,140 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4349593495934959
[2024-06-14 15:49:12,140 INFO  L175             Difference]: Start difference. First operand has 95 places, 116 transitions, 1011 flow. Second operand 6 states and 107 transitions.
[2024-06-14 15:49:12,140 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 135 transitions, 1301 flow
[2024-06-14 15:49:12,157 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 135 transitions, 1246 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-14 15:49:12,158 INFO  L231             Difference]: Finished difference. Result has 95 places, 116 transitions, 1006 flow
[2024-06-14 15:49:12,159 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1006, PETRI_PLACES=95, PETRI_TRANSITIONS=116}
[2024-06-14 15:49:12,159 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places.
[2024-06-14 15:49:12,160 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 116 transitions, 1006 flow
[2024-06-14 15:49:12,160 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:12,160 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:12,160 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:12,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 15:49:12,160 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-14 15:49:12,161 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:12,161 INFO  L85        PathProgramCache]: Analyzing trace with hash 1980193077, now seen corresponding path program 1 times
[2024-06-14 15:49:12,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:12,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120366877]
[2024-06-14 15:49:12,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:12,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:12,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:16,814 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:16,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:16,814 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120366877]
[2024-06-14 15:49:16,814 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120366877] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:16,814 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:16,814 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:49:16,814 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435070406]
[2024-06-14 15:49:16,814 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:16,815 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:49:16,815 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:16,815 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:49:16,815 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:49:16,906 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:16,907 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 116 transitions, 1006 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:16,907 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:16,907 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:16,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:18,021 INFO  L124   PetriNetUnfolderBase]: 1999/2955 cut-off events.
[2024-06-14 15:49:18,021 INFO  L125   PetriNetUnfolderBase]: For 29597/29611 co-relation queries the response was YES.
[2024-06-14 15:49:18,030 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15609 conditions, 2955 events. 1999/2955 cut-off events. For 29597/29611 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13566 event pairs, 542 based on Foata normal form. 20/2972 useless extension candidates. Maximal degree in co-relation 15562. Up to 2686 conditions per place. 
[2024-06-14 15:49:18,040 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 131 selfloop transitions, 37 changer transitions 0/171 dead transitions.
[2024-06-14 15:49:18,040 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 171 transitions, 1711 flow
[2024-06-14 15:49:18,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:49:18,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:49:18,042 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-14 15:49:18,042 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42276422764227645
[2024-06-14 15:49:18,042 INFO  L175             Difference]: Start difference. First operand has 95 places, 116 transitions, 1006 flow. Second operand 9 states and 156 transitions.
[2024-06-14 15:49:18,042 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 171 transitions, 1711 flow
[2024-06-14 15:49:18,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 171 transitions, 1647 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-14 15:49:18,064 INFO  L231             Difference]: Finished difference. Result has 101 places, 135 transitions, 1239 flow
[2024-06-14 15:49:18,065 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1239, PETRI_PLACES=101, PETRI_TRANSITIONS=135}
[2024-06-14 15:49:18,065 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places.
[2024-06-14 15:49:18,065 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 135 transitions, 1239 flow
[2024-06-14 15:49:18,065 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:18,065 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:18,066 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:18,066 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 15:49:18,066 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:18,066 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:18,066 INFO  L85        PathProgramCache]: Analyzing trace with hash 1983912147, now seen corresponding path program 2 times
[2024-06-14 15:49:18,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:18,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986610085]
[2024-06-14 15:49:18,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:18,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:18,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:23,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:23,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:23,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986610085]
[2024-06-14 15:49:23,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986610085] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:23,196 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:23,196 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:49:23,196 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472802478]
[2024-06-14 15:49:23,196 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:23,196 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:49:23,196 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:23,197 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:49:23,197 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:49:23,284 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:23,284 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 135 transitions, 1239 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:23,285 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:23,285 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:23,285 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:24,489 INFO  L124   PetriNetUnfolderBase]: 2504/3664 cut-off events.
[2024-06-14 15:49:24,489 INFO  L125   PetriNetUnfolderBase]: For 44426/44435 co-relation queries the response was YES.
[2024-06-14 15:49:24,501 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21357 conditions, 3664 events. 2504/3664 cut-off events. For 44426/44435 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17102 event pairs, 555 based on Foata normal form. 12/3673 useless extension candidates. Maximal degree in co-relation 21307. Up to 2707 conditions per place. 
[2024-06-14 15:49:24,513 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 130 selfloop transitions, 65 changer transitions 0/198 dead transitions.
[2024-06-14 15:49:24,513 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 198 transitions, 2201 flow
[2024-06-14 15:49:24,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:24,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:24,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-14 15:49:24,514 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-14 15:49:24,514 INFO  L175             Difference]: Start difference. First operand has 101 places, 135 transitions, 1239 flow. Second operand 8 states and 152 transitions.
[2024-06-14 15:49:24,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 198 transitions, 2201 flow
[2024-06-14 15:49:24,549 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 198 transitions, 2103 flow, removed 40 selfloop flow, removed 3 redundant places.
[2024-06-14 15:49:24,551 INFO  L231             Difference]: Finished difference. Result has 108 places, 156 transitions, 1601 flow
[2024-06-14 15:49:24,552 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1601, PETRI_PLACES=108, PETRI_TRANSITIONS=156}
[2024-06-14 15:49:24,552 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places.
[2024-06-14 15:49:24,552 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 156 transitions, 1601 flow
[2024-06-14 15:49:24,552 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:24,552 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:24,552 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:24,553 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 15:49:24,553 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-14 15:49:24,553 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:24,553 INFO  L85        PathProgramCache]: Analyzing trace with hash -1119707262, now seen corresponding path program 1 times
[2024-06-14 15:49:24,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:24,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882882553]
[2024-06-14 15:49:24,553 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:24,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:24,591 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:30,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:30,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:30,430 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882882553]
[2024-06-14 15:49:30,432 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882882553] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:30,432 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:30,432 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:49:30,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466419098]
[2024-06-14 15:49:30,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:30,433 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:49:30,433 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:30,433 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:49:30,433 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:49:30,548 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:30,549 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 156 transitions, 1601 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:30,549 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:30,549 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:30,549 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:31,743 INFO  L124   PetriNetUnfolderBase]: 2521/3687 cut-off events.
[2024-06-14 15:49:31,743 INFO  L125   PetriNetUnfolderBase]: For 53280/53291 co-relation queries the response was YES.
[2024-06-14 15:49:31,756 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23599 conditions, 3687 events. 2521/3687 cut-off events. For 53280/53291 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17270 event pairs, 608 based on Foata normal form. 16/3700 useless extension candidates. Maximal degree in co-relation 23545. Up to 3467 conditions per place. 
[2024-06-14 15:49:31,768 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 140 selfloop transitions, 46 changer transitions 0/189 dead transitions.
[2024-06-14 15:49:31,769 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 189 transitions, 2202 flow
[2024-06-14 15:49:31,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:31,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:31,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-14 15:49:31,770 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4268292682926829
[2024-06-14 15:49:31,770 INFO  L175             Difference]: Start difference. First operand has 108 places, 156 transitions, 1601 flow. Second operand 8 states and 140 transitions.
[2024-06-14 15:49:31,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 189 transitions, 2202 flow
[2024-06-14 15:49:31,858 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 189 transitions, 2089 flow, removed 50 selfloop flow, removed 2 redundant places.
[2024-06-14 15:49:31,861 INFO  L231             Difference]: Finished difference. Result has 114 places, 162 transitions, 1700 flow
[2024-06-14 15:49:31,861 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1700, PETRI_PLACES=114, PETRI_TRANSITIONS=162}
[2024-06-14 15:49:31,861 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places.
[2024-06-14 15:49:31,862 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 162 transitions, 1700 flow
[2024-06-14 15:49:31,862 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:31,862 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:31,862 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:31,862 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 15:49:31,864 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-14 15:49:31,864 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:31,864 INFO  L85        PathProgramCache]: Analyzing trace with hash 1983917727, now seen corresponding path program 3 times
[2024-06-14 15:49:31,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:31,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923783581]
[2024-06-14 15:49:31,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:31,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:31,895 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:36,968 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:36,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:36,968 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923783581]
[2024-06-14 15:49:36,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923783581] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:36,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:36,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:49:36,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430613517]
[2024-06-14 15:49:36,969 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:36,969 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:49:36,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:36,969 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:49:36,969 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:49:37,080 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:37,080 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 162 transitions, 1700 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:37,080 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:37,080 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:37,081 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:38,392 INFO  L124   PetriNetUnfolderBase]: 2593/3791 cut-off events.
[2024-06-14 15:49:38,392 INFO  L125   PetriNetUnfolderBase]: For 57540/57551 co-relation queries the response was YES.
[2024-06-14 15:49:38,404 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24199 conditions, 3791 events. 2593/3791 cut-off events. For 57540/57551 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17830 event pairs, 558 based on Foata normal form. 24/3812 useless extension candidates. Maximal degree in co-relation 24142. Up to 2778 conditions per place. 
[2024-06-14 15:49:38,414 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 124 selfloop transitions, 86 changer transitions 0/213 dead transitions.
[2024-06-14 15:49:38,414 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 213 transitions, 2577 flow
[2024-06-14 15:49:38,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:38,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:38,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-14 15:49:38,415 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46646341463414637
[2024-06-14 15:49:38,415 INFO  L175             Difference]: Start difference. First operand has 114 places, 162 transitions, 1700 flow. Second operand 8 states and 153 transitions.
[2024-06-14 15:49:38,415 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 213 transitions, 2577 flow
[2024-06-14 15:49:38,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 213 transitions, 2439 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-14 15:49:38,469 INFO  L231             Difference]: Finished difference. Result has 117 places, 175 transitions, 1973 flow
[2024-06-14 15:49:38,469 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1562, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1973, PETRI_PLACES=117, PETRI_TRANSITIONS=175}
[2024-06-14 15:49:38,470 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places.
[2024-06-14 15:49:38,470 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 175 transitions, 1973 flow
[2024-06-14 15:49:38,470 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:38,470 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:38,470 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:38,470 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 15:49:38,471 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-14 15:49:38,471 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:38,471 INFO  L85        PathProgramCache]: Analyzing trace with hash 642783553, now seen corresponding path program 4 times
[2024-06-14 15:49:38,471 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:38,471 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712901226]
[2024-06-14 15:49:38,471 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:38,471 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:38,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:43,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:43,778 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:43,778 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712901226]
[2024-06-14 15:49:43,778 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712901226] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:43,778 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:43,778 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:49:43,778 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696920831]
[2024-06-14 15:49:43,778 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:43,779 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:49:43,779 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:43,779 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:49:43,779 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:49:43,882 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:43,883 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 175 transitions, 1973 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:43,883 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:43,883 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:43,883 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:45,004 INFO  L124   PetriNetUnfolderBase]: 2691/3934 cut-off events.
[2024-06-14 15:49:45,005 INFO  L125   PetriNetUnfolderBase]: For 66647/66658 co-relation queries the response was YES.
[2024-06-14 15:49:45,019 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26296 conditions, 3934 events. 2691/3934 cut-off events. For 66647/66658 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 18447 event pairs, 677 based on Foata normal form. 12/3943 useless extension candidates. Maximal degree in co-relation 26237. Up to 3409 conditions per place. 
[2024-06-14 15:49:45,032 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 180 selfloop transitions, 60 changer transitions 0/243 dead transitions.
[2024-06-14 15:49:45,033 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 243 transitions, 3124 flow
[2024-06-14 15:49:45,036 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:45,036 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:45,036 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-14 15:49:45,036 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43597560975609756
[2024-06-14 15:49:45,036 INFO  L175             Difference]: Start difference. First operand has 117 places, 175 transitions, 1973 flow. Second operand 8 states and 143 transitions.
[2024-06-14 15:49:45,037 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 243 transitions, 3124 flow
[2024-06-14 15:49:45,103 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 243 transitions, 3036 flow, removed 31 selfloop flow, removed 3 redundant places.
[2024-06-14 15:49:45,107 INFO  L231             Difference]: Finished difference. Result has 126 places, 205 transitions, 2509 flow
[2024-06-14 15:49:45,107 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2509, PETRI_PLACES=126, PETRI_TRANSITIONS=205}
[2024-06-14 15:49:45,108 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places.
[2024-06-14 15:49:45,108 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 205 transitions, 2509 flow
[2024-06-14 15:49:45,108 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:45,108 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:45,108 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:45,108 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 15:49:45,108 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-14 15:49:45,109 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:45,109 INFO  L85        PathProgramCache]: Analyzing trace with hash 642783770, now seen corresponding path program 2 times
[2024-06-14 15:49:45,109 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:45,109 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644743976]
[2024-06-14 15:49:45,109 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:45,109 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:45,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:50,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:50,574 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:50,574 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644743976]
[2024-06-14 15:49:50,575 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644743976] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:50,575 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:50,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:49:50,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235469403]
[2024-06-14 15:49:50,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:50,575 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:49:50,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:50,576 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:49:50,576 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:49:50,680 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:50,680 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 205 transitions, 2509 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:50,680 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:50,680 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:50,680 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:51,898 INFO  L124   PetriNetUnfolderBase]: 2692/3936 cut-off events.
[2024-06-14 15:49:51,898 INFO  L125   PetriNetUnfolderBase]: For 72778/72789 co-relation queries the response was YES.
[2024-06-14 15:49:51,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27624 conditions, 3936 events. 2692/3936 cut-off events. For 72778/72789 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 18459 event pairs, 676 based on Foata normal form. 10/3943 useless extension candidates. Maximal degree in co-relation 27559. Up to 3589 conditions per place. 
[2024-06-14 15:49:51,927 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 189 selfloop transitions, 58 changer transitions 0/250 dead transitions.
[2024-06-14 15:49:51,927 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 250 transitions, 3392 flow
[2024-06-14 15:49:51,930 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:51,930 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:51,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-14 15:49:51,930 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42378048780487804
[2024-06-14 15:49:51,931 INFO  L175             Difference]: Start difference. First operand has 126 places, 205 transitions, 2509 flow. Second operand 8 states and 139 transitions.
[2024-06-14 15:49:51,931 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 250 transitions, 3392 flow
[2024-06-14 15:49:52,015 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 250 transitions, 3232 flow, removed 79 selfloop flow, removed 1 redundant places.
[2024-06-14 15:49:52,019 INFO  L231             Difference]: Finished difference. Result has 135 places, 220 transitions, 2765 flow
[2024-06-14 15:49:52,019 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2399, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2765, PETRI_PLACES=135, PETRI_TRANSITIONS=220}
[2024-06-14 15:49:52,019 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places.
[2024-06-14 15:49:52,019 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 220 transitions, 2765 flow
[2024-06-14 15:49:52,019 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:52,019 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:52,020 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:52,020 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 15:49:52,020 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-14 15:49:52,020 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:52,020 INFO  L85        PathProgramCache]: Analyzing trace with hash 643050680, now seen corresponding path program 3 times
[2024-06-14 15:49:52,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:52,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293509894]
[2024-06-14 15:49:52,020 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:52,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:52,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:57,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:57,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:57,740 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293509894]
[2024-06-14 15:49:57,740 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293509894] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:57,740 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:57,740 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:49:57,740 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304604910]
[2024-06-14 15:49:57,740 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:57,740 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:49:57,741 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:57,741 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:49:57,741 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:49:57,911 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:49:57,911 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 220 transitions, 2765 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:57,911 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:57,911 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:49:57,912 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:59,129 INFO  L124   PetriNetUnfolderBase]: 2681/3917 cut-off events.
[2024-06-14 15:49:59,129 INFO  L125   PetriNetUnfolderBase]: For 76857/76868 co-relation queries the response was YES.
[2024-06-14 15:49:59,143 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28058 conditions, 3917 events. 2681/3917 cut-off events. For 76857/76868 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 18382 event pairs, 706 based on Foata normal form. 10/3924 useless extension candidates. Maximal degree in co-relation 27988. Up to 3777 conditions per place. 
[2024-06-14 15:49:59,156 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 207 selfloop transitions, 41 changer transitions 0/251 dead transitions.
[2024-06-14 15:49:59,156 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 251 transitions, 3484 flow
[2024-06-14 15:49:59,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:59,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:59,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions.
[2024-06-14 15:49:59,159 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39634146341463417
[2024-06-14 15:49:59,159 INFO  L175             Difference]: Start difference. First operand has 135 places, 220 transitions, 2765 flow. Second operand 8 states and 130 transitions.
[2024-06-14 15:49:59,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 251 transitions, 3484 flow
[2024-06-14 15:49:59,246 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 251 transitions, 3345 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-14 15:49:59,249 INFO  L231             Difference]: Finished difference. Result has 139 places, 226 transitions, 2829 flow
[2024-06-14 15:49:59,249 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2640, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2829, PETRI_PLACES=139, PETRI_TRANSITIONS=226}
[2024-06-14 15:49:59,250 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places.
[2024-06-14 15:49:59,250 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 226 transitions, 2829 flow
[2024-06-14 15:49:59,250 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:49:59,250 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:59,250 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:59,250 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 15:49:59,250 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:59,251 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:59,251 INFO  L85        PathProgramCache]: Analyzing trace with hash 635426323, now seen corresponding path program 5 times
[2024-06-14 15:49:59,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:59,251 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350269610]
[2024-06-14 15:49:59,251 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:59,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:59,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:05,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-14 15:50:05,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:05,005 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350269610]
[2024-06-14 15:50:05,005 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350269610] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:05,005 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:05,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:50:05,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783497821]
[2024-06-14 15:50:05,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:05,006 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:50:05,006 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:05,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:50:05,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:50:05,163 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:50:05,163 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 226 transitions, 2829 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:50:05,163 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:05,164 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:50:05,164 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:06,590 INFO  L124   PetriNetUnfolderBase]: 2983/4340 cut-off events.
[2024-06-14 15:50:06,590 INFO  L125   PetriNetUnfolderBase]: For 94196/94207 co-relation queries the response was YES.
[2024-06-14 15:50:06,610 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31616 conditions, 4340 events. 2983/4340 cut-off events. For 94196/94207 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20667 event pairs, 672 based on Foata normal form. 14/4351 useless extension candidates. Maximal degree in co-relation 31545. Up to 3685 conditions per place. 
[2024-06-14 15:50:06,627 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 204 selfloop transitions, 87 changer transitions 0/294 dead transitions.
[2024-06-14 15:50:06,627 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 294 transitions, 4089 flow
[2024-06-14 15:50:06,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:50:06,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:50:06,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions.
[2024-06-14 15:50:06,628 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44878048780487806
[2024-06-14 15:50:06,628 INFO  L175             Difference]: Start difference. First operand has 139 places, 226 transitions, 2829 flow. Second operand 10 states and 184 transitions.
[2024-06-14 15:50:06,628 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 294 transitions, 4089 flow
[2024-06-14 15:50:06,754 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 294 transitions, 3997 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-14 15:50:06,757 INFO  L231             Difference]: Finished difference. Result has 146 places, 249 transitions, 3320 flow
[2024-06-14 15:50:06,757 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2737, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3320, PETRI_PLACES=146, PETRI_TRANSITIONS=249}
[2024-06-14 15:50:06,758 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places.
[2024-06-14 15:50:06,758 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 249 transitions, 3320 flow
[2024-06-14 15:50:06,758 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:50:06,758 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:06,758 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:06,758 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 15:50:06,758 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-14 15:50:06,759 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:06,759 INFO  L85        PathProgramCache]: Analyzing trace with hash 635432120, now seen corresponding path program 4 times
[2024-06-14 15:50:06,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:06,759 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499259878]
[2024-06-14 15:50:06,759 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:06,759 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:06,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:12,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:12,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:12,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499259878]
[2024-06-14 15:50:12,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499259878] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:12,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:12,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:50:12,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043159031]
[2024-06-14 15:50:12,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:12,505 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:50:12,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:12,509 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:50:12,509 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:50:12,605 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:50:12,605 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 249 transitions, 3320 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:50:12,605 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:12,605 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:50:12,606 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:13,972 INFO  L124   PetriNetUnfolderBase]: 2989/4347 cut-off events.
[2024-06-14 15:50:13,972 INFO  L125   PetriNetUnfolderBase]: For 104659/104670 co-relation queries the response was YES.
[2024-06-14 15:50:13,990 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33323 conditions, 4347 events. 2989/4347 cut-off events. For 104659/104670 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 20711 event pairs, 761 based on Foata normal form. 13/4357 useless extension candidates. Maximal degree in co-relation 33248. Up to 4199 conditions per place. 
[2024-06-14 15:50:14,005 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 236 selfloop transitions, 42 changer transitions 0/281 dead transitions.
[2024-06-14 15:50:14,005 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 281 transitions, 4066 flow
[2024-06-14 15:50:14,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:50:14,006 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:50:14,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-14 15:50:14,006 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4037940379403794
[2024-06-14 15:50:14,006 INFO  L175             Difference]: Start difference. First operand has 146 places, 249 transitions, 3320 flow. Second operand 9 states and 149 transitions.
[2024-06-14 15:50:14,006 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 281 transitions, 4066 flow
[2024-06-14 15:50:14,149 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 281 transitions, 3809 flow, removed 117 selfloop flow, removed 3 redundant places.
[2024-06-14 15:50:14,153 INFO  L231             Difference]: Finished difference. Result has 152 places, 253 transitions, 3242 flow
[2024-06-14 15:50:14,153 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3077, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3242, PETRI_PLACES=152, PETRI_TRANSITIONS=253}
[2024-06-14 15:50:14,153 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places.
[2024-06-14 15:50:14,153 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 253 transitions, 3242 flow
[2024-06-14 15:50:14,154 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:50:14,154 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:14,154 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:14,154 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 15:50:14,154 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-14 15:50:14,154 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:14,155 INFO  L85        PathProgramCache]: Analyzing trace with hash 635431903, now seen corresponding path program 6 times
[2024-06-14 15:50:14,155 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:14,155 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832813017]
[2024-06-14 15:50:14,155 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:14,155 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:14,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:19,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:19,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:19,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832813017]
[2024-06-14 15:50:19,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832813017] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:19,795 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:19,795 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:50:19,795 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789750404]
[2024-06-14 15:50:19,795 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:19,795 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:50:19,795 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:19,795 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:50:19,796 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:50:19,959 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:50:19,960 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 253 transitions, 3242 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:50:19,960 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:19,960 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:50:19,960 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:21,375 INFO  L124   PetriNetUnfolderBase]: 3045/4429 cut-off events.
[2024-06-14 15:50:21,375 INFO  L125   PetriNetUnfolderBase]: For 109752/109763 co-relation queries the response was YES.
[2024-06-14 15:50:21,396 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33096 conditions, 4429 events. 3045/4429 cut-off events. For 109752/109763 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 21082 event pairs, 672 based on Foata normal form. 24/4450 useless extension candidates. Maximal degree in co-relation 33019. Up to 3734 conditions per place. 
[2024-06-14 15:50:21,414 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 199 selfloop transitions, 95 changer transitions 0/297 dead transitions.
[2024-06-14 15:50:21,414 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 297 transitions, 4204 flow
[2024-06-14 15:50:21,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:50:21,415 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:50:21,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-14 15:50:21,415 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44715447154471544
[2024-06-14 15:50:21,415 INFO  L175             Difference]: Start difference. First operand has 152 places, 253 transitions, 3242 flow. Second operand 9 states and 165 transitions.
[2024-06-14 15:50:21,415 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 297 transitions, 4204 flow
[2024-06-14 15:50:21,574 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 297 transitions, 4087 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-14 15:50:21,578 INFO  L231             Difference]: Finished difference. Result has 154 places, 262 transitions, 3472 flow
[2024-06-14 15:50:21,578 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3125, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3472, PETRI_PLACES=154, PETRI_TRANSITIONS=262}
[2024-06-14 15:50:21,578 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places.
[2024-06-14 15:50:21,578 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 262 transitions, 3472 flow
[2024-06-14 15:50:21,578 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:50:21,578 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:21,578 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:21,578 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 15:50:21,579 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:21,579 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:21,579 INFO  L85        PathProgramCache]: Analyzing trace with hash -923011563, now seen corresponding path program 1 times
[2024-06-14 15:50:21,579 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:21,579 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577600312]
[2024-06-14 15:50:21,579 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:21,579 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:21,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:30,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:30,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:30,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577600312]
[2024-06-14 15:50:30,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577600312] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:30,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:30,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:50:30,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754594414]
[2024-06-14 15:50:30,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:30,318 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:50:30,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:30,318 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:50:30,318 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:50:30,447 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:50:30,447 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 262 transitions, 3472 flow. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:30,447 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:30,447 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:50:30,448 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:31,682 INFO  L124   PetriNetUnfolderBase]: 3033/4411 cut-off events.
[2024-06-14 15:50:31,682 INFO  L125   PetriNetUnfolderBase]: For 111846/111857 co-relation queries the response was YES.
[2024-06-14 15:50:31,701 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33716 conditions, 4411 events. 3033/4411 cut-off events. For 111846/111857 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 21033 event pairs, 771 based on Foata normal form. 12/4420 useless extension candidates. Maximal degree in co-relation 33638. Up to 4361 conditions per place. 
[2024-06-14 15:50:31,715 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 256 selfloop transitions, 12 changer transitions 0/271 dead transitions.
[2024-06-14 15:50:31,715 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 271 transitions, 4032 flow
[2024-06-14 15:50:31,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:50:31,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:50:31,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions.
[2024-06-14 15:50:31,716 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-14 15:50:31,716 INFO  L175             Difference]: Start difference. First operand has 154 places, 262 transitions, 3472 flow. Second operand 5 states and 82 transitions.
[2024-06-14 15:50:31,716 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 271 transitions, 4032 flow
[2024-06-14 15:50:31,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 271 transitions, 3864 flow, removed 53 selfloop flow, removed 4 redundant places.
[2024-06-14 15:50:31,863 INFO  L231             Difference]: Finished difference. Result has 155 places, 262 transitions, 3335 flow
[2024-06-14 15:50:31,863 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3304, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3335, PETRI_PLACES=155, PETRI_TRANSITIONS=262}
[2024-06-14 15:50:31,863 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places.
[2024-06-14 15:50:31,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 262 transitions, 3335 flow
[2024-06-14 15:50:31,864 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:31,864 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:31,864 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:31,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 15:50:31,864 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-14 15:50:31,864 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:31,864 INFO  L85        PathProgramCache]: Analyzing trace with hash 1253583042, now seen corresponding path program 1 times
[2024-06-14 15:50:31,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:31,864 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149384405]
[2024-06-14 15:50:31,864 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:31,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:31,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:37,476 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:37,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:37,477 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149384405]
[2024-06-14 15:50:37,477 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149384405] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:37,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:37,477 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:50:37,477 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337024110]
[2024-06-14 15:50:37,477 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:37,477 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:50:37,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:37,478 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:50:37,478 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:50:37,637 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:50:37,637 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 262 transitions, 3335 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-14 15:50:37,637 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:37,637 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:50:37,638 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:39,053 INFO  L124   PetriNetUnfolderBase]: 2980/4353 cut-off events.
[2024-06-14 15:50:39,053 INFO  L125   PetriNetUnfolderBase]: For 120878/120929 co-relation queries the response was YES.
[2024-06-14 15:50:39,071 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33425 conditions, 4353 events. 2980/4353 cut-off events. For 120878/120929 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 21018 event pairs, 602 based on Foata normal form. 18/4323 useless extension candidates. Maximal degree in co-relation 33345. Up to 4114 conditions per place. 
[2024-06-14 15:50:39,086 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 231 selfloop transitions, 20 changer transitions 0/288 dead transitions.
[2024-06-14 15:50:39,086 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 288 transitions, 3949 flow
[2024-06-14 15:50:39,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:50:39,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:50:39,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-14 15:50:39,088 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42160278745644597
[2024-06-14 15:50:39,088 INFO  L175             Difference]: Start difference. First operand has 155 places, 262 transitions, 3335 flow. Second operand 7 states and 121 transitions.
[2024-06-14 15:50:39,088 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 288 transitions, 3949 flow
[2024-06-14 15:50:39,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 288 transitions, 3925 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-14 15:50:39,226 INFO  L231             Difference]: Finished difference. Result has 158 places, 264 transitions, 3414 flow
[2024-06-14 15:50:39,226 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3311, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3414, PETRI_PLACES=158, PETRI_TRANSITIONS=264}
[2024-06-14 15:50:39,226 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 116 predicate places.
[2024-06-14 15:50:39,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 264 transitions, 3414 flow
[2024-06-14 15:50:39,227 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-14 15:50:39,227 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:39,227 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:39,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 15:50:39,227 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-14 15:50:39,227 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:39,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 1253643492, now seen corresponding path program 2 times
[2024-06-14 15:50:39,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:39,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415624851]
[2024-06-14 15:50:39,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:39,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:39,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:45,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:45,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:45,124 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415624851]
[2024-06-14 15:50:45,124 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415624851] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:45,124 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:45,124 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:50:45,124 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655430952]
[2024-06-14 15:50:45,124 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:45,124 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:50:45,124 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:45,125 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:50:45,125 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:50:45,290 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:50:45,290 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 264 transitions, 3414 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-14 15:50:45,290 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:45,290 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:50:45,290 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:46,604 INFO  L124   PetriNetUnfolderBase]: 2999/4384 cut-off events.
[2024-06-14 15:50:46,604 INFO  L125   PetriNetUnfolderBase]: For 130748/130806 co-relation queries the response was YES.
[2024-06-14 15:50:46,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34235 conditions, 4384 events. 2999/4384 cut-off events. For 130748/130806 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 21185 event pairs, 698 based on Foata normal form. 16/4348 useless extension candidates. Maximal degree in co-relation 34154. Up to 4133 conditions per place. 
[2024-06-14 15:50:46,649 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 221 selfloop transitions, 32 changer transitions 0/290 dead transitions.
[2024-06-14 15:50:46,649 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 290 transitions, 4040 flow
[2024-06-14 15:50:46,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:50:46,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:50:46,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-14 15:50:46,651 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4250871080139373
[2024-06-14 15:50:46,651 INFO  L175             Difference]: Start difference. First operand has 158 places, 264 transitions, 3414 flow. Second operand 7 states and 122 transitions.
[2024-06-14 15:50:46,651 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 290 transitions, 4040 flow
[2024-06-14 15:50:46,815 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 290 transitions, 3963 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-14 15:50:46,818 INFO  L231             Difference]: Finished difference. Result has 160 places, 266 transitions, 3473 flow
[2024-06-14 15:50:46,819 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3337, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3473, PETRI_PLACES=160, PETRI_TRANSITIONS=266}
[2024-06-14 15:50:46,819 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places.
[2024-06-14 15:50:46,820 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 266 transitions, 3473 flow
[2024-06-14 15:50:46,820 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-14 15:50:46,820 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:46,820 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:46,820 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 15:50:46,820 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-14 15:50:46,820 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:46,820 INFO  L85        PathProgramCache]: Analyzing trace with hash 1256324806, now seen corresponding path program 1 times
[2024-06-14 15:50:46,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:46,820 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378268291]
[2024-06-14 15:50:46,820 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:46,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:46,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:52,176 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:52,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:52,177 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378268291]
[2024-06-14 15:50:52,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378268291] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:52,177 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:52,177 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:50:52,177 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458179170]
[2024-06-14 15:50:52,177 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:52,177 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:50:52,177 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:52,177 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:50:52,178 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:50:52,347 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:50:52,347 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 266 transitions, 3473 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:50:52,347 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:52,347 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:50:52,347 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:53,940 INFO  L124   PetriNetUnfolderBase]: 3072/4475 cut-off events.
[2024-06-14 15:50:53,940 INFO  L125   PetriNetUnfolderBase]: For 132509/132520 co-relation queries the response was YES.
[2024-06-14 15:50:53,959 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34844 conditions, 4475 events. 3072/4475 cut-off events. For 132509/132520 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 21456 event pairs, 648 based on Foata normal form. 14/4486 useless extension candidates. Maximal degree in co-relation 34762. Up to 4141 conditions per place. 
[2024-06-14 15:50:53,973 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 248 selfloop transitions, 57 changer transitions 0/308 dead transitions.
[2024-06-14 15:50:53,973 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 308 transitions, 4440 flow
[2024-06-14 15:50:53,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:50:53,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:50:53,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-14 15:50:53,974 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4173441734417344
[2024-06-14 15:50:53,974 INFO  L175             Difference]: Start difference. First operand has 160 places, 266 transitions, 3473 flow. Second operand 9 states and 154 transitions.
[2024-06-14 15:50:53,974 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 308 transitions, 4440 flow
[2024-06-14 15:50:54,142 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 308 transitions, 4324 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-14 15:50:54,145 INFO  L231             Difference]: Finished difference. Result has 165 places, 273 transitions, 3668 flow
[2024-06-14 15:50:54,146 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3361, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3668, PETRI_PLACES=165, PETRI_TRANSITIONS=273}
[2024-06-14 15:50:54,146 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 123 predicate places.
[2024-06-14 15:50:54,146 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 273 transitions, 3668 flow
[2024-06-14 15:50:54,146 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:50:54,147 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:54,147 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:54,147 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 15:50:54,147 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-14 15:50:54,147 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:54,147 INFO  L85        PathProgramCache]: Analyzing trace with hash 1256444962, now seen corresponding path program 1 times
[2024-06-14 15:50:54,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:54,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572418978]
[2024-06-14 15:50:54,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:54,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:54,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:59,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:59,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:59,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572418978]
[2024-06-14 15:50:59,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572418978] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:59,962 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:59,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:50:59,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329900430]
[2024-06-14 15:50:59,962 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:59,962 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:50:59,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:59,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:50:59,963 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:00,099 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:00,100 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 273 transitions, 3668 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:51:00,100 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:00,100 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:00,100 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:01,656 INFO  L124   PetriNetUnfolderBase]: 3132/4562 cut-off events.
[2024-06-14 15:51:01,656 INFO  L125   PetriNetUnfolderBase]: For 142530/142543 co-relation queries the response was YES.
[2024-06-14 15:51:01,676 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36147 conditions, 4562 events. 3132/4562 cut-off events. For 142530/142543 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 21951 event pairs, 693 based on Foata normal form. 20/4579 useless extension candidates. Maximal degree in co-relation 36063. Up to 4242 conditions per place. 
[2024-06-14 15:51:01,691 INFO  L140   encePairwiseOnDemand]: 25/41 looper letters, 267 selfloop transitions, 51 changer transitions 0/321 dead transitions.
[2024-06-14 15:51:01,692 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 321 transitions, 4733 flow
[2024-06-14 15:51:01,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:51:01,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:51:01,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions.
[2024-06-14 15:51:01,693 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.424390243902439
[2024-06-14 15:51:01,693 INFO  L175             Difference]: Start difference. First operand has 165 places, 273 transitions, 3668 flow. Second operand 10 states and 174 transitions.
[2024-06-14 15:51:01,693 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 321 transitions, 4733 flow
[2024-06-14 15:51:01,879 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 321 transitions, 4612 flow, removed 46 selfloop flow, removed 5 redundant places.
[2024-06-14 15:51:01,883 INFO  L231             Difference]: Finished difference. Result has 170 places, 280 transitions, 3808 flow
[2024-06-14 15:51:01,884 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3547, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3808, PETRI_PLACES=170, PETRI_TRANSITIONS=280}
[2024-06-14 15:51:01,884 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 128 predicate places.
[2024-06-14 15:51:01,884 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 280 transitions, 3808 flow
[2024-06-14 15:51:01,884 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:51:01,884 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:01,884 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:01,885 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 15:51:01,885 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-14 15:51:01,885 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:01,885 INFO  L85        PathProgramCache]: Analyzing trace with hash -351185004, now seen corresponding path program 1 times
[2024-06-14 15:51:01,885 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:01,885 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068798344]
[2024-06-14 15:51:01,885 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:01,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:01,919 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:07,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:07,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:07,818 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068798344]
[2024-06-14 15:51:07,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068798344] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:07,818 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:07,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:07,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610361513]
[2024-06-14 15:51:07,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:07,818 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:07,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:07,818 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:07,819 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:08,078 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:08,078 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 280 transitions, 3808 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:51:08,078 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:08,078 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:08,078 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:09,650 INFO  L124   PetriNetUnfolderBase]: 3263/4770 cut-off events.
[2024-06-14 15:51:09,650 INFO  L125   PetriNetUnfolderBase]: For 161551/161562 co-relation queries the response was YES.
[2024-06-14 15:51:09,671 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37874 conditions, 4770 events. 3263/4770 cut-off events. For 161551/161562 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 23308 event pairs, 691 based on Foata normal form. 36/4803 useless extension candidates. Maximal degree in co-relation 37789. Up to 4396 conditions per place. 
[2024-06-14 15:51:09,686 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 262 selfloop transitions, 54 changer transitions 0/319 dead transitions.
[2024-06-14 15:51:09,686 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 319 transitions, 4706 flow
[2024-06-14 15:51:09,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:51:09,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:51:09,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-14 15:51:09,687 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43089430894308944
[2024-06-14 15:51:09,687 INFO  L175             Difference]: Start difference. First operand has 170 places, 280 transitions, 3808 flow. Second operand 9 states and 159 transitions.
[2024-06-14 15:51:09,687 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 319 transitions, 4706 flow
[2024-06-14 15:51:09,865 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 319 transitions, 4552 flow, removed 37 selfloop flow, removed 7 redundant places.
[2024-06-14 15:51:09,868 INFO  L231             Difference]: Finished difference. Result has 172 places, 284 transitions, 3876 flow
[2024-06-14 15:51:09,869 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3654, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3876, PETRI_PLACES=172, PETRI_TRANSITIONS=284}
[2024-06-14 15:51:09,869 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places.
[2024-06-14 15:51:09,869 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 284 transitions, 3876 flow
[2024-06-14 15:51:09,870 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:51:09,870 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:09,870 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:09,870 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 15:51:09,870 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:09,870 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:09,870 INFO  L85        PathProgramCache]: Analyzing trace with hash -351191762, now seen corresponding path program 2 times
[2024-06-14 15:51:09,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:09,871 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574029531]
[2024-06-14 15:51:09,871 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:09,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:09,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:15,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:15,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:15,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574029531]
[2024-06-14 15:51:15,447 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574029531] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:15,447 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:15,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:51:15,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747274384]
[2024-06-14 15:51:15,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:15,448 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:51:15,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:15,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:51:15,449 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:51:15,586 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:15,586 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 284 transitions, 3876 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:15,586 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:15,587 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:15,587 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:17,051 INFO  L124   PetriNetUnfolderBase]: 3243/4746 cut-off events.
[2024-06-14 15:51:17,052 INFO  L125   PetriNetUnfolderBase]: For 159397/159408 co-relation queries the response was YES.
[2024-06-14 15:51:17,076 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38007 conditions, 4746 events. 3243/4746 cut-off events. For 159397/159408 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23201 event pairs, 652 based on Foata normal form. 14/4757 useless extension candidates. Maximal degree in co-relation 37921. Up to 3897 conditions per place. 
[2024-06-14 15:51:17,093 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 198 selfloop transitions, 122 changer transitions 0/323 dead transitions.
[2024-06-14 15:51:17,094 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 323 transitions, 4810 flow
[2024-06-14 15:51:17,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:51:17,094 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:51:17,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 15:51:17,094 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573170731707317
[2024-06-14 15:51:17,095 INFO  L175             Difference]: Start difference. First operand has 172 places, 284 transitions, 3876 flow. Second operand 8 states and 150 transitions.
[2024-06-14 15:51:17,095 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 323 transitions, 4810 flow
[2024-06-14 15:51:17,303 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 323 transitions, 4643 flow, removed 44 selfloop flow, removed 6 redundant places.
[2024-06-14 15:51:17,308 INFO  L231             Difference]: Finished difference. Result has 176 places, 289 transitions, 4152 flow
[2024-06-14 15:51:17,308 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3709, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4152, PETRI_PLACES=176, PETRI_TRANSITIONS=289}
[2024-06-14 15:51:17,308 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 134 predicate places.
[2024-06-14 15:51:17,308 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 289 transitions, 4152 flow
[2024-06-14 15:51:17,308 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:17,309 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:17,309 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:17,309 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 15:51:17,309 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-14 15:51:17,309 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:17,309 INFO  L85        PathProgramCache]: Analyzing trace with hash 1371731172, now seen corresponding path program 3 times
[2024-06-14 15:51:17,309 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:17,309 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328404777]
[2024-06-14 15:51:17,309 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:17,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:17,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:23,818 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:23,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:23,818 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328404777]
[2024-06-14 15:51:23,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328404777] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:23,818 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:23,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:23,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441913422]
[2024-06-14 15:51:23,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:23,819 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:23,819 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:23,819 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:23,819 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:23,998 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:51:23,998 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 289 transitions, 4152 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-14 15:51:23,998 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:23,998 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:51:24,000 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:25,371 INFO  L124   PetriNetUnfolderBase]: 3151/4629 cut-off events.
[2024-06-14 15:51:25,371 INFO  L125   PetriNetUnfolderBase]: For 168114/168164 co-relation queries the response was YES.
[2024-06-14 15:51:25,395 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38087 conditions, 4629 events. 3151/4629 cut-off events. For 168114/168164 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 22783 event pairs, 642 based on Foata normal form. 12/4585 useless extension candidates. Maximal degree in co-relation 37998. Up to 4288 conditions per place. 
[2024-06-14 15:51:25,412 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 219 selfloop transitions, 55 changer transitions 0/313 dead transitions.
[2024-06-14 15:51:25,412 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 313 transitions, 4824 flow
[2024-06-14 15:51:25,413 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:51:25,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:51:25,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-14 15:51:25,413 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 15:51:25,414 INFO  L175             Difference]: Start difference. First operand has 176 places, 289 transitions, 4152 flow. Second operand 7 states and 123 transitions.
[2024-06-14 15:51:25,414 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 313 transitions, 4824 flow
[2024-06-14 15:51:25,629 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 313 transitions, 4620 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-14 15:51:25,633 INFO  L231             Difference]: Finished difference. Result has 178 places, 291 transitions, 4135 flow
[2024-06-14 15:51:25,633 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3948, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4135, PETRI_PLACES=178, PETRI_TRANSITIONS=291}
[2024-06-14 15:51:25,634 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places.
[2024-06-14 15:51:25,634 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 291 transitions, 4135 flow
[2024-06-14 15:51:25,634 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-14 15:51:25,634 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:25,634 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:25,634 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 15:51:25,634 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-14 15:51:25,635 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:25,635 INFO  L85        PathProgramCache]: Analyzing trace with hash -1776618748, now seen corresponding path program 3 times
[2024-06-14 15:51:25,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:25,635 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599243226]
[2024-06-14 15:51:25,635 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:25,635 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:25,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:31,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:31,135 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:31,135 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599243226]
[2024-06-14 15:51:31,135 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599243226] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:31,135 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:31,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:31,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120244342]
[2024-06-14 15:51:31,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:31,135 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:31,136 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:31,136 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:31,136 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:31,248 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:31,248 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 291 transitions, 4135 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:51:31,248 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:31,248 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:31,248 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:32,824 INFO  L124   PetriNetUnfolderBase]: 3290/4813 cut-off events.
[2024-06-14 15:51:32,824 INFO  L125   PetriNetUnfolderBase]: For 166791/166802 co-relation queries the response was YES.
[2024-06-14 15:51:32,850 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38800 conditions, 4813 events. 3290/4813 cut-off events. For 166791/166802 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 23624 event pairs, 646 based on Foata normal form. 14/4824 useless extension candidates. Maximal degree in co-relation 38710. Up to 4309 conditions per place. 
[2024-06-14 15:51:32,869 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 260 selfloop transitions, 86 changer transitions 0/349 dead transitions.
[2024-06-14 15:51:32,869 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 349 transitions, 5245 flow
[2024-06-14 15:51:32,870 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:51:32,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:51:32,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions.
[2024-06-14 15:51:32,870 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43458980044345896
[2024-06-14 15:51:32,870 INFO  L175             Difference]: Start difference. First operand has 178 places, 291 transitions, 4135 flow. Second operand 11 states and 196 transitions.
[2024-06-14 15:51:32,870 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 349 transitions, 5245 flow
[2024-06-14 15:51:33,126 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 349 transitions, 5094 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-14 15:51:33,131 INFO  L231             Difference]: Finished difference. Result has 185 places, 302 transitions, 4361 flow
[2024-06-14 15:51:33,131 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3984, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4361, PETRI_PLACES=185, PETRI_TRANSITIONS=302}
[2024-06-14 15:51:33,131 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places.
[2024-06-14 15:51:33,132 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 302 transitions, 4361 flow
[2024-06-14 15:51:33,132 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:51:33,132 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:33,132 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:33,132 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 15:51:33,132 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-14 15:51:33,132 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:33,132 INFO  L85        PathProgramCache]: Analyzing trace with hash -1776445768, now seen corresponding path program 4 times
[2024-06-14 15:51:33,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:33,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507443425]
[2024-06-14 15:51:33,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:33,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:33,168 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:38,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:38,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:38,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507443425]
[2024-06-14 15:51:38,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507443425] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:38,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:38,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:38,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7136222]
[2024-06-14 15:51:38,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:38,647 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:38,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:38,647 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:38,647 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:38,774 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:38,774 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 302 transitions, 4361 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:51:38,774 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:38,774 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:38,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:40,324 INFO  L124   PetriNetUnfolderBase]: 3270/4787 cut-off events.
[2024-06-14 15:51:40,324 INFO  L125   PetriNetUnfolderBase]: For 169226/169237 co-relation queries the response was YES.
[2024-06-14 15:51:40,349 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38895 conditions, 4787 events. 3270/4787 cut-off events. For 169226/169237 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23447 event pairs, 636 based on Foata normal form. 14/4798 useless extension candidates. Maximal degree in co-relation 38803. Up to 4201 conditions per place. 
[2024-06-14 15:51:40,367 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 239 selfloop transitions, 100 changer transitions 0/342 dead transitions.
[2024-06-14 15:51:40,367 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 342 transitions, 5230 flow
[2024-06-14 15:51:40,367 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:51:40,367 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:51:40,368 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions.
[2024-06-14 15:51:40,368 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43658536585365854
[2024-06-14 15:51:40,368 INFO  L175             Difference]: Start difference. First operand has 185 places, 302 transitions, 4361 flow. Second operand 10 states and 179 transitions.
[2024-06-14 15:51:40,368 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 342 transitions, 5230 flow
[2024-06-14 15:51:40,604 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 342 transitions, 4984 flow, removed 49 selfloop flow, removed 8 redundant places.
[2024-06-14 15:51:40,608 INFO  L231             Difference]: Finished difference. Result has 188 places, 303 transitions, 4362 flow
[2024-06-14 15:51:40,608 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4115, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4362, PETRI_PLACES=188, PETRI_TRANSITIONS=303}
[2024-06-14 15:51:40,609 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 146 predicate places.
[2024-06-14 15:51:40,609 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 303 transitions, 4362 flow
[2024-06-14 15:51:40,609 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:51:40,609 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:40,609 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:40,609 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 15:51:40,609 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-14 15:51:40,610 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:40,610 INFO  L85        PathProgramCache]: Analyzing trace with hash -1548537860, now seen corresponding path program 2 times
[2024-06-14 15:51:40,610 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:40,610 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682641688]
[2024-06-14 15:51:40,610 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:40,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:40,642 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:47,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:47,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:47,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682641688]
[2024-06-14 15:51:47,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682641688] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:47,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:47,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:47,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397708499]
[2024-06-14 15:51:47,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:47,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:47,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:47,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:47,260 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:47,377 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:47,378 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 303 transitions, 4362 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:51:47,378 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:47,378 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:47,378 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:48,869 INFO  L124   PetriNetUnfolderBase]: 3287/4812 cut-off events.
[2024-06-14 15:51:48,870 INFO  L125   PetriNetUnfolderBase]: For 174520/174531 co-relation queries the response was YES.
[2024-06-14 15:51:48,897 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39418 conditions, 4812 events. 3287/4812 cut-off events. For 174520/174531 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23627 event pairs, 774 based on Foata normal form. 12/4821 useless extension candidates. Maximal degree in co-relation 39324. Up to 4692 conditions per place. 
[2024-06-14 15:51:48,915 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 298 selfloop transitions, 32 changer transitions 0/333 dead transitions.
[2024-06-14 15:51:48,916 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 333 transitions, 5138 flow
[2024-06-14 15:51:48,917 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:51:48,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:51:48,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions.
[2024-06-14 15:51:48,924 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3821138211382114
[2024-06-14 15:51:48,924 INFO  L175             Difference]: Start difference. First operand has 188 places, 303 transitions, 4362 flow. Second operand 9 states and 141 transitions.
[2024-06-14 15:51:48,924 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 333 transitions, 5138 flow
[2024-06-14 15:51:49,170 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 333 transitions, 4929 flow, removed 9 selfloop flow, removed 7 redundant places.
[2024-06-14 15:51:49,175 INFO  L231             Difference]: Finished difference. Result has 190 places, 305 transitions, 4274 flow
[2024-06-14 15:51:49,175 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4153, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4274, PETRI_PLACES=190, PETRI_TRANSITIONS=305}
[2024-06-14 15:51:49,175 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 148 predicate places.
[2024-06-14 15:51:49,175 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 305 transitions, 4274 flow
[2024-06-14 15:51:49,175 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:51:49,175 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:49,176 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:49,176 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 15:51:49,176 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-14 15:51:49,176 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:49,176 INFO  L85        PathProgramCache]: Analyzing trace with hash -1776439010, now seen corresponding path program 3 times
[2024-06-14 15:51:49,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:49,176 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033436390]
[2024-06-14 15:51:49,176 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:49,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:49,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:55,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:55,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:55,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033436390]
[2024-06-14 15:51:55,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033436390] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:55,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:55,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:55,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028643760]
[2024-06-14 15:51:55,298 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:55,298 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:55,298 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:55,299 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:55,299 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:55,439 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:51:55,439 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 305 transitions, 4274 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:51:55,439 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:55,439 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:51:55,439 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:57,283 INFO  L124   PetriNetUnfolderBase]: 3660/5433 cut-off events.
[2024-06-14 15:51:57,283 INFO  L125   PetriNetUnfolderBase]: For 228371/228382 co-relation queries the response was YES.
[2024-06-14 15:51:57,312 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42483 conditions, 5433 events. 3660/5433 cut-off events. For 228371/228382 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 27647 event pairs, 723 based on Foata normal form. 94/5524 useless extension candidates. Maximal degree in co-relation 42388. Up to 4214 conditions per place. 
[2024-06-14 15:51:57,331 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 249 selfloop transitions, 101 changer transitions 0/353 dead transitions.
[2024-06-14 15:51:57,332 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 353 transitions, 5296 flow
[2024-06-14 15:51:57,332 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:51:57,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:51:57,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions.
[2024-06-14 15:51:57,333 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44634146341463415
[2024-06-14 15:51:57,333 INFO  L175             Difference]: Start difference. First operand has 190 places, 305 transitions, 4274 flow. Second operand 10 states and 183 transitions.
[2024-06-14 15:51:57,333 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 353 transitions, 5296 flow
[2024-06-14 15:51:57,569 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 353 transitions, 5197 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-14 15:51:57,574 INFO  L231             Difference]: Finished difference. Result has 194 places, 308 transitions, 4493 flow
[2024-06-14 15:51:57,574 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4175, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4493, PETRI_PLACES=194, PETRI_TRANSITIONS=308}
[2024-06-14 15:51:57,574 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places.
[2024-06-14 15:51:57,574 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 308 transitions, 4493 flow
[2024-06-14 15:51:57,575 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:51:57,575 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:57,575 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:57,575 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 15:51:57,575 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-14 15:51:57,575 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:57,575 INFO  L85        PathProgramCache]: Analyzing trace with hash -1539966980, now seen corresponding path program 4 times
[2024-06-14 15:51:57,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:57,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348849041]
[2024-06-14 15:51:57,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:57,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:57,608 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:03,971 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:03,971 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:03,971 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348849041]
[2024-06-14 15:52:03,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348849041] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:03,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:03,971 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:03,972 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415875020]
[2024-06-14 15:52:03,972 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:03,972 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:03,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:03,972 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:03,972 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:04,116 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:04,116 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 308 transitions, 4493 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:52:04,116 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:04,116 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:04,116 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:05,778 INFO  L124   PetriNetUnfolderBase]: 3677/5458 cut-off events.
[2024-06-14 15:52:05,778 INFO  L125   PetriNetUnfolderBase]: For 198639/198650 co-relation queries the response was YES.
[2024-06-14 15:52:05,810 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43663 conditions, 5458 events. 3677/5458 cut-off events. For 198639/198650 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 27922 event pairs, 900 based on Foata normal form. 12/5467 useless extension candidates. Maximal degree in co-relation 43567. Up to 5201 conditions per place. 
[2024-06-14 15:52:05,831 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 291 selfloop transitions, 52 changer transitions 0/346 dead transitions.
[2024-06-14 15:52:05,831 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 346 transitions, 5557 flow
[2024-06-14 15:52:05,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:52:05,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:52:05,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions.
[2024-06-14 15:52:05,833 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39295392953929537
[2024-06-14 15:52:05,834 INFO  L175             Difference]: Start difference. First operand has 194 places, 308 transitions, 4493 flow. Second operand 9 states and 145 transitions.
[2024-06-14 15:52:05,834 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 346 transitions, 5557 flow
[2024-06-14 15:52:06,137 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 346 transitions, 5265 flow, removed 52 selfloop flow, removed 8 redundant places.
[2024-06-14 15:52:06,142 INFO  L231             Difference]: Finished difference. Result has 196 places, 315 transitions, 4509 flow
[2024-06-14 15:52:06,142 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4239, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4509, PETRI_PLACES=196, PETRI_TRANSITIONS=315}
[2024-06-14 15:52:06,143 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places.
[2024-06-14 15:52:06,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 315 transitions, 4509 flow
[2024-06-14 15:52:06,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:52:06,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:06,143 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:06,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 15:52:06,143 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-14 15:52:06,144 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:06,144 INFO  L85        PathProgramCache]: Analyzing trace with hash -1540263650, now seen corresponding path program 5 times
[2024-06-14 15:52:06,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:06,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742350126]
[2024-06-14 15:52:06,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:06,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:06,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:12,835 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:12,835 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:12,835 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742350126]
[2024-06-14 15:52:12,835 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742350126] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:12,835 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:12,835 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:12,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909537172]
[2024-06-14 15:52:12,836 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:12,836 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:12,836 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:12,836 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:12,836 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:13,019 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:13,020 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 315 transitions, 4509 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:52:13,020 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:13,020 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:13,020 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:14,657 INFO  L124   PetriNetUnfolderBase]: 3669/5446 cut-off events.
[2024-06-14 15:52:14,657 INFO  L125   PetriNetUnfolderBase]: For 195134/195145 co-relation queries the response was YES.
[2024-06-14 15:52:14,690 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42718 conditions, 5446 events. 3669/5446 cut-off events. For 195134/195145 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 27829 event pairs, 938 based on Foata normal form. 12/5455 useless extension candidates. Maximal degree in co-relation 42620. Up to 5272 conditions per place. 
[2024-06-14 15:52:14,711 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 298 selfloop transitions, 46 changer transitions 0/347 dead transitions.
[2024-06-14 15:52:14,711 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 347 transitions, 5277 flow
[2024-06-14 15:52:14,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:52:14,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:52:14,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions.
[2024-06-14 15:52:14,713 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3804878048780488
[2024-06-14 15:52:14,713 INFO  L175             Difference]: Start difference. First operand has 196 places, 315 transitions, 4509 flow. Second operand 10 states and 156 transitions.
[2024-06-14 15:52:14,713 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 347 transitions, 5277 flow
[2024-06-14 15:52:15,009 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 347 transitions, 5121 flow, removed 53 selfloop flow, removed 5 redundant places.
[2024-06-14 15:52:15,014 INFO  L231             Difference]: Finished difference. Result has 201 places, 315 transitions, 4455 flow
[2024-06-14 15:52:15,014 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4353, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4455, PETRI_PLACES=201, PETRI_TRANSITIONS=315}
[2024-06-14 15:52:15,014 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places.
[2024-06-14 15:52:15,014 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 315 transitions, 4455 flow
[2024-06-14 15:52:15,015 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:52:15,015 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:15,015 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:15,015 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 15:52:15,015 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-14 15:52:15,015 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:15,015 INFO  L85        PathProgramCache]: Analyzing trace with hash 206370326, now seen corresponding path program 1 times
[2024-06-14 15:52:15,015 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:15,016 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459899397]
[2024-06-14 15:52:15,016 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:15,016 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:15,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:20,887 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:20,887 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:20,887 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459899397]
[2024-06-14 15:52:20,887 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459899397] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:20,887 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:20,887 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:52:20,888 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809052058]
[2024-06-14 15:52:20,888 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:20,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:52:20,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:20,888 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:52:20,889 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:52:21,137 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:21,137 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 315 transitions, 4455 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 15:52:21,137 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:21,137 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:21,137 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:23,136 INFO  L124   PetriNetUnfolderBase]: 3968/5902 cut-off events.
[2024-06-14 15:52:23,136 INFO  L125   PetriNetUnfolderBase]: For 233234/233245 co-relation queries the response was YES.
[2024-06-14 15:52:23,170 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46781 conditions, 5902 events. 3968/5902 cut-off events. For 233234/233245 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 30802 event pairs, 730 based on Foata normal form. 26/5925 useless extension candidates. Maximal degree in co-relation 46681. Up to 5345 conditions per place. 
[2024-06-14 15:52:23,192 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 338 selfloop transitions, 42 changer transitions 0/383 dead transitions.
[2024-06-14 15:52:23,192 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 383 transitions, 5994 flow
[2024-06-14 15:52:23,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:52:23,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:52:23,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions.
[2024-06-14 15:52:23,193 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44390243902439025
[2024-06-14 15:52:23,193 INFO  L175             Difference]: Start difference. First operand has 201 places, 315 transitions, 4455 flow. Second operand 10 states and 182 transitions.
[2024-06-14 15:52:23,193 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 383 transitions, 5994 flow
[2024-06-14 15:52:23,498 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 383 transitions, 5894 flow, removed 5 selfloop flow, removed 8 redundant places.
[2024-06-14 15:52:23,503 INFO  L231             Difference]: Finished difference. Result has 206 places, 331 transitions, 4778 flow
[2024-06-14 15:52:23,503 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4355, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4778, PETRI_PLACES=206, PETRI_TRANSITIONS=331}
[2024-06-14 15:52:23,503 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places.
[2024-06-14 15:52:23,503 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 331 transitions, 4778 flow
[2024-06-14 15:52:23,504 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 15:52:23,504 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:23,504 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:23,504 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 15:52:23,504 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:23,504 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:23,504 INFO  L85        PathProgramCache]: Analyzing trace with hash 208247996, now seen corresponding path program 2 times
[2024-06-14 15:52:23,504 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:23,504 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495078630]
[2024-06-14 15:52:23,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:23,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:23,546 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:29,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:29,918 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:29,918 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495078630]
[2024-06-14 15:52:29,918 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495078630] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:29,918 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:29,918 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:52:29,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93365601]
[2024-06-14 15:52:29,918 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:29,918 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:52:29,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:29,919 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:52:29,919 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:52:30,095 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:30,095 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 331 transitions, 4778 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 15:52:30,095 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:30,095 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:30,095 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:32,084 INFO  L124   PetriNetUnfolderBase]: 4068/6058 cut-off events.
[2024-06-14 15:52:32,084 INFO  L125   PetriNetUnfolderBase]: For 257983/257994 co-relation queries the response was YES.
[2024-06-14 15:52:32,121 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50251 conditions, 6058 events. 4068/6058 cut-off events. For 257983/257994 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 31878 event pairs, 899 based on Foata normal form. 26/6081 useless extension candidates. Maximal degree in co-relation 50147. Up to 5625 conditions per place. 
[2024-06-14 15:52:32,144 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 317 selfloop transitions, 65 changer transitions 0/385 dead transitions.
[2024-06-14 15:52:32,145 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 385 transitions, 6151 flow
[2024-06-14 15:52:32,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:52:32,145 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:52:32,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions.
[2024-06-14 15:52:32,145 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4317073170731707
[2024-06-14 15:52:32,146 INFO  L175             Difference]: Start difference. First operand has 206 places, 331 transitions, 4778 flow. Second operand 10 states and 177 transitions.
[2024-06-14 15:52:32,146 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 385 transitions, 6151 flow
[2024-06-14 15:52:32,599 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 385 transitions, 6010 flow, removed 61 selfloop flow, removed 3 redundant places.
[2024-06-14 15:52:32,603 INFO  L231             Difference]: Finished difference. Result has 215 places, 340 transitions, 5045 flow
[2024-06-14 15:52:32,604 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4637, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5045, PETRI_PLACES=215, PETRI_TRANSITIONS=340}
[2024-06-14 15:52:32,604 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places.
[2024-06-14 15:52:32,604 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 340 transitions, 5045 flow
[2024-06-14 15:52:32,604 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 15:52:32,604 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:32,604 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:32,605 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 15:52:32,605 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:32,605 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:32,605 INFO  L85        PathProgramCache]: Analyzing trace with hash 1850339744, now seen corresponding path program 3 times
[2024-06-14 15:52:32,605 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:32,605 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090179347]
[2024-06-14 15:52:32,605 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:32,605 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:32,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:38,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:38,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:38,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090179347]
[2024-06-14 15:52:38,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090179347] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:38,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:38,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:52:38,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793350851]
[2024-06-14 15:52:38,770 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:38,770 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:52:38,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:38,770 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:52:38,770 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:52:38,958 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:38,958 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 340 transitions, 5045 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 15:52:38,958 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:38,958 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:38,959 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:41,090 INFO  L124   PetriNetUnfolderBase]: 4305/6421 cut-off events.
[2024-06-14 15:52:41,090 INFO  L125   PetriNetUnfolderBase]: For 293081/293092 co-relation queries the response was YES.
[2024-06-14 15:52:41,134 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54274 conditions, 6421 events. 4305/6421 cut-off events. For 293081/293092 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 34320 event pairs, 997 based on Foata normal form. 26/6444 useless extension candidates. Maximal degree in co-relation 54166. Up to 5590 conditions per place. 
[2024-06-14 15:52:41,162 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 328 selfloop transitions, 66 changer transitions 0/397 dead transitions.
[2024-06-14 15:52:41,162 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 397 transitions, 6493 flow
[2024-06-14 15:52:41,163 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:52:41,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:52:41,163 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions.
[2024-06-14 15:52:41,163 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43414634146341463
[2024-06-14 15:52:41,163 INFO  L175             Difference]: Start difference. First operand has 215 places, 340 transitions, 5045 flow. Second operand 10 states and 178 transitions.
[2024-06-14 15:52:41,163 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 397 transitions, 6493 flow
[2024-06-14 15:52:41,799 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 397 transitions, 6336 flow, removed 41 selfloop flow, removed 6 redundant places.
[2024-06-14 15:52:41,804 INFO  L231             Difference]: Finished difference. Result has 220 places, 347 transitions, 5270 flow
[2024-06-14 15:52:41,805 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4888, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5270, PETRI_PLACES=220, PETRI_TRANSITIONS=347}
[2024-06-14 15:52:41,805 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 178 predicate places.
[2024-06-14 15:52:41,805 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 347 transitions, 5270 flow
[2024-06-14 15:52:41,805 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 15:52:41,805 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:41,806 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:41,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 15:52:41,806 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:41,806 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:41,806 INFO  L85        PathProgramCache]: Analyzing trace with hash -564379268, now seen corresponding path program 1 times
[2024-06-14 15:52:41,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:41,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827003578]
[2024-06-14 15:52:41,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:41,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:41,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:47,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-14 15:52:47,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:47,722 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827003578]
[2024-06-14 15:52:47,722 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827003578] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:47,722 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:47,723 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:47,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661221692]
[2024-06-14 15:52:47,723 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:47,723 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:47,723 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:47,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:47,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:47,901 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:47,902 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 347 transitions, 5270 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:47,902 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:47,902 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:47,902 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:50,098 INFO  L124   PetriNetUnfolderBase]: 4604/6924 cut-off events.
[2024-06-14 15:52:50,098 INFO  L125   PetriNetUnfolderBase]: For 356865/356876 co-relation queries the response was YES.
[2024-06-14 15:52:50,138 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57481 conditions, 6924 events. 4604/6924 cut-off events. For 356865/356876 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37816 event pairs, 994 based on Foata normal form. 78/6999 useless extension candidates. Maximal degree in co-relation 57371. Up to 5346 conditions per place. 
[2024-06-14 15:52:50,161 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 252 selfloop transitions, 140 changer transitions 0/395 dead transitions.
[2024-06-14 15:52:50,161 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 395 transitions, 6516 flow
[2024-06-14 15:52:50,161 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:52:50,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:52:50,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-14 15:52:50,162 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46883468834688347
[2024-06-14 15:52:50,162 INFO  L175             Difference]: Start difference. First operand has 220 places, 347 transitions, 5270 flow. Second operand 9 states and 173 transitions.
[2024-06-14 15:52:50,162 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 395 transitions, 6516 flow
[2024-06-14 15:52:50,690 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 395 transitions, 6276 flow, removed 63 selfloop flow, removed 7 redundant places.
[2024-06-14 15:52:50,695 INFO  L231             Difference]: Finished difference. Result has 222 places, 349 transitions, 5425 flow
[2024-06-14 15:52:50,696 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5030, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5425, PETRI_PLACES=222, PETRI_TRANSITIONS=349}
[2024-06-14 15:52:50,696 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places.
[2024-06-14 15:52:50,696 INFO  L495      AbstractCegarLoop]: Abstraction has has 222 places, 349 transitions, 5425 flow
[2024-06-14 15:52:50,697 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:50,697 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:50,697 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:50,697 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 15:52:50,697 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:50,697 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:50,697 INFO  L85        PathProgramCache]: Analyzing trace with hash 1998168266, now seen corresponding path program 2 times
[2024-06-14 15:52:50,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:50,698 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173667206]
[2024-06-14 15:52:50,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:50,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:50,730 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:56,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:56,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:56,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173667206]
[2024-06-14 15:52:56,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173667206] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:56,765 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:56,765 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:56,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278030554]
[2024-06-14 15:52:56,765 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:56,765 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:56,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:56,766 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:56,766 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:56,927 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:52:56,928 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 349 transitions, 5425 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:56,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:56,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:52:56,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:59,624 INFO  L124   PetriNetUnfolderBase]: 5557/8443 cut-off events.
[2024-06-14 15:52:59,624 INFO  L125   PetriNetUnfolderBase]: For 483864/483875 co-relation queries the response was YES.
[2024-06-14 15:52:59,683 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 71368 conditions, 8443 events. 5557/8443 cut-off events. For 483864/483875 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 48632 event pairs, 1193 based on Foata normal form. 76/8516 useless extension candidates. Maximal degree in co-relation 71257. Up to 5006 conditions per place. 
[2024-06-14 15:52:59,719 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 264 selfloop transitions, 145 changer transitions 0/412 dead transitions.
[2024-06-14 15:52:59,719 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 412 transitions, 7124 flow
[2024-06-14 15:52:59,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:52:59,720 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:52:59,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-14 15:52:59,720 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4878048780487805
[2024-06-14 15:52:59,720 INFO  L175             Difference]: Start difference. First operand has 222 places, 349 transitions, 5425 flow. Second operand 9 states and 180 transitions.
[2024-06-14 15:52:59,720 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 412 transitions, 7124 flow
[2024-06-14 15:53:00,423 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 412 transitions, 6803 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-14 15:53:00,429 INFO  L231             Difference]: Finished difference. Result has 225 places, 356 transitions, 5712 flow
[2024-06-14 15:53:00,429 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5104, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5712, PETRI_PLACES=225, PETRI_TRANSITIONS=356}
[2024-06-14 15:53:00,429 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 183 predicate places.
[2024-06-14 15:53:00,429 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 356 transitions, 5712 flow
[2024-06-14 15:53:00,429 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:00,430 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:00,430 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:00,430 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 15:53:00,430 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-14 15:53:00,430 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:00,430 INFO  L85        PathProgramCache]: Analyzing trace with hash -426001220, now seen corresponding path program 4 times
[2024-06-14 15:53:00,430 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:00,431 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497738811]
[2024-06-14 15:53:00,431 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:00,431 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:00,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:06,716 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:06,716 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:06,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497738811]
[2024-06-14 15:53:06,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497738811] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:06,719 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:06,719 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:53:06,719 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993476870]
[2024-06-14 15:53:06,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:06,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:53:06,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:06,720 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:53:06,720 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:53:06,942 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:06,942 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 356 transitions, 5712 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 15:53:06,942 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:06,942 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:06,942 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:09,646 INFO  L124   PetriNetUnfolderBase]: 5642/8578 cut-off events.
[2024-06-14 15:53:09,646 INFO  L125   PetriNetUnfolderBase]: For 469571/469582 co-relation queries the response was YES.
[2024-06-14 15:53:09,707 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 73489 conditions, 8578 events. 5642/8578 cut-off events. For 469571/469582 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 49688 event pairs, 1531 based on Foata normal form. 22/8597 useless extension candidates. Maximal degree in co-relation 73376. Up to 7455 conditions per place. 
[2024-06-14 15:53:09,740 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 277 selfloop transitions, 124 changer transitions 0/404 dead transitions.
[2024-06-14 15:53:09,740 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 404 transitions, 7094 flow
[2024-06-14 15:53:09,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:53:09,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:53:09,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 15:53:09,741 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46070460704607047
[2024-06-14 15:53:09,741 INFO  L175             Difference]: Start difference. First operand has 225 places, 356 transitions, 5712 flow. Second operand 9 states and 170 transitions.
[2024-06-14 15:53:09,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 404 transitions, 7094 flow
[2024-06-14 15:53:10,594 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 404 transitions, 6714 flow, removed 63 selfloop flow, removed 6 redundant places.
[2024-06-14 15:53:10,600 INFO  L231             Difference]: Finished difference. Result has 228 places, 359 transitions, 5720 flow
[2024-06-14 15:53:10,600 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5342, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5720, PETRI_PLACES=228, PETRI_TRANSITIONS=359}
[2024-06-14 15:53:10,600 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 186 predicate places.
[2024-06-14 15:53:10,601 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 359 transitions, 5720 flow
[2024-06-14 15:53:10,601 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 15:53:10,601 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:10,601 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:10,601 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 15:53:10,601 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-14 15:53:10,601 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:10,601 INFO  L85        PathProgramCache]: Analyzing trace with hash -420286928, now seen corresponding path program 3 times
[2024-06-14 15:53:10,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:10,601 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372403199]
[2024-06-14 15:53:10,602 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:10,602 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:10,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:17,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:17,098 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:17,099 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372403199]
[2024-06-14 15:53:17,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372403199] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:17,099 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:17,099 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:53:17,099 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416803181]
[2024-06-14 15:53:17,099 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:17,099 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:53:17,099 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:17,099 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:53:17,099 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:53:17,226 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:17,227 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 359 transitions, 5720 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:17,227 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:17,227 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:17,227 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:19,939 INFO  L124   PetriNetUnfolderBase]: 5788/8856 cut-off events.
[2024-06-14 15:53:19,940 INFO  L125   PetriNetUnfolderBase]: For 513069/513080 co-relation queries the response was YES.
[2024-06-14 15:53:20,007 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72714 conditions, 8856 events. 5788/8856 cut-off events. For 513069/513080 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 52075 event pairs, 1603 based on Foata normal form. 96/8949 useless extension candidates. Maximal degree in co-relation 72600. Up to 7227 conditions per place. 
[2024-06-14 15:53:20,044 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 269 selfloop transitions, 136 changer transitions 0/408 dead transitions.
[2024-06-14 15:53:20,044 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 408 transitions, 7040 flow
[2024-06-14 15:53:20,045 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:53:20,045 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:53:20,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-14 15:53:20,045 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46883468834688347
[2024-06-14 15:53:20,045 INFO  L175             Difference]: Start difference. First operand has 228 places, 359 transitions, 5720 flow. Second operand 9 states and 173 transitions.
[2024-06-14 15:53:20,045 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 408 transitions, 7040 flow
[2024-06-14 15:53:20,926 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 408 transitions, 6714 flow, removed 42 selfloop flow, removed 7 redundant places.
[2024-06-14 15:53:20,931 INFO  L231             Difference]: Finished difference. Result has 230 places, 362 transitions, 5807 flow
[2024-06-14 15:53:20,932 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5394, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5807, PETRI_PLACES=230, PETRI_TRANSITIONS=362}
[2024-06-14 15:53:20,932 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 188 predicate places.
[2024-06-14 15:53:20,932 INFO  L495      AbstractCegarLoop]: Abstraction has has 230 places, 362 transitions, 5807 flow
[2024-06-14 15:53:20,932 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:20,932 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:20,932 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:20,932 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 15:53:20,932 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-14 15:53:20,933 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:20,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -426004940, now seen corresponding path program 5 times
[2024-06-14 15:53:20,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:20,933 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052578342]
[2024-06-14 15:53:20,933 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:20,933 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:20,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:28,009 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:28,009 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:28,010 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052578342]
[2024-06-14 15:53:28,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052578342] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:28,010 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:28,010 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:53:28,010 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680083254]
[2024-06-14 15:53:28,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:28,012 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:53:28,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:28,012 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:53:28,012 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:53:28,181 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:28,181 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 362 transitions, 5807 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:28,181 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:28,181 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:28,182 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:31,148 INFO  L124   PetriNetUnfolderBase]: 6274/9610 cut-off events.
[2024-06-14 15:53:31,148 INFO  L125   PetriNetUnfolderBase]: For 540862/540873 co-relation queries the response was YES.
[2024-06-14 15:53:31,217 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80396 conditions, 9610 events. 6274/9610 cut-off events. For 540862/540873 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 57524 event pairs, 1728 based on Foata normal form. 22/9629 useless extension candidates. Maximal degree in co-relation 80281. Up to 7142 conditions per place. 
[2024-06-14 15:53:31,255 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 291 selfloop transitions, 128 changer transitions 0/422 dead transitions.
[2024-06-14 15:53:31,255 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 422 transitions, 7489 flow
[2024-06-14 15:53:31,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:53:31,257 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:53:31,257 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-14 15:53:31,257 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47696476964769646
[2024-06-14 15:53:31,257 INFO  L175             Difference]: Start difference. First operand has 230 places, 362 transitions, 5807 flow. Second operand 9 states and 176 transitions.
[2024-06-14 15:53:31,257 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 422 transitions, 7489 flow
[2024-06-14 15:53:32,173 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 422 transitions, 7140 flow, removed 44 selfloop flow, removed 7 redundant places.
[2024-06-14 15:53:32,179 INFO  L231             Difference]: Finished difference. Result has 233 places, 369 transitions, 5996 flow
[2024-06-14 15:53:32,179 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5458, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5996, PETRI_PLACES=233, PETRI_TRANSITIONS=369}
[2024-06-14 15:53:32,179 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 191 predicate places.
[2024-06-14 15:53:32,179 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 369 transitions, 5996 flow
[2024-06-14 15:53:32,180 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:32,180 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:32,180 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:32,180 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 15:53:32,180 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-14 15:53:32,180 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:32,180 INFO  L85        PathProgramCache]: Analyzing trace with hash -503538832, now seen corresponding path program 4 times
[2024-06-14 15:53:32,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:32,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425072956]
[2024-06-14 15:53:32,181 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:32,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:32,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:38,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:38,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:38,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425072956]
[2024-06-14 15:53:38,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425072956] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:38,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:38,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:53:38,558 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070264352]
[2024-06-14 15:53:38,558 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:38,558 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:53:38,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:38,558 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:53:38,558 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:53:38,724 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:38,724 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 369 transitions, 5996 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:38,724 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:38,724 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:38,725 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:41,610 INFO  L124   PetriNetUnfolderBase]: 6366/9762 cut-off events.
[2024-06-14 15:53:41,611 INFO  L125   PetriNetUnfolderBase]: For 563526/563537 co-relation queries the response was YES.
[2024-06-14 15:53:41,677 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81402 conditions, 9762 events. 6366/9762 cut-off events. For 563526/563537 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 59234 event pairs, 1984 based on Foata normal form. 28/9787 useless extension candidates. Maximal degree in co-relation 81285. Up to 9070 conditions per place. 
[2024-06-14 15:53:41,714 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 317 selfloop transitions, 88 changer transitions 0/408 dead transitions.
[2024-06-14 15:53:41,714 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 408 transitions, 7027 flow
[2024-06-14 15:53:41,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:53:41,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:53:41,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-14 15:53:41,716 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4254742547425474
[2024-06-14 15:53:41,717 INFO  L175             Difference]: Start difference. First operand has 233 places, 369 transitions, 5996 flow. Second operand 9 states and 157 transitions.
[2024-06-14 15:53:41,717 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 408 transitions, 7027 flow
[2024-06-14 15:53:42,735 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 408 transitions, 6738 flow, removed 72 selfloop flow, removed 5 redundant places.
[2024-06-14 15:53:42,741 INFO  L231             Difference]: Finished difference. Result has 237 places, 371 transitions, 5974 flow
[2024-06-14 15:53:42,741 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5707, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5974, PETRI_PLACES=237, PETRI_TRANSITIONS=371}
[2024-06-14 15:53:42,741 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 195 predicate places.
[2024-06-14 15:53:42,741 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 371 transitions, 5974 flow
[2024-06-14 15:53:42,741 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:42,741 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:42,741 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:42,741 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 15:53:42,742 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-14 15:53:42,742 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:42,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 764959600, now seen corresponding path program 5 times
[2024-06-14 15:53:42,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:42,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452826398]
[2024-06-14 15:53:42,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:42,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:42,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:49,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:49,190 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:49,190 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452826398]
[2024-06-14 15:53:49,190 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452826398] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:49,190 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:49,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:53:49,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040288895]
[2024-06-14 15:53:49,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:49,190 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:53:49,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:49,190 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:53:49,191 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:53:49,376 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:53:49,377 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 371 transitions, 5974 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:49,377 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:49,377 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:53:49,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:52,436 INFO  L124   PetriNetUnfolderBase]: 6750/10398 cut-off events.
[2024-06-14 15:53:52,436 INFO  L125   PetriNetUnfolderBase]: For 660275/660286 co-relation queries the response was YES.
[2024-06-14 15:53:52,523 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85344 conditions, 10398 events. 6750/10398 cut-off events. For 660275/660286 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 64102 event pairs, 1998 based on Foata normal form. 96/10491 useless extension candidates. Maximal degree in co-relation 85225. Up to 9079 conditions per place. 
[2024-06-14 15:53:52,569 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 306 selfloop transitions, 110 changer transitions 0/419 dead transitions.
[2024-06-14 15:53:52,570 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 419 transitions, 7224 flow
[2024-06-14 15:53:52,570 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:53:52,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:53:52,571 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions.
[2024-06-14 15:53:52,571 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-14 15:53:52,571 INFO  L175             Difference]: Start difference. First operand has 237 places, 371 transitions, 5974 flow. Second operand 10 states and 185 transitions.
[2024-06-14 15:53:52,571 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 419 transitions, 7224 flow
[2024-06-14 15:53:53,603 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 419 transitions, 7011 flow, removed 32 selfloop flow, removed 6 redundant places.
[2024-06-14 15:53:53,609 INFO  L231             Difference]: Finished difference. Result has 241 places, 374 transitions, 6136 flow
[2024-06-14 15:53:53,609 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5761, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6136, PETRI_PLACES=241, PETRI_TRANSITIONS=374}
[2024-06-14 15:53:53,609 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places.
[2024-06-14 15:53:53,609 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 374 transitions, 6136 flow
[2024-06-14 15:53:53,609 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:53:53,610 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:53,610 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:53,610 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 15:53:53,610 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-14 15:53:53,610 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:53,610 INFO  L85        PathProgramCache]: Analyzing trace with hash -760031902, now seen corresponding path program 6 times
[2024-06-14 15:53:53,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:53,611 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69169944]
[2024-06-14 15:53:53,611 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:53,611 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:53,639 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:00,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:00,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:00,149 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69169944]
[2024-06-14 15:54:00,149 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69169944] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:00,149 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:00,149 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:54:00,149 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320859806]
[2024-06-14 15:54:00,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:00,150 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:54:00,150 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:00,150 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:54:00,150 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:54:00,370 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:00,370 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 374 transitions, 6136 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:00,370 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:00,370 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:00,370 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:03,387 INFO  L124   PetriNetUnfolderBase]: 6919/10677 cut-off events.
[2024-06-14 15:54:03,388 INFO  L125   PetriNetUnfolderBase]: For 635763/635774 co-relation queries the response was YES.
[2024-06-14 15:54:03,477 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88660 conditions, 10677 events. 6919/10677 cut-off events. For 635763/635774 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 66492 event pairs, 2201 based on Foata normal form. 20/10694 useless extension candidates. Maximal degree in co-relation 88540. Up to 9671 conditions per place. 
[2024-06-14 15:54:03,522 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 326 selfloop transitions, 89 changer transitions 0/418 dead transitions.
[2024-06-14 15:54:03,522 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 418 transitions, 7403 flow
[2024-06-14 15:54:03,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:54:03,524 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:54:03,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-14 15:54:03,524 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43360433604336046
[2024-06-14 15:54:03,524 INFO  L175             Difference]: Start difference. First operand has 241 places, 374 transitions, 6136 flow. Second operand 9 states and 160 transitions.
[2024-06-14 15:54:03,524 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 418 transitions, 7403 flow
[2024-06-14 15:54:04,996 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 418 transitions, 7086 flow, removed 54 selfloop flow, removed 8 redundant places.
[2024-06-14 15:54:05,001 INFO  L231             Difference]: Finished difference. Result has 242 places, 376 transitions, 6098 flow
[2024-06-14 15:54:05,002 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5819, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6098, PETRI_PLACES=242, PETRI_TRANSITIONS=376}
[2024-06-14 15:54:05,002 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 200 predicate places.
[2024-06-14 15:54:05,002 INFO  L495      AbstractCegarLoop]: Abstraction has has 242 places, 376 transitions, 6098 flow
[2024-06-14 15:54:05,002 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:05,002 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:05,002 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:05,002 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 15:54:05,002 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-14 15:54:05,003 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:05,003 INFO  L85        PathProgramCache]: Analyzing trace with hash -494334622, now seen corresponding path program 7 times
[2024-06-14 15:54:05,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:05,003 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22090553]
[2024-06-14 15:54:05,003 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:05,003 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:05,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:10,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:10,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:10,307 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22090553]
[2024-06-14 15:54:10,307 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22090553] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:10,307 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:10,307 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:54:10,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096497527]
[2024-06-14 15:54:10,308 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:10,308 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:54:10,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:10,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:54:10,308 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:54:10,466 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-14 15:54:10,467 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 376 transitions, 6098 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:10,467 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:10,467 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-14 15:54:10,467 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:13,529 INFO  L124   PetriNetUnfolderBase]: 7063/10917 cut-off events.
[2024-06-14 15:54:13,529 INFO  L125   PetriNetUnfolderBase]: For 667176/667187 co-relation queries the response was YES.
[2024-06-14 15:54:13,615 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89975 conditions, 10917 events. 7063/10917 cut-off events. For 667176/667187 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 67426 event pairs, 2181 based on Foata normal form. 20/10934 useless extension candidates. Maximal degree in co-relation 89854. Up to 8739 conditions per place. 
[2024-06-14 15:54:13,659 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 322 selfloop transitions, 100 changer transitions 0/425 dead transitions.
[2024-06-14 15:54:13,660 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 425 transitions, 7478 flow
[2024-06-14 15:54:13,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:54:13,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:54:13,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-14 15:54:13,662 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4847560975609756
[2024-06-14 15:54:13,662 INFO  L175             Difference]: Start difference. First operand has 242 places, 376 transitions, 6098 flow. Second operand 8 states and 159 transitions.
[2024-06-14 15:54:13,662 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 425 transitions, 7478 flow
[2024-06-14 15:54:14,728 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 425 transitions, 7326 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-14 15:54:14,734 INFO  L231             Difference]: Finished difference. Result has 245 places, 378 transitions, 6250 flow
[2024-06-14 15:54:14,734 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5946, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6250, PETRI_PLACES=245, PETRI_TRANSITIONS=378}
[2024-06-14 15:54:14,735 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 203 predicate places.
[2024-06-14 15:54:14,735 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 378 transitions, 6250 flow
[2024-06-14 15:54:14,735 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:14,735 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:14,735 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:14,735 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 15:54:14,735 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-14 15:54:14,735 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:14,735 INFO  L85        PathProgramCache]: Analyzing trace with hash -760241152, now seen corresponding path program 8 times
[2024-06-14 15:54:14,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:14,735 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984364539]
[2024-06-14 15:54:14,736 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:14,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:14,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:20,885 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:20,885 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:20,885 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984364539]
[2024-06-14 15:54:20,885 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984364539] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:20,885 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:20,885 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:54:20,885 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991425248]
[2024-06-14 15:54:20,885 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:20,886 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:54:20,886 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:20,886 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:54:20,886 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:54:21,048 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:21,048 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 378 transitions, 6250 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:21,048 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:21,049 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:21,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:24,293 INFO  L124   PetriNetUnfolderBase]: 7088/10964 cut-off events.
[2024-06-14 15:54:24,294 INFO  L125   PetriNetUnfolderBase]: For 680369/680380 co-relation queries the response was YES.
[2024-06-14 15:54:24,379 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90420 conditions, 10964 events. 7088/10964 cut-off events. For 680369/680380 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 68949 event pairs, 2303 based on Foata normal form. 24/10985 useless extension candidates. Maximal degree in co-relation 90298. Up to 10474 conditions per place. 
[2024-06-14 15:54:24,423 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 346 selfloop transitions, 67 changer transitions 0/416 dead transitions.
[2024-06-14 15:54:24,423 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 416 transitions, 7253 flow
[2024-06-14 15:54:24,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:54:24,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:54:24,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions.
[2024-06-14 15:54:24,425 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42005420054200543
[2024-06-14 15:54:24,425 INFO  L175             Difference]: Start difference. First operand has 245 places, 378 transitions, 6250 flow. Second operand 9 states and 155 transitions.
[2024-06-14 15:54:24,425 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 416 transitions, 7253 flow
[2024-06-14 15:54:25,378 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 416 transitions, 7110 flow, removed 25 selfloop flow, removed 4 redundant places.
[2024-06-14 15:54:25,384 INFO  L231             Difference]: Finished difference. Result has 250 places, 379 transitions, 6287 flow
[2024-06-14 15:54:25,384 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6107, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6287, PETRI_PLACES=250, PETRI_TRANSITIONS=379}
[2024-06-14 15:54:25,384 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 208 predicate places.
[2024-06-14 15:54:25,384 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 379 transitions, 6287 flow
[2024-06-14 15:54:25,384 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:25,385 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:25,385 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:25,385 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 15:54:25,385 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-14 15:54:25,385 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:25,385 INFO  L85        PathProgramCache]: Analyzing trace with hash 764967040, now seen corresponding path program 9 times
[2024-06-14 15:54:25,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:25,386 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409348773]
[2024-06-14 15:54:25,386 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:25,386 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:25,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:31,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:31,816 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:31,816 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409348773]
[2024-06-14 15:54:31,816 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409348773] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:31,816 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:31,816 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:54:31,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750628576]
[2024-06-14 15:54:31,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:31,817 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:54:31,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:31,817 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:54:31,817 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:54:32,086 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:32,086 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 379 transitions, 6287 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:32,086 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:32,087 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:32,087 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:35,763 INFO  L124   PetriNetUnfolderBase]: 7672/11912 cut-off events.
[2024-06-14 15:54:35,764 INFO  L125   PetriNetUnfolderBase]: For 845892/845903 co-relation queries the response was YES.
[2024-06-14 15:54:35,862 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99461 conditions, 11912 events. 7672/11912 cut-off events. For 845892/845903 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 76169 event pairs, 2210 based on Foata normal form. 76/11985 useless extension candidates. Maximal degree in co-relation 99336. Up to 8756 conditions per place. 
[2024-06-14 15:54:35,911 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 321 selfloop transitions, 114 changer transitions 0/438 dead transitions.
[2024-06-14 15:54:35,911 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 438 transitions, 7949 flow
[2024-06-14 15:54:35,912 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:54:35,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:54:35,912 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions.
[2024-06-14 15:54:35,912 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4658536585365854
[2024-06-14 15:54:35,912 INFO  L175             Difference]: Start difference. First operand has 250 places, 379 transitions, 6287 flow. Second operand 10 states and 191 transitions.
[2024-06-14 15:54:35,912 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 438 transitions, 7949 flow
[2024-06-14 15:54:37,174 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 438 transitions, 7803 flow, removed 9 selfloop flow, removed 7 redundant places.
[2024-06-14 15:54:37,180 INFO  L231             Difference]: Finished difference. Result has 254 places, 384 transitions, 6643 flow
[2024-06-14 15:54:37,180 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6141, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6643, PETRI_PLACES=254, PETRI_TRANSITIONS=384}
[2024-06-14 15:54:37,180 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places.
[2024-06-14 15:54:37,180 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 384 transitions, 6643 flow
[2024-06-14 15:54:37,180 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:37,180 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:37,181 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:37,181 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 15:54:37,181 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-14 15:54:37,181 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:37,181 INFO  L85        PathProgramCache]: Analyzing trace with hash 759245308, now seen corresponding path program 6 times
[2024-06-14 15:54:37,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:37,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159533993]
[2024-06-14 15:54:37,181 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:37,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:37,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:43,033 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:43,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:43,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159533993]
[2024-06-14 15:54:43,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159533993] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:43,034 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:43,034 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:54:43,034 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043026657]
[2024-06-14 15:54:43,034 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:43,034 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:54:43,034 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:43,035 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:54:43,035 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:54:43,260 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:43,260 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 384 transitions, 6643 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 15:54:43,260 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:43,260 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:43,260 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:47,270 INFO  L124   PetriNetUnfolderBase]: 7647/11881 cut-off events.
[2024-06-14 15:54:47,270 INFO  L125   PetriNetUnfolderBase]: For 800323/800334 co-relation queries the response was YES.
[2024-06-14 15:54:47,360 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99759 conditions, 11881 events. 7647/11881 cut-off events. For 800323/800334 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 75965 event pairs, 2478 based on Foata normal form. 22/11900 useless extension candidates. Maximal degree in co-relation 99632. Up to 11068 conditions per place. 
[2024-06-14 15:54:47,407 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 325 selfloop transitions, 110 changer transitions 0/438 dead transitions.
[2024-06-14 15:54:47,407 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 438 transitions, 8059 flow
[2024-06-14 15:54:47,407 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:54:47,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:54:47,408 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions.
[2024-06-14 15:54:47,408 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44789356984478934
[2024-06-14 15:54:47,408 INFO  L175             Difference]: Start difference. First operand has 254 places, 384 transitions, 6643 flow. Second operand 11 states and 202 transitions.
[2024-06-14 15:54:47,408 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 438 transitions, 8059 flow
[2024-06-14 15:54:48,707 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 438 transitions, 7688 flow, removed 69 selfloop flow, removed 7 redundant places.
[2024-06-14 15:54:48,713 INFO  L231             Difference]: Finished difference. Result has 258 places, 387 transitions, 6654 flow
[2024-06-14 15:54:48,713 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6280, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6654, PETRI_PLACES=258, PETRI_TRANSITIONS=387}
[2024-06-14 15:54:48,713 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 216 predicate places.
[2024-06-14 15:54:48,713 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 387 transitions, 6654 flow
[2024-06-14 15:54:48,714 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 15:54:48,714 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:48,714 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:48,714 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 15:54:48,714 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-14 15:54:48,714 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:48,714 INFO  L85        PathProgramCache]: Analyzing trace with hash 759241588, now seen corresponding path program 7 times
[2024-06-14 15:54:48,714 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:48,714 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880001607]
[2024-06-14 15:54:48,714 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:48,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:48,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:55,725 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:55,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:55,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880001607]
[2024-06-14 15:54:55,726 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880001607] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:55,726 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:55,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:54:55,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281934448]
[2024-06-14 15:54:55,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:55,726 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:54:55,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:55,727 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:54:55,727 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:54:55,899 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:54:55,899 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 387 transitions, 6654 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:55,899 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:55,900 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:54:55,900 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:00,095 INFO  L124   PetriNetUnfolderBase]: 8091/12569 cut-off events.
[2024-06-14 15:55:00,095 INFO  L125   PetriNetUnfolderBase]: For 911623/911634 co-relation queries the response was YES.
[2024-06-14 15:55:00,199 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106775 conditions, 12569 events. 8091/12569 cut-off events. For 911623/911634 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 81138 event pairs, 2497 based on Foata normal form. 22/12588 useless extension candidates. Maximal degree in co-relation 106648. Up to 10411 conditions per place. 
[2024-06-14 15:55:00,251 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 334 selfloop transitions, 116 changer transitions 0/453 dead transitions.
[2024-06-14 15:55:00,251 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 453 transitions, 8394 flow
[2024-06-14 15:55:00,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:55:00,251 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:55:00,252 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions.
[2024-06-14 15:55:00,252 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4611973392461197
[2024-06-14 15:55:00,252 INFO  L175             Difference]: Start difference. First operand has 258 places, 387 transitions, 6654 flow. Second operand 11 states and 208 transitions.
[2024-06-14 15:55:00,252 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 453 transitions, 8394 flow
[2024-06-14 15:55:01,583 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 453 transitions, 8074 flow, removed 53 selfloop flow, removed 9 redundant places.
[2024-06-14 15:55:01,589 INFO  L231             Difference]: Finished difference. Result has 261 places, 394 transitions, 6892 flow
[2024-06-14 15:55:01,589 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6334, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6892, PETRI_PLACES=261, PETRI_TRANSITIONS=394}
[2024-06-14 15:55:01,589 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 219 predicate places.
[2024-06-14 15:55:01,590 INFO  L495      AbstractCegarLoop]: Abstraction has has 261 places, 394 transitions, 6892 flow
[2024-06-14 15:55:01,590 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:01,590 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:01,590 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:01,590 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 15:55:01,590 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-14 15:55:01,590 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:01,591 INFO  L85        PathProgramCache]: Analyzing trace with hash 2044131700, now seen corresponding path program 1 times
[2024-06-14 15:55:01,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:01,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330071590]
[2024-06-14 15:55:01,591 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:01,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:01,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:11,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:11,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:11,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330071590]
[2024-06-14 15:55:11,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330071590] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:11,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:11,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:55:11,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826275641]
[2024-06-14 15:55:11,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:11,506 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:55:11,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:11,506 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:55:11,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:55:11,645 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:11,645 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 394 transitions, 6892 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:11,645 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:11,645 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:11,645 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:15,222 INFO  L124   PetriNetUnfolderBase]: 8085/12559 cut-off events.
[2024-06-14 15:55:15,223 INFO  L125   PetriNetUnfolderBase]: For 916144/916155 co-relation queries the response was YES.
[2024-06-14 15:55:15,346 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107026 conditions, 12559 events. 8085/12559 cut-off events. For 916144/916155 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 81462 event pairs, 2902 based on Foata normal form. 10/12566 useless extension candidates. Maximal degree in co-relation 106897. Up to 12501 conditions per place. 
[2024-06-14 15:55:15,403 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 390 selfloop transitions, 15 changer transitions 0/408 dead transitions.
[2024-06-14 15:55:15,403 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 408 transitions, 7796 flow
[2024-06-14 15:55:15,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:55:15,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:55:15,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions.
[2024-06-14 15:55:15,404 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3821138211382114
[2024-06-14 15:55:15,404 INFO  L175             Difference]: Start difference. First operand has 261 places, 394 transitions, 6892 flow. Second operand 6 states and 94 transitions.
[2024-06-14 15:55:15,404 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 408 transitions, 7796 flow
[2024-06-14 15:55:17,446 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 408 transitions, 7477 flow, removed 92 selfloop flow, removed 7 redundant places.
[2024-06-14 15:55:17,451 INFO  L231             Difference]: Finished difference. Result has 260 places, 397 transitions, 6671 flow
[2024-06-14 15:55:17,452 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6573, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6671, PETRI_PLACES=260, PETRI_TRANSITIONS=397}
[2024-06-14 15:55:17,452 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 218 predicate places.
[2024-06-14 15:55:17,452 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 397 transitions, 6671 flow
[2024-06-14 15:55:17,452 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:17,452 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:17,452 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:17,452 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 15:55:17,452 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:55:17,453 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:17,453 INFO  L85        PathProgramCache]: Analyzing trace with hash -1924265316, now seen corresponding path program 1 times
[2024-06-14 15:55:17,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:17,453 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235195621]
[2024-06-14 15:55:17,453 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:17,453 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:17,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:25,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:25,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:25,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235195621]
[2024-06-14 15:55:25,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235195621] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:25,062 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:25,062 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:55:25,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535041885]
[2024-06-14 15:55:25,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:25,062 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:55:25,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:25,062 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:55:25,063 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:55:25,238 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:25,238 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 397 transitions, 6671 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:25,238 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:25,238 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:25,238 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:29,330 INFO  L124   PetriNetUnfolderBase]: 8106/12586 cut-off events.
[2024-06-14 15:55:29,330 INFO  L125   PetriNetUnfolderBase]: For 926699/926699 co-relation queries the response was YES.
[2024-06-14 15:55:29,425 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106886 conditions, 12586 events. 8106/12586 cut-off events. For 926699/926699 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 81670 event pairs, 3012 based on Foata normal form. 1/12585 useless extension candidates. Maximal degree in co-relation 106755. Up to 12463 conditions per place. 
[2024-06-14 15:55:29,526 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 402 selfloop transitions, 37 changer transitions 0/442 dead transitions.
[2024-06-14 15:55:29,526 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 442 transitions, 8406 flow
[2024-06-14 15:55:29,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:55:29,528 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:55:29,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-14 15:55:29,529 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41114982578397213
[2024-06-14 15:55:29,529 INFO  L175             Difference]: Start difference. First operand has 260 places, 397 transitions, 6671 flow. Second operand 7 states and 118 transitions.
[2024-06-14 15:55:29,529 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 442 transitions, 8406 flow
[2024-06-14 15:55:31,160 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 442 transitions, 8320 flow, removed 26 selfloop flow, removed 4 redundant places.
[2024-06-14 15:55:31,167 INFO  L231             Difference]: Finished difference. Result has 266 places, 419 transitions, 7296 flow
[2024-06-14 15:55:31,167 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6593, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7296, PETRI_PLACES=266, PETRI_TRANSITIONS=419}
[2024-06-14 15:55:31,167 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 224 predicate places.
[2024-06-14 15:55:31,167 INFO  L495      AbstractCegarLoop]: Abstraction has has 266 places, 419 transitions, 7296 flow
[2024-06-14 15:55:31,167 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:31,167 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:31,167 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:31,167 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 15:55:31,168 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:55:31,168 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:31,168 INFO  L85        PathProgramCache]: Analyzing trace with hash -1924145160, now seen corresponding path program 1 times
[2024-06-14 15:55:31,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:31,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696192203]
[2024-06-14 15:55:31,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:31,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:31,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:37,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:37,980 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:37,980 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696192203]
[2024-06-14 15:55:37,980 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696192203] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:37,980 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:37,980 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:55:37,981 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365176495]
[2024-06-14 15:55:37,981 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:37,981 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:55:37,981 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:37,981 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:55:37,981 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:55:38,128 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:38,128 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 419 transitions, 7296 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:38,128 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:38,128 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:38,128 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:42,377 INFO  L124   PetriNetUnfolderBase]: 8202/12723 cut-off events.
[2024-06-14 15:55:42,378 INFO  L125   PetriNetUnfolderBase]: For 984560/984571 co-relation queries the response was YES.
[2024-06-14 15:55:42,490 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110116 conditions, 12723 events. 8202/12723 cut-off events. For 984560/984571 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 82463 event pairs, 3040 based on Foata normal form. 20/12740 useless extension candidates. Maximal degree in co-relation 109981. Up to 12557 conditions per place. 
[2024-06-14 15:55:42,544 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 401 selfloop transitions, 55 changer transitions 0/459 dead transitions.
[2024-06-14 15:55:42,545 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 459 transitions, 8885 flow
[2024-06-14 15:55:42,545 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:55:42,545 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:55:42,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions.
[2024-06-14 15:55:42,546 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38414634146341464
[2024-06-14 15:55:42,546 INFO  L175             Difference]: Start difference. First operand has 266 places, 419 transitions, 7296 flow. Second operand 8 states and 126 transitions.
[2024-06-14 15:55:42,546 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 459 transitions, 8885 flow
[2024-06-14 15:55:44,376 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 459 transitions, 8697 flow, removed 93 selfloop flow, removed 1 redundant places.
[2024-06-14 15:55:44,382 INFO  L231             Difference]: Finished difference. Result has 274 places, 442 transitions, 7806 flow
[2024-06-14 15:55:44,382 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7122, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7806, PETRI_PLACES=274, PETRI_TRANSITIONS=442}
[2024-06-14 15:55:44,383 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 232 predicate places.
[2024-06-14 15:55:44,383 INFO  L495      AbstractCegarLoop]: Abstraction has has 274 places, 442 transitions, 7806 flow
[2024-06-14 15:55:44,383 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:44,383 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:44,383 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:44,383 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 15:55:44,383 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:55:44,383 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:44,383 INFO  L85        PathProgramCache]: Analyzing trace with hash -846854234, now seen corresponding path program 2 times
[2024-06-14 15:55:44,384 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:44,384 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951919226]
[2024-06-14 15:55:44,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:44,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:44,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:51,562 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:51,562 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:51,562 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951919226]
[2024-06-14 15:55:51,562 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951919226] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:51,562 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:51,562 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:55:51,562 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556879558]
[2024-06-14 15:55:51,562 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:51,563 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:55:51,563 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:51,563 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:55:51,563 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:55:51,668 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:55:51,668 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 442 transitions, 7806 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:51,668 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:51,668 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:55:51,668 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:55,875 INFO  L124   PetriNetUnfolderBase]: 8176/12687 cut-off events.
[2024-06-14 15:55:55,876 INFO  L125   PetriNetUnfolderBase]: For 1004489/1004500 co-relation queries the response was YES.
[2024-06-14 15:55:56,016 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110727 conditions, 12687 events. 8176/12687 cut-off events. For 1004489/1004500 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 82286 event pairs, 3040 based on Foata normal form. 14/12698 useless extension candidates. Maximal degree in co-relation 110588. Up to 12533 conditions per place. 
[2024-06-14 15:55:56,080 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 400 selfloop transitions, 55 changer transitions 0/458 dead transitions.
[2024-06-14 15:55:56,081 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 458 transitions, 8766 flow
[2024-06-14 15:55:56,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:55:56,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:55:56,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions.
[2024-06-14 15:55:56,082 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38109756097560976
[2024-06-14 15:55:56,082 INFO  L175             Difference]: Start difference. First operand has 274 places, 442 transitions, 7806 flow. Second operand 8 states and 125 transitions.
[2024-06-14 15:55:56,082 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 458 transitions, 8766 flow
[2024-06-14 15:55:57,802 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 458 transitions, 8332 flow, removed 212 selfloop flow, removed 2 redundant places.
[2024-06-14 15:55:57,808 INFO  L231             Difference]: Finished difference. Result has 280 places, 442 transitions, 7502 flow
[2024-06-14 15:55:57,809 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7372, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7502, PETRI_PLACES=280, PETRI_TRANSITIONS=442}
[2024-06-14 15:55:57,809 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 238 predicate places.
[2024-06-14 15:55:57,809 INFO  L495      AbstractCegarLoop]: Abstraction has has 280 places, 442 transitions, 7502 flow
[2024-06-14 15:55:57,809 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:55:57,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:57,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:57,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 15:55:57,809 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:55:57,810 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:57,810 INFO  L85        PathProgramCache]: Analyzing trace with hash 2044137652, now seen corresponding path program 2 times
[2024-06-14 15:55:57,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:57,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286834365]
[2024-06-14 15:55:57,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:57,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:57,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:04,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:04,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:04,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286834365]
[2024-06-14 15:56:04,900 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286834365] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:04,900 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:04,900 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:56:04,901 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787690498]
[2024-06-14 15:56:04,901 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:04,901 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:56:04,901 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:04,901 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:56:04,901 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:56:05,064 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-14 15:56:05,064 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 442 transitions, 7502 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:05,065 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:05,065 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-14 15:56:05,065 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:08,911 INFO  L124   PetriNetUnfolderBase]: 8196/12715 cut-off events.
[2024-06-14 15:56:08,911 INFO  L125   PetriNetUnfolderBase]: For 1026353/1026364 co-relation queries the response was YES.
[2024-06-14 15:56:09,027 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110881 conditions, 12715 events. 8196/12715 cut-off events. For 1026353/1026364 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 82311 event pairs, 2924 based on Foata normal form. 12/12724 useless extension candidates. Maximal degree in co-relation 110740. Up to 12659 conditions per place. 
[2024-06-14 15:56:09,362 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 440 selfloop transitions, 20 changer transitions 0/463 dead transitions.
[2024-06-14 15:56:09,362 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 463 transitions, 8649 flow
[2024-06-14 15:56:09,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:56:09,363 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:56:09,363 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions.
[2024-06-14 15:56:09,363 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3821138211382114
[2024-06-14 15:56:09,363 INFO  L175             Difference]: Start difference. First operand has 280 places, 442 transitions, 7502 flow. Second operand 6 states and 94 transitions.
[2024-06-14 15:56:09,363 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 463 transitions, 8649 flow
[2024-06-14 15:56:11,178 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 463 transitions, 8558 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-06-14 15:56:11,184 INFO  L231             Difference]: Finished difference. Result has 281 places, 453 transitions, 7686 flow
[2024-06-14 15:56:11,184 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7411, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7686, PETRI_PLACES=281, PETRI_TRANSITIONS=453}
[2024-06-14 15:56:11,185 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 239 predicate places.
[2024-06-14 15:56:11,185 INFO  L495      AbstractCegarLoop]: Abstraction has has 281 places, 453 transitions, 7686 flow
[2024-06-14 15:56:11,185 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:11,185 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:11,185 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:11,185 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 15:56:11,185 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:11,185 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:11,185 INFO  L85        PathProgramCache]: Analyzing trace with hash 388453792, now seen corresponding path program 3 times
[2024-06-14 15:56:11,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:11,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318605063]
[2024-06-14 15:56:11,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:11,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:11,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat