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


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


Checking for ERROR reachability
Using default analysis
Version 76401ed0
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/safe011_power.opt_pso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe011_power.opt_pso.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-76401ed-m
[2024-06-20 19:46:56,646 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:46:56,712 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 19:46:56,716 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:46:56,716 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:46:56,738 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:46:56,738 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:46:56,738 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:46:56,739 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:46:56,741 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:46:56,742 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:46:56,742 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:46:56,742 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:46:56,743 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:46:56,744 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:46:56,744 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:46:56,744 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:46:56,744 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:46:56,744 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 19:46:56,744 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:46:56,744 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:46:56,745 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:46:56,745 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:46:56,745 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:46:56,745 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:46:56,745 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:46:56,745 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:46:56,745 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:46:56,746 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:46:56,746 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:46:56,747 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:46:56,747 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:46:56,747 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:46:56,747 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:46:56,747 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:46:56,747 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:46:56,747 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 19:46:56,747 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 19:46:56,748 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:46:56,748 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:46:56,748 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:46:56,748 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:46:56,748 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:46:56,748 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-20 19:46:56,953 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:46:56,966 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:46:56,968 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:46:56,969 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:46:56,969 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:46:56,970 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i
[2024-06-20 19:46:57,984 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:46:58,229 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:46:58,230 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i
[2024-06-20 19:46:58,243 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0527a9e8c/601f7b0fb2c34ffa8e533fc308bbad94/FLAG91dfb713b
[2024-06-20 19:46:58,255 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0527a9e8c/601f7b0fb2c34ffa8e533fc308bbad94
[2024-06-20 19:46:58,257 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:46:58,257 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:46:58,258 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/safe011_power.opt_pso.opt.yml/witness.yml
[2024-06-20 19:46:58,425 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:46:58,426 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:46:58,427 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:46:58,427 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:46:58,431 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:46:58,432 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:46:58" (1/2) ...
[2024-06-20 19:46:58,433 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333d4de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:46:58, skipping insertion in model container
[2024-06-20 19:46:58,433 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:46:58" (1/2) ...
[2024-06-20 19:46:58,435 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@44506283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:46:58, skipping insertion in model container
[2024-06-20 19:46:58,435 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:46:58" (2/2) ...
[2024-06-20 19:46:58,435 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333d4de4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:58, skipping insertion in model container
[2024-06-20 19:46:58,435 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:46:58" (2/2) ...
[2024-06-20 19:46:58,436 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:46:58,507 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:46:58,508 INFO  L97    edCorrectnessWitness]: Location invariant before [L823-L823] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 2) && z <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))
[2024-06-20 19:46:58,511 INFO  L97    edCorrectnessWitness]: Location invariant before [L821-L821] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 2) && z <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))
[2024-06-20 19:46:58,511 INFO  L97    edCorrectnessWitness]: Location invariant before [L824-L824] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 2) && z <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))
[2024-06-20 19:46:58,512 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:46:58,512 INFO  L106   edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1;
[2024-06-20 19:46:58,573 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:46:58,844 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:46:58,859 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 19:46:59,181 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:46:59,212 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:46:59,212 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:59 WrapperNode
[2024-06-20 19:46:59,212 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:46:59,214 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:46:59,214 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:46:59,214 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:46:59,220 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 20.06 07:46:59" (1/1) ...
[2024-06-20 19:46:59,255 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 20.06 07:46:59" (1/1) ...
[2024-06-20 19:46:59,353 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143
[2024-06-20 19:46:59,353 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 19:46:59,354 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 19:46:59,354 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 19:46:59,354 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 19:46:59,363 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:59" (1/1) ...
[2024-06-20 19:46:59,364 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:59" (1/1) ...
[2024-06-20 19:46:59,387 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:59" (1/1) ...
[2024-06-20 19:46:59,487 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-20 19:46:59,487 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:59" (1/1) ...
[2024-06-20 19:46:59,488 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:59" (1/1) ...
[2024-06-20 19:46:59,529 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:59" (1/1) ...
[2024-06-20 19:46:59,531 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:59" (1/1) ...
[2024-06-20 19:46:59,538 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:59" (1/1) ...
[2024-06-20 19:46:59,546 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:59" (1/1) ...
[2024-06-20 19:46:59,559 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 19:46:59,560 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 19:46:59,560 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 19:46:59,560 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 19:46:59,561 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:59" (1/1) ...
[2024-06-20 19:46:59,566 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:46:59,572 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 19:46:59,587 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-20 19:46:59,600 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-20 19:46:59,658 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 19:46:59,658 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 19:46:59,658 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 19:46:59,658 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 19:46:59,658 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 19:46:59,659 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 19:46:59,659 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 19:46:59,659 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 19:46:59,659 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 19:46:59,659 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 19:46:59,660 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 19:46:59,660 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 19:46:59,661 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 19:46:59,779 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 19:46:59,781 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 19:47:00,720 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 19:47:00,721 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 19:47:00,956 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 19:47:00,956 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 19:47:00,956 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:47:00 BoogieIcfgContainer
[2024-06-20 19:47:00,957 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 19:47:00,959 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 19:47:00,959 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 19:47:00,971 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 19:47:00,972 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:46:58" (1/4) ...
[2024-06-20 19:47:00,973 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c5467e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:47:00, skipping insertion in model container
[2024-06-20 19:47:00,973 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:46:58" (2/4) ...
[2024-06-20 19:47:00,974 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c5467e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:47:00, skipping insertion in model container
[2024-06-20 19:47:00,974 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:46:59" (3/4) ...
[2024-06-20 19:47:00,974 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c5467e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:47:00, skipping insertion in model container
[2024-06-20 19:47:00,975 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:47:00" (4/4) ...
[2024-06-20 19:47:00,976 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i
[2024-06-20 19:47:00,989 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 19:47:00,989 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 19:47:00,989 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 19:47:01,072 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 19:47:01,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow
[2024-06-20 19:47:01,216 INFO  L124   PetriNetUnfolderBase]: 0/37 cut-off events.
[2024-06-20 19:47:01,216 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:47:01,218 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 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/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 19:47:01,220 INFO  L82        GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow
[2024-06-20 19:47:01,222 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow
[2024-06-20 19:47:01,234 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 19:47:01,251 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;@7f51de81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 19:47:01,251 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 19:47:01,258 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 19:47:01,258 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 19:47:01,258 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:47:01,259 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:01,259 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 19:47:01,260 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-20 19:47:01,263 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:01,263 INFO  L85        PathProgramCache]: Analyzing trace with hash 368623954, now seen corresponding path program 1 times
[2024-06-20 19:47:01,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:01,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843797296]
[2024-06-20 19:47:01,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:01,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:01,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:05,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:05,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:05,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843797296]
[2024-06-20 19:47:05,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843797296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:05,530 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:05,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 19:47:05,532 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676055648]
[2024-06-20 19:47:05,532 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:05,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 19:47:05,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:05,580 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 19:47:05,580 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 19:47:05,656 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-20 19:47:05,658 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand  has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:05,658 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:05,658 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-20 19:47:05,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:06,432 INFO  L124   PetriNetUnfolderBase]: 1407/2118 cut-off events.
[2024-06-20 19:47:06,433 INFO  L125   PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES.
[2024-06-20 19:47:06,437 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4322 conditions, 2118 events. 1407/2118 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9683 event pairs, 989 based on Foata normal form. 1/2076 useless extension candidates. Maximal degree in co-relation 4310. Up to 2105 conditions per place. 
[2024-06-20 19:47:06,445 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 32 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2024-06-20 19:47:06,445 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 169 flow
[2024-06-20 19:47:06,446 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 19:47:06,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 19:47:06,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions.
[2024-06-20 19:47:06,454 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.575
[2024-06-20 19:47:06,455 INFO  L175             Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 69 transitions.
[2024-06-20 19:47:06,456 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 169 flow
[2024-06-20 19:47:06,457 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 19:47:06,459 INFO  L231             Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow
[2024-06-20 19:47:06,460 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34}
[2024-06-20 19:47:06,462 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places.
[2024-06-20 19:47:06,463 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow
[2024-06-20 19:47:06,463 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:06,463 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:06,463 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:06,463 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 19:47:06,464 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-20 19:47:06,464 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:06,464 INFO  L85        PathProgramCache]: Analyzing trace with hash 2060553313, now seen corresponding path program 1 times
[2024-06-20 19:47:06,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:06,464 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450654981]
[2024-06-20 19:47:06,465 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:06,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:06,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:09,458 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:09,458 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:09,459 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450654981]
[2024-06-20 19:47:09,459 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450654981] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:09,459 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:09,459 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:47:09,459 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294331106]
[2024-06-20 19:47:09,459 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:09,460 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:47:09,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:09,461 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:47:09,461 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:47:09,545 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-20 19:47:09,545 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand  has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:09,546 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:09,546 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-20 19:47:09,546 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:10,222 INFO  L124   PetriNetUnfolderBase]: 1415/2129 cut-off events.
[2024-06-20 19:47:10,222 INFO  L125   PetriNetUnfolderBase]: For 400/408 co-relation queries the response was YES.
[2024-06-20 19:47:10,225 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4912 conditions, 2129 events. 1415/2129 cut-off events. For 400/408 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9668 event pairs, 866 based on Foata normal form. 8/2135 useless extension candidates. Maximal degree in co-relation 4900. Up to 2072 conditions per place. 
[2024-06-20 19:47:10,233 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 43 selfloop transitions, 11 changer transitions 0/59 dead transitions.
[2024-06-20 19:47:10,234 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 274 flow
[2024-06-20 19:47:10,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:47:10,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:47:10,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions.
[2024-06-20 19:47:10,236 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.59375
[2024-06-20 19:47:10,236 INFO  L175             Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 95 transitions.
[2024-06-20 19:47:10,236 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 274 flow
[2024-06-20 19:47:10,237 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:47:10,240 INFO  L231             Difference]: Finished difference. Result has 45 places, 42 transitions, 170 flow
[2024-06-20 19:47:10,240 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=45, PETRI_TRANSITIONS=42}
[2024-06-20 19:47:10,241 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places.
[2024-06-20 19:47:10,241 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 170 flow
[2024-06-20 19:47:10,241 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:10,242 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:10,243 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:10,244 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 19:47:10,245 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-20 19:47:10,245 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:10,246 INFO  L85        PathProgramCache]: Analyzing trace with hash -547356015, now seen corresponding path program 1 times
[2024-06-20 19:47:10,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:10,250 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372513231]
[2024-06-20 19:47:10,253 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:10,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:10,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:13,273 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:13,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:13,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372513231]
[2024-06-20 19:47:13,274 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372513231] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:13,274 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:13,274 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:47:13,274 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287499317]
[2024-06-20 19:47:13,274 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:13,274 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:47:13,275 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:13,275 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:47:13,275 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:47:13,372 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-20 19:47:13,373 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 170 flow. Second operand  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:13,373 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:13,373 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-20 19:47:13,373 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:14,148 INFO  L124   PetriNetUnfolderBase]: 1431/2151 cut-off events.
[2024-06-20 19:47:14,148 INFO  L125   PetriNetUnfolderBase]: For 1373/1390 co-relation queries the response was YES.
[2024-06-20 19:47:14,151 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5806 conditions, 2151 events. 1431/2151 cut-off events. For 1373/1390 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9807 event pairs, 618 based on Foata normal form. 16/2165 useless extension candidates. Maximal degree in co-relation 5791. Up to 2012 conditions per place. 
[2024-06-20 19:47:14,158 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 54 selfloop transitions, 17 changer transitions 0/76 dead transitions.
[2024-06-20 19:47:14,158 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 412 flow
[2024-06-20 19:47:14,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:47:14,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:47:14,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions.
[2024-06-20 19:47:14,160 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6
[2024-06-20 19:47:14,160 INFO  L175             Difference]: Start difference. First operand has 45 places, 42 transitions, 170 flow. Second operand 5 states and 120 transitions.
[2024-06-20 19:47:14,161 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 412 flow
[2024-06-20 19:47:14,162 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 408 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-06-20 19:47:14,163 INFO  L231             Difference]: Finished difference. Result has 50 places, 49 transitions, 249 flow
[2024-06-20 19:47:14,163 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=50, PETRI_TRANSITIONS=49}
[2024-06-20 19:47:14,164 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places.
[2024-06-20 19:47:14,164 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 249 flow
[2024-06-20 19:47:14,164 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:14,164 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:14,165 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:14,165 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 19:47:14,165 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:14,165 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:14,165 INFO  L85        PathProgramCache]: Analyzing trace with hash -304157824, now seen corresponding path program 1 times
[2024-06-20 19:47:14,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:14,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054269816]
[2024-06-20 19:47:14,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:14,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:14,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:17,889 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:17,890 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:17,892 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054269816]
[2024-06-20 19:47:17,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054269816] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:17,893 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:17,893 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:47:17,893 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89515938]
[2024-06-20 19:47:17,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:17,893 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:47:17,894 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:17,895 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:47:17,896 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:47:18,028 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-20 19:47:18,029 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 249 flow. Second operand  has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-20 19:47:18,029 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:18,029 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-20 19:47:18,029 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:18,876 INFO  L124   PetriNetUnfolderBase]: 1482/2232 cut-off events.
[2024-06-20 19:47:18,876 INFO  L125   PetriNetUnfolderBase]: For 2719/2734 co-relation queries the response was YES.
[2024-06-20 19:47:18,879 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6796 conditions, 2232 events. 1482/2232 cut-off events. For 2719/2734 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10257 event pairs, 484 based on Foata normal form. 24/2254 useless extension candidates. Maximal degree in co-relation 6778. Up to 1991 conditions per place. 
[2024-06-20 19:47:18,886 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 63 selfloop transitions, 19 changer transitions 0/87 dead transitions.
[2024-06-20 19:47:18,886 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 87 transitions, 521 flow
[2024-06-20 19:47:18,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:47:18,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:47:18,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions.
[2024-06-20 19:47:18,888 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5875
[2024-06-20 19:47:18,888 INFO  L175             Difference]: Start difference. First operand has 50 places, 49 transitions, 249 flow. Second operand 6 states and 141 transitions.
[2024-06-20 19:47:18,888 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 87 transitions, 521 flow
[2024-06-20 19:47:18,891 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 505 flow, removed 5 selfloop flow, removed 1 redundant places.
[2024-06-20 19:47:18,892 INFO  L231             Difference]: Finished difference. Result has 54 places, 50 transitions, 291 flow
[2024-06-20 19:47:18,892 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=54, PETRI_TRANSITIONS=50}
[2024-06-20 19:47:18,892 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places.
[2024-06-20 19:47:18,892 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 291 flow
[2024-06-20 19:47:18,893 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-20 19:47:18,893 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:18,893 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:18,893 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 19:47:18,893 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-20 19:47:18,894 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:18,894 INFO  L85        PathProgramCache]: Analyzing trace with hash -546325912, now seen corresponding path program 1 times
[2024-06-20 19:47:18,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:18,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928791177]
[2024-06-20 19:47:18,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:18,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:18,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:24,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:24,615 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:24,615 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928791177]
[2024-06-20 19:47:24,615 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928791177] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:24,615 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:24,615 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:47:24,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768813697]
[2024-06-20 19:47:24,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:24,616 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:47:24,616 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:24,617 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:47:24,617 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:47:24,764 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:47:24,764 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 291 flow. Second operand  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:24,764 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:24,764 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:47:24,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:25,415 INFO  L124   PetriNetUnfolderBase]: 1477/2225 cut-off events.
[2024-06-20 19:47:25,416 INFO  L125   PetriNetUnfolderBase]: For 3933/3948 co-relation queries the response was YES.
[2024-06-20 19:47:25,421 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7277 conditions, 2225 events. 1477/2225 cut-off events. For 3933/3948 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10131 event pairs, 700 based on Foata normal form. 8/2231 useless extension candidates. Maximal degree in co-relation 7255. Up to 2203 conditions per place. 
[2024-06-20 19:47:25,430 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 52 selfloop transitions, 8 changer transitions 0/64 dead transitions.
[2024-06-20 19:47:25,430 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 457 flow
[2024-06-20 19:47:25,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:47:25,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:47:25,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions.
[2024-06-20 19:47:25,431 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-20 19:47:25,431 INFO  L175             Difference]: Start difference. First operand has 54 places, 50 transitions, 291 flow. Second operand 5 states and 85 transitions.
[2024-06-20 19:47:25,432 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 457 flow
[2024-06-20 19:47:25,438 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 415 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-06-20 19:47:25,440 INFO  L231             Difference]: Finished difference. Result has 55 places, 53 transitions, 297 flow
[2024-06-20 19:47:25,440 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=55, PETRI_TRANSITIONS=53}
[2024-06-20 19:47:25,442 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places.
[2024-06-20 19:47:25,442 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 297 flow
[2024-06-20 19:47:25,443 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:25,444 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:25,444 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:25,444 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 19:47:25,444 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-20 19:47:25,445 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:25,445 INFO  L85        PathProgramCache]: Analyzing trace with hash 243767570, now seen corresponding path program 1 times
[2024-06-20 19:47:25,445 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:25,445 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461203515]
[2024-06-20 19:47:25,445 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:25,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:25,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:31,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:31,126 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:31,126 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461203515]
[2024-06-20 19:47:31,126 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461203515] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:31,126 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:31,126 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:47:31,126 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170280248]
[2024-06-20 19:47:31,126 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:31,127 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:47:31,127 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:31,127 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:47:31,127 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:47:31,251 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:31,252 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 297 flow. Second operand  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:31,252 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:31,252 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:31,252 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:32,004 INFO  L124   PetriNetUnfolderBase]: 1704/2550 cut-off events.
[2024-06-20 19:47:32,004 INFO  L125   PetriNetUnfolderBase]: For 5457/5457 co-relation queries the response was YES.
[2024-06-20 19:47:32,009 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8512 conditions, 2550 events. 1704/2550 cut-off events. For 5457/5457 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11720 event pairs, 828 based on Foata normal form. 2/2550 useless extension candidates. Maximal degree in co-relation 8488. Up to 2520 conditions per place. 
[2024-06-20 19:47:32,019 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 63 selfloop transitions, 11 changer transitions 0/77 dead transitions.
[2024-06-20 19:47:32,020 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 536 flow
[2024-06-20 19:47:32,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:47:32,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:47:32,021 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions.
[2024-06-20 19:47:32,021 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3958333333333333
[2024-06-20 19:47:32,021 INFO  L175             Difference]: Start difference. First operand has 55 places, 53 transitions, 297 flow. Second operand 6 states and 95 transitions.
[2024-06-20 19:47:32,021 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 536 flow
[2024-06-20 19:47:32,024 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 503 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-20 19:47:32,025 INFO  L231             Difference]: Finished difference. Result has 60 places, 62 transitions, 369 flow
[2024-06-20 19:47:32,025 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=369, PETRI_PLACES=60, PETRI_TRANSITIONS=62}
[2024-06-20 19:47:32,026 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places.
[2024-06-20 19:47:32,026 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 369 flow
[2024-06-20 19:47:32,026 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:32,026 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:32,026 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:32,026 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 19:47:32,027 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-20 19:47:32,027 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:32,027 INFO  L85        PathProgramCache]: Analyzing trace with hash -1038860089, now seen corresponding path program 1 times
[2024-06-20 19:47:32,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:32,027 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508505967]
[2024-06-20 19:47:32,027 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:32,027 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:32,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:38,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:38,014 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:38,015 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508505967]
[2024-06-20 19:47:38,015 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508505967] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:38,015 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:38,015 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:47:38,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652378301]
[2024-06-20 19:47:38,015 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:38,015 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:47:38,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:38,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:47:38,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:47:38,109 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:47:38,109 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 369 flow. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:38,109 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:38,109 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:47:38,109 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:38,976 INFO  L124   PetriNetUnfolderBase]: 1650/2481 cut-off events.
[2024-06-20 19:47:38,976 INFO  L125   PetriNetUnfolderBase]: For 7642/7691 co-relation queries the response was YES.
[2024-06-20 19:47:38,981 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9083 conditions, 2481 events. 1650/2481 cut-off events. For 7642/7691 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11426 event pairs, 720 based on Foata normal form. 16/2487 useless extension candidates. Maximal degree in co-relation 9056. Up to 2412 conditions per place. 
[2024-06-20 19:47:38,995 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 68 selfloop transitions, 18 changer transitions 0/93 dead transitions.
[2024-06-20 19:47:38,996 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 669 flow
[2024-06-20 19:47:38,997 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:47:38,997 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:47:38,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-20 19:47:38,998 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45416666666666666
[2024-06-20 19:47:38,998 INFO  L175             Difference]: Start difference. First operand has 60 places, 62 transitions, 369 flow. Second operand 6 states and 109 transitions.
[2024-06-20 19:47:38,998 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 669 flow
[2024-06-20 19:47:39,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 93 transitions, 661 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-06-20 19:47:39,002 INFO  L231             Difference]: Finished difference. Result has 67 places, 73 transitions, 511 flow
[2024-06-20 19:47:39,003 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=511, PETRI_PLACES=67, PETRI_TRANSITIONS=73}
[2024-06-20 19:47:39,003 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places.
[2024-06-20 19:47:39,004 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 511 flow
[2024-06-20 19:47:39,004 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:39,004 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:39,004 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:39,004 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:47:39,004 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-20 19:47:39,005 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:39,005 INFO  L85        PathProgramCache]: Analyzing trace with hash 130490291, now seen corresponding path program 2 times
[2024-06-20 19:47:39,005 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:39,005 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145638307]
[2024-06-20 19:47:39,005 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:39,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:39,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:45,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:45,014 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:45,014 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145638307]
[2024-06-20 19:47:45,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145638307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:45,014 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:45,014 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:47:45,014 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736796579]
[2024-06-20 19:47:45,014 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:45,014 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:47:45,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:45,015 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:47:45,015 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:47:45,127 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:47:45,127 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 511 flow. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:45,127 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:45,127 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:47:45,127 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:45,900 INFO  L124   PetriNetUnfolderBase]: 1704/2560 cut-off events.
[2024-06-20 19:47:45,900 INFO  L125   PetriNetUnfolderBase]: For 10266/10336 co-relation queries the response was YES.
[2024-06-20 19:47:45,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10560 conditions, 2560 events. 1704/2560 cut-off events. For 10266/10336 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11830 event pairs, 722 based on Foata normal form. 17/2566 useless extension candidates. Maximal degree in co-relation 10528. Up to 2428 conditions per place. 
[2024-06-20 19:47:45,914 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 68 selfloop transitions, 25 changer transitions 0/100 dead transitions.
[2024-06-20 19:47:45,915 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 843 flow
[2024-06-20 19:47:45,915 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:47:45,915 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:47:45,915 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-20 19:47:45,916 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45416666666666666
[2024-06-20 19:47:45,916 INFO  L175             Difference]: Start difference. First operand has 67 places, 73 transitions, 511 flow. Second operand 6 states and 109 transitions.
[2024-06-20 19:47:45,916 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 843 flow
[2024-06-20 19:47:45,921 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 811 flow, removed 9 selfloop flow, removed 2 redundant places.
[2024-06-20 19:47:45,922 INFO  L231             Difference]: Finished difference. Result has 72 places, 81 transitions, 630 flow
[2024-06-20 19:47:45,923 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=72, PETRI_TRANSITIONS=81}
[2024-06-20 19:47:45,923 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places.
[2024-06-20 19:47:45,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 630 flow
[2024-06-20 19:47:45,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:45,923 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:45,924 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:45,924 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:47:45,924 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-20 19:47:45,924 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:45,924 INFO  L85        PathProgramCache]: Analyzing trace with hash -1033138233, now seen corresponding path program 1 times
[2024-06-20 19:47:45,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:45,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886482643]
[2024-06-20 19:47:45,924 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:45,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:45,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:52,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:52,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:52,289 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886482643]
[2024-06-20 19:47:52,290 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886482643] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:52,290 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:52,290 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:47:52,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508494576]
[2024-06-20 19:47:52,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:52,290 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:47:52,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:52,290 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:47:52,291 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:47:52,390 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:52,390 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 81 transitions, 630 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:52,390 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:52,390 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:52,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:53,219 INFO  L124   PetriNetUnfolderBase]: 1751/2617 cut-off events.
[2024-06-20 19:47:53,219 INFO  L125   PetriNetUnfolderBase]: For 12753/12753 co-relation queries the response was YES.
[2024-06-20 19:47:53,225 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11265 conditions, 2617 events. 1751/2617 cut-off events. For 12753/12753 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11966 event pairs, 792 based on Foata normal form. 2/2617 useless extension candidates. Maximal degree in co-relation 11230. Up to 2578 conditions per place. 
[2024-06-20 19:47:53,233 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 86 selfloop transitions, 14 changer transitions 0/103 dead transitions.
[2024-06-20 19:47:53,233 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 103 transitions, 896 flow
[2024-06-20 19:47:53,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:47:53,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:47:53,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-20 19:47:53,241 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3892857142857143
[2024-06-20 19:47:53,241 INFO  L175             Difference]: Start difference. First operand has 72 places, 81 transitions, 630 flow. Second operand 7 states and 109 transitions.
[2024-06-20 19:47:53,241 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 103 transitions, 896 flow
[2024-06-20 19:47:53,250 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 103 transitions, 851 flow, removed 17 selfloop flow, removed 2 redundant places.
[2024-06-20 19:47:53,251 INFO  L231             Difference]: Finished difference. Result has 77 places, 84 transitions, 645 flow
[2024-06-20 19:47:53,252 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=645, PETRI_PLACES=77, PETRI_TRANSITIONS=84}
[2024-06-20 19:47:53,254 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places.
[2024-06-20 19:47:53,254 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 84 transitions, 645 flow
[2024-06-20 19:47:53,255 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:53,255 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:53,255 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:53,255 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:47:53,255 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-20 19:47:53,255 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:53,256 INFO  L85        PathProgramCache]: Analyzing trace with hash 2053725543, now seen corresponding path program 1 times
[2024-06-20 19:47:53,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:53,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446975965]
[2024-06-20 19:47:53,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:53,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:53,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:58,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-20 19:47:58,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:58,717 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446975965]
[2024-06-20 19:47:58,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446975965] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:58,717 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:58,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:47:58,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163584813]
[2024-06-20 19:47:58,717 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:58,717 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:47:58,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:58,718 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:47:58,718 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:47:58,839 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:47:58,839 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 645 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:58,839 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:58,839 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:47:58,840 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:59,774 INFO  L124   PetriNetUnfolderBase]: 1731/2601 cut-off events.
[2024-06-20 19:47:59,775 INFO  L125   PetriNetUnfolderBase]: For 17127/17164 co-relation queries the response was YES.
[2024-06-20 19:47:59,780 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11968 conditions, 2601 events. 1731/2601 cut-off events. For 17127/17164 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12198 event pairs, 572 based on Foata normal form. 27/2580 useless extension candidates. Maximal degree in co-relation 11931. Up to 2368 conditions per place. 
[2024-06-20 19:47:59,786 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 84 selfloop transitions, 33 changer transitions 0/125 dead transitions.
[2024-06-20 19:47:59,786 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 125 transitions, 1050 flow
[2024-06-20 19:47:59,787 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:47:59,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:47:59,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-20 19:47:59,788 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4857142857142857
[2024-06-20 19:47:59,788 INFO  L175             Difference]: Start difference. First operand has 77 places, 84 transitions, 645 flow. Second operand 7 states and 136 transitions.
[2024-06-20 19:47:59,788 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 125 transitions, 1050 flow
[2024-06-20 19:47:59,795 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 125 transitions, 1014 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-06-20 19:47:59,796 INFO  L231             Difference]: Finished difference. Result has 80 places, 93 transitions, 766 flow
[2024-06-20 19:47:59,796 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=766, PETRI_PLACES=80, PETRI_TRANSITIONS=93}
[2024-06-20 19:47:59,797 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places.
[2024-06-20 19:47:59,797 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 93 transitions, 766 flow
[2024-06-20 19:47:59,797 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:59,797 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:59,797 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:59,798 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:47:59,798 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-20 19:47:59,798 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:59,798 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139890029, now seen corresponding path program 1 times
[2024-06-20 19:47:59,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:59,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103514161]
[2024-06-20 19:47:59,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:59,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:59,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:05,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:05,497 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:05,497 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103514161]
[2024-06-20 19:48:05,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103514161] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:05,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:05,497 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:48:05,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344789381]
[2024-06-20 19:48:05,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:05,498 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:48:05,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:05,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:48:05,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:48:05,603 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:05,608 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 93 transitions, 766 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:05,608 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:05,608 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:05,608 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:06,500 INFO  L124   PetriNetUnfolderBase]: 1829/2729 cut-off events.
[2024-06-20 19:48:06,500 INFO  L125   PetriNetUnfolderBase]: For 18296/18296 co-relation queries the response was YES.
[2024-06-20 19:48:06,508 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13344 conditions, 2729 events. 1829/2729 cut-off events. For 18296/18296 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12475 event pairs, 626 based on Foata normal form. 2/2729 useless extension candidates. Maximal degree in co-relation 13305. Up to 2684 conditions per place. 
[2024-06-20 19:48:06,517 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 107 selfloop transitions, 14 changer transitions 0/124 dead transitions.
[2024-06-20 19:48:06,517 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 124 transitions, 1135 flow
[2024-06-20 19:48:06,519 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:48:06,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:48:06,519 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-20 19:48:06,519 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:48:06,519 INFO  L175             Difference]: Start difference. First operand has 80 places, 93 transitions, 766 flow. Second operand 7 states and 112 transitions.
[2024-06-20 19:48:06,520 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 124 transitions, 1135 flow
[2024-06-20 19:48:06,531 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 124 transitions, 1062 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-20 19:48:06,533 INFO  L231             Difference]: Finished difference. Result has 86 places, 102 transitions, 822 flow
[2024-06-20 19:48:06,533 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=822, PETRI_PLACES=86, PETRI_TRANSITIONS=102}
[2024-06-20 19:48:06,534 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places.
[2024-06-20 19:48:06,534 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 102 transitions, 822 flow
[2024-06-20 19:48:06,534 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:06,534 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:06,534 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:06,534 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:48:06,534 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-20 19:48:06,535 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:06,535 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139890215, now seen corresponding path program 2 times
[2024-06-20 19:48:06,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:06,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25174124]
[2024-06-20 19:48:06,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:06,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:06,563 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:12,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:12,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:12,592 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25174124]
[2024-06-20 19:48:12,592 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25174124] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:12,592 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:12,592 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:48:12,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276089574]
[2024-06-20 19:48:12,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:12,593 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:48:12,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:12,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:48:12,593 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:48:12,741 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:48:12,741 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 102 transitions, 822 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:12,741 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:12,741 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:48:12,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:13,800 INFO  L124   PetriNetUnfolderBase]: 1843/2766 cut-off events.
[2024-06-20 19:48:13,800 INFO  L125   PetriNetUnfolderBase]: For 24588/24635 co-relation queries the response was YES.
[2024-06-20 19:48:13,808 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14255 conditions, 2766 events. 1843/2766 cut-off events. For 24588/24635 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13064 event pairs, 544 based on Foata normal form. 34/2757 useless extension candidates. Maximal degree in co-relation 14213. Up to 2416 conditions per place. 
[2024-06-20 19:48:13,825 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 88 selfloop transitions, 45 changer transitions 0/144 dead transitions.
[2024-06-20 19:48:13,826 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 144 transitions, 1366 flow
[2024-06-20 19:48:13,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:48:13,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:48:13,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-20 19:48:13,827 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48928571428571427
[2024-06-20 19:48:13,827 INFO  L175             Difference]: Start difference. First operand has 86 places, 102 transitions, 822 flow. Second operand 7 states and 137 transitions.
[2024-06-20 19:48:13,827 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 144 transitions, 1366 flow
[2024-06-20 19:48:13,840 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 144 transitions, 1340 flow, removed 10 selfloop flow, removed 2 redundant places.
[2024-06-20 19:48:13,842 INFO  L231             Difference]: Finished difference. Result has 92 places, 111 transitions, 1029 flow
[2024-06-20 19:48:13,842 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1029, PETRI_PLACES=92, PETRI_TRANSITIONS=111}
[2024-06-20 19:48:13,843 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places.
[2024-06-20 19:48:13,843 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 111 transitions, 1029 flow
[2024-06-20 19:48:13,843 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:13,843 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:13,843 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:13,844 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:48:13,844 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-20 19:48:13,844 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:13,844 INFO  L85        PathProgramCache]: Analyzing trace with hash 2058493839, now seen corresponding path program 2 times
[2024-06-20 19:48:13,844 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:13,844 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325174862]
[2024-06-20 19:48:13,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:13,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:13,879 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:20,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:20,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:20,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325174862]
[2024-06-20 19:48:20,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325174862] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:20,196 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:20,196 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:48:20,196 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212048432]
[2024-06-20 19:48:20,196 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:20,197 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:48:20,197 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:20,197 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:48:20,197 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:48:20,314 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:20,314 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 111 transitions, 1029 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:20,314 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:20,314 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:20,314 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:21,243 INFO  L124   PetriNetUnfolderBase]: 1956/2911 cut-off events.
[2024-06-20 19:48:21,243 INFO  L125   PetriNetUnfolderBase]: For 27701/27716 co-relation queries the response was YES.
[2024-06-20 19:48:21,251 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15873 conditions, 2911 events. 1956/2911 cut-off events. For 27701/27716 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13401 event pairs, 624 based on Foata normal form. 12/2919 useless extension candidates. Maximal degree in co-relation 15828. Up to 2817 conditions per place. 
[2024-06-20 19:48:21,258 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 111 selfloop transitions, 27 changer transitions 0/141 dead transitions.
[2024-06-20 19:48:21,259 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 141 transitions, 1475 flow
[2024-06-20 19:48:21,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:48:21,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:48:21,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-20 19:48:21,261 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40714285714285714
[2024-06-20 19:48:21,261 INFO  L175             Difference]: Start difference. First operand has 92 places, 111 transitions, 1029 flow. Second operand 7 states and 114 transitions.
[2024-06-20 19:48:21,261 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 141 transitions, 1475 flow
[2024-06-20 19:48:21,276 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 141 transitions, 1395 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-20 19:48:21,277 INFO  L231             Difference]: Finished difference. Result has 97 places, 120 transitions, 1101 flow
[2024-06-20 19:48:21,278 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1101, PETRI_PLACES=97, PETRI_TRANSITIONS=120}
[2024-06-20 19:48:21,278 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 56 predicate places.
[2024-06-20 19:48:21,278 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 120 transitions, 1101 flow
[2024-06-20 19:48:21,278 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:21,279 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:21,279 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:21,279 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:48:21,279 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-20 19:48:21,279 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:21,279 INFO  L85        PathProgramCache]: Analyzing trace with hash -1962758509, now seen corresponding path program 3 times
[2024-06-20 19:48:21,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:21,280 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877276728]
[2024-06-20 19:48:21,280 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:21,280 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:21,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:27,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:27,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:27,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877276728]
[2024-06-20 19:48:27,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877276728] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:27,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:27,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:48:27,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475055834]
[2024-06-20 19:48:27,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:27,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:48:27,270 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:27,270 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:48:27,270 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:48:27,394 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:27,394 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 120 transitions, 1101 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:27,394 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:27,394 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:27,394 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:28,305 INFO  L124   PetriNetUnfolderBase]: 1951/2904 cut-off events.
[2024-06-20 19:48:28,305 INFO  L125   PetriNetUnfolderBase]: For 30541/30556 co-relation queries the response was YES.
[2024-06-20 19:48:28,314 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16269 conditions, 2904 events. 1951/2904 cut-off events. For 30541/30556 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13395 event pairs, 642 based on Foata normal form. 12/2912 useless extension candidates. Maximal degree in co-relation 16221. Up to 2812 conditions per place. 
[2024-06-20 19:48:28,324 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 110 selfloop transitions, 26 changer transitions 0/139 dead transitions.
[2024-06-20 19:48:28,324 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 139 transitions, 1421 flow
[2024-06-20 19:48:28,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:48:28,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:48:28,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-20 19:48:28,327 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-20 19:48:28,327 INFO  L175             Difference]: Start difference. First operand has 97 places, 120 transitions, 1101 flow. Second operand 7 states and 113 transitions.
[2024-06-20 19:48:28,327 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 139 transitions, 1421 flow
[2024-06-20 19:48:28,348 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 139 transitions, 1377 flow, removed 18 selfloop flow, removed 2 redundant places.
[2024-06-20 19:48:28,350 INFO  L231             Difference]: Finished difference. Result has 102 places, 120 transitions, 1117 flow
[2024-06-20 19:48:28,351 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1117, PETRI_PLACES=102, PETRI_TRANSITIONS=120}
[2024-06-20 19:48:28,351 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places.
[2024-06-20 19:48:28,351 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 120 transitions, 1117 flow
[2024-06-20 19:48:28,351 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:28,351 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:28,352 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:28,352 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:48:28,352 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-20 19:48:28,352 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:28,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 2058487143, now seen corresponding path program 3 times
[2024-06-20 19:48:28,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:28,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913939289]
[2024-06-20 19:48:28,353 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:28,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:28,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:34,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:34,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:34,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913939289]
[2024-06-20 19:48:34,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913939289] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:34,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:34,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:48:34,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861176912]
[2024-06-20 19:48:34,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:34,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:48:34,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:34,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:48:34,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:48:34,432 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:48:34,433 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 120 transitions, 1117 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:34,433 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:34,433 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:48:34,433 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:35,406 INFO  L124   PetriNetUnfolderBase]: 1895/2846 cut-off events.
[2024-06-20 19:48:35,406 INFO  L125   PetriNetUnfolderBase]: For 36571/36628 co-relation queries the response was YES.
[2024-06-20 19:48:35,414 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16427 conditions, 2846 events. 1895/2846 cut-off events. For 36571/36628 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13489 event pairs, 580 based on Foata normal form. 27/2819 useless extension candidates. Maximal degree in co-relation 16377. Up to 2295 conditions per place. 
[2024-06-20 19:48:35,421 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 93 selfloop transitions, 55 changer transitions 0/162 dead transitions.
[2024-06-20 19:48:35,422 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 162 transitions, 1781 flow
[2024-06-20 19:48:35,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:48:35,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:48:35,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-20 19:48:35,423 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4785714285714286
[2024-06-20 19:48:35,423 INFO  L175             Difference]: Start difference. First operand has 102 places, 120 transitions, 1117 flow. Second operand 7 states and 134 transitions.
[2024-06-20 19:48:35,423 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 162 transitions, 1781 flow
[2024-06-20 19:48:35,440 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 162 transitions, 1697 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-20 19:48:35,442 INFO  L231             Difference]: Finished difference. Result has 104 places, 131 transitions, 1356 flow
[2024-06-20 19:48:35,442 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1356, PETRI_PLACES=104, PETRI_TRANSITIONS=131}
[2024-06-20 19:48:35,442 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places.
[2024-06-20 19:48:35,443 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 131 transitions, 1356 flow
[2024-06-20 19:48:35,443 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:35,443 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:35,443 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:35,443 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:48:35,443 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-20 19:48:35,443 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:35,444 INFO  L85        PathProgramCache]: Analyzing trace with hash -1962512431, now seen corresponding path program 1 times
[2024-06-20 19:48:35,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:35,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979215862]
[2024-06-20 19:48:35,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:35,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:35,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:42,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:42,110 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:42,110 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979215862]
[2024-06-20 19:48:42,110 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979215862] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:42,110 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:42,110 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:48:42,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501631453]
[2024-06-20 19:48:42,111 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:42,111 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:48:42,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:42,111 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:48:42,111 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:48:42,235 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:42,235 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 131 transitions, 1356 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:42,235 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:42,235 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:42,235 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:43,252 INFO  L124   PetriNetUnfolderBase]: 1963/2919 cut-off events.
[2024-06-20 19:48:43,252 INFO  L125   PetriNetUnfolderBase]: For 38668/38668 co-relation queries the response was YES.
[2024-06-20 19:48:43,261 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17676 conditions, 2919 events. 1963/2919 cut-off events. For 38668/38668 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13477 event pairs, 618 based on Foata normal form. 4/2921 useless extension candidates. Maximal degree in co-relation 17625. Up to 2862 conditions per place. 
[2024-06-20 19:48:43,268 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 138 selfloop transitions, 16 changer transitions 0/157 dead transitions.
[2024-06-20 19:48:43,268 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 157 transitions, 1746 flow
[2024-06-20 19:48:43,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:48:43,270 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:48:43,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions.
[2024-06-20 19:48:43,271 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.384375
[2024-06-20 19:48:43,271 INFO  L175             Difference]: Start difference. First operand has 104 places, 131 transitions, 1356 flow. Second operand 8 states and 123 transitions.
[2024-06-20 19:48:43,271 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 157 transitions, 1746 flow
[2024-06-20 19:48:43,295 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 157 transitions, 1658 flow, removed 34 selfloop flow, removed 2 redundant places.
[2024-06-20 19:48:43,297 INFO  L231             Difference]: Finished difference. Result has 110 places, 133 transitions, 1333 flow
[2024-06-20 19:48:43,297 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1333, PETRI_PLACES=110, PETRI_TRANSITIONS=133}
[2024-06-20 19:48:43,298 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places.
[2024-06-20 19:48:43,298 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 133 transitions, 1333 flow
[2024-06-20 19:48:43,298 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:43,298 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:43,298 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:43,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:48:43,299 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-20 19:48:43,299 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:43,299 INFO  L85        PathProgramCache]: Analyzing trace with hash 647715542, now seen corresponding path program 1 times
[2024-06-20 19:48:43,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:43,299 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711465792]
[2024-06-20 19:48:43,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:43,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:43,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:49,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:49,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:49,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711465792]
[2024-06-20 19:48:49,094 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711465792] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:49,094 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:49,094 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:48:49,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134763458]
[2024-06-20 19:48:49,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:49,095 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:48:49,095 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:49,095 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:48:49,095 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:48:49,204 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:48:49,204 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 133 transitions, 1333 flow. Second operand  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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-20 19:48:49,205 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:49,205 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:48:49,205 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:50,228 INFO  L124   PetriNetUnfolderBase]: 1880/2816 cut-off events.
[2024-06-20 19:48:50,228 INFO  L125   PetriNetUnfolderBase]: For 41518/41582 co-relation queries the response was YES.
[2024-06-20 19:48:50,238 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17335 conditions, 2816 events. 1880/2816 cut-off events. For 41518/41582 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13219 event pairs, 565 based on Foata normal form. 35/2824 useless extension candidates. Maximal degree in co-relation 17282. Up to 2541 conditions per place. 
[2024-06-20 19:48:50,246 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 114 selfloop transitions, 42 changer transitions 0/171 dead transitions.
[2024-06-20 19:48:50,247 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 171 transitions, 1849 flow
[2024-06-20 19:48:50,247 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:48:50,247 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:48:50,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-20 19:48:50,248 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48928571428571427
[2024-06-20 19:48:50,248 INFO  L175             Difference]: Start difference. First operand has 110 places, 133 transitions, 1333 flow. Second operand 7 states and 137 transitions.
[2024-06-20 19:48:50,248 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 171 transitions, 1849 flow
[2024-06-20 19:48:50,273 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 171 transitions, 1804 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-20 19:48:50,275 INFO  L231             Difference]: Finished difference. Result has 112 places, 140 transitions, 1484 flow
[2024-06-20 19:48:50,275 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1484, PETRI_PLACES=112, PETRI_TRANSITIONS=140}
[2024-06-20 19:48:50,275 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places.
[2024-06-20 19:48:50,275 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 140 transitions, 1484 flow
[2024-06-20 19:48:50,275 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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-20 19:48:50,276 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:50,276 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:50,276 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:48:50,276 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-20 19:48:50,276 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:50,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -759015949, now seen corresponding path program 1 times
[2024-06-20 19:48:50,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:50,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772988295]
[2024-06-20 19:48:50,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:50,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:50,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:55,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:55,868 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:55,868 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772988295]
[2024-06-20 19:48:55,868 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772988295] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:55,868 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:55,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:48:55,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113875592]
[2024-06-20 19:48:55,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:55,868 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:48:55,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:55,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:48:55,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:48:56,030 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:56,030 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 140 transitions, 1484 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:56,030 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:56,030 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:56,030 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:57,003 INFO  L124   PetriNetUnfolderBase]: 1990/2959 cut-off events.
[2024-06-20 19:48:57,003 INFO  L125   PetriNetUnfolderBase]: For 45021/45021 co-relation queries the response was YES.
[2024-06-20 19:48:57,014 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18550 conditions, 2959 events. 1990/2959 cut-off events. For 45021/45021 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13561 event pairs, 597 based on Foata normal form. 4/2961 useless extension candidates. Maximal degree in co-relation 18495. Up to 2861 conditions per place. 
[2024-06-20 19:48:57,024 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 160 selfloop transitions, 20 changer transitions 0/183 dead transitions.
[2024-06-20 19:48:57,024 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 183 transitions, 2051 flow
[2024-06-20 19:48:57,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:48:57,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:48:57,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-20 19:48:57,027 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4125
[2024-06-20 19:48:57,027 INFO  L175             Difference]: Start difference. First operand has 112 places, 140 transitions, 1484 flow. Second operand 8 states and 132 transitions.
[2024-06-20 19:48:57,027 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 183 transitions, 2051 flow
[2024-06-20 19:48:57,059 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 183 transitions, 1975 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-20 19:48:57,061 INFO  L231             Difference]: Finished difference. Result has 120 places, 152 transitions, 1615 flow
[2024-06-20 19:48:57,061 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1615, PETRI_PLACES=120, PETRI_TRANSITIONS=152}
[2024-06-20 19:48:57,062 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 79 predicate places.
[2024-06-20 19:48:57,062 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 152 transitions, 1615 flow
[2024-06-20 19:48:57,062 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:57,062 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:57,062 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:57,063 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:48:57,063 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-20 19:48:57,063 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:57,063 INFO  L85        PathProgramCache]: Analyzing trace with hash -915277533, now seen corresponding path program 2 times
[2024-06-20 19:48:57,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:57,063 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468304138]
[2024-06-20 19:48:57,063 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:57,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:57,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:02,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:02,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:02,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468304138]
[2024-06-20 19:49:02,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468304138] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:02,843 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:02,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:49:02,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668656253]
[2024-06-20 19:49:02,843 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:02,844 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:49:02,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:02,844 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:49:02,844 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:49:02,954 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:02,954 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 152 transitions, 1615 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:02,955 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:02,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:02,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:04,029 INFO  L124   PetriNetUnfolderBase]: 2140/3175 cut-off events.
[2024-06-20 19:49:04,029 INFO  L125   PetriNetUnfolderBase]: For 52799/52799 co-relation queries the response was YES.
[2024-06-20 19:49:04,040 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20308 conditions, 3175 events. 2140/3175 cut-off events. For 52799/52799 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14658 event pairs, 548 based on Foata normal form. 4/3177 useless extension candidates. Maximal degree in co-relation 20249. Up to 2877 conditions per place. 
[2024-06-20 19:49:04,048 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 164 selfloop transitions, 34 changer transitions 0/201 dead transitions.
[2024-06-20 19:49:04,048 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 201 transitions, 2401 flow
[2024-06-20 19:49:04,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:49:04,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:49:04,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-20 19:49:04,051 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 19:49:04,051 INFO  L175             Difference]: Start difference. First operand has 120 places, 152 transitions, 1615 flow. Second operand 8 states and 140 transitions.
[2024-06-20 19:49:04,051 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 201 transitions, 2401 flow
[2024-06-20 19:49:04,089 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 201 transitions, 2359 flow, removed 18 selfloop flow, removed 2 redundant places.
[2024-06-20 19:49:04,091 INFO  L231             Difference]: Finished difference. Result has 128 places, 166 transitions, 1832 flow
[2024-06-20 19:49:04,091 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1832, PETRI_PLACES=128, PETRI_TRANSITIONS=166}
[2024-06-20 19:49:04,092 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 87 predicate places.
[2024-06-20 19:49:04,092 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 166 transitions, 1832 flow
[2024-06-20 19:49:04,092 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:04,092 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:04,092 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:04,092 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:49:04,092 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-20 19:49:04,093 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:04,093 INFO  L85        PathProgramCache]: Analyzing trace with hash -1912079987, now seen corresponding path program 3 times
[2024-06-20 19:49:04,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:04,093 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026005385]
[2024-06-20 19:49:04,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:04,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:04,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:10,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:10,177 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:10,177 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026005385]
[2024-06-20 19:49:10,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026005385] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:10,177 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:10,178 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:49:10,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229507725]
[2024-06-20 19:49:10,178 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:10,178 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:49:10,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:10,179 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:49:10,179 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:49:10,315 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:10,316 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 166 transitions, 1832 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:10,316 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:10,316 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:10,316 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:11,308 INFO  L124   PetriNetUnfolderBase]: 2126/3157 cut-off events.
[2024-06-20 19:49:11,308 INFO  L125   PetriNetUnfolderBase]: For 59442/59442 co-relation queries the response was YES.
[2024-06-20 19:49:11,320 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21316 conditions, 3157 events. 2126/3157 cut-off events. For 59442/59442 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14608 event pairs, 539 based on Foata normal form. 8/3163 useless extension candidates. Maximal degree in co-relation 21253. Up to 2873 conditions per place. 
[2024-06-20 19:49:11,373 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 161 selfloop transitions, 37 changer transitions 0/201 dead transitions.
[2024-06-20 19:49:11,373 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 201 transitions, 2438 flow
[2024-06-20 19:49:11,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:49:11,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:49:11,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions.
[2024-06-20 19:49:11,375 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.428125
[2024-06-20 19:49:11,375 INFO  L175             Difference]: Start difference. First operand has 128 places, 166 transitions, 1832 flow. Second operand 8 states and 137 transitions.
[2024-06-20 19:49:11,375 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 201 transitions, 2438 flow
[2024-06-20 19:49:11,421 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 201 transitions, 2358 flow, removed 33 selfloop flow, removed 3 redundant places.
[2024-06-20 19:49:11,423 INFO  L231             Difference]: Finished difference. Result has 134 places, 169 transitions, 1890 flow
[2024-06-20 19:49:11,424 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1890, PETRI_PLACES=134, PETRI_TRANSITIONS=169}
[2024-06-20 19:49:11,424 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 93 predicate places.
[2024-06-20 19:49:11,424 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 169 transitions, 1890 flow
[2024-06-20 19:49:11,424 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:11,424 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:11,424 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:11,424 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:49:11,424 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-20 19:49:11,425 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:11,425 INFO  L85        PathProgramCache]: Analyzing trace with hash 647869364, now seen corresponding path program 1 times
[2024-06-20 19:49:11,425 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:11,425 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280585194]
[2024-06-20 19:49:11,425 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:11,426 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:11,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:17,719 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:17,719 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:17,719 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280585194]
[2024-06-20 19:49:17,719 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280585194] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:17,719 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:17,719 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:49:17,719 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289430405]
[2024-06-20 19:49:17,720 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:17,720 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:49:17,720 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:17,720 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:49:17,720 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:49:17,828 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:17,828 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 169 transitions, 1890 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:17,828 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:17,828 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:17,828 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:18,850 INFO  L124   PetriNetUnfolderBase]: 2115/3140 cut-off events.
[2024-06-20 19:49:18,850 INFO  L125   PetriNetUnfolderBase]: For 61993/61993 co-relation queries the response was YES.
[2024-06-20 19:49:18,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21405 conditions, 3140 events. 2115/3140 cut-off events. For 61993/61993 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14470 event pairs, 583 based on Foata normal form. 2/3140 useless extension candidates. Maximal degree in co-relation 21339. Up to 3086 conditions per place. 
[2024-06-20 19:49:18,874 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 177 selfloop transitions, 17 changer transitions 0/197 dead transitions.
[2024-06-20 19:49:18,875 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 197 transitions, 2368 flow
[2024-06-20 19:49:18,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:49:18,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:49:18,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions.
[2024-06-20 19:49:18,877 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39375
[2024-06-20 19:49:18,877 INFO  L175             Difference]: Start difference. First operand has 134 places, 169 transitions, 1890 flow. Second operand 8 states and 126 transitions.
[2024-06-20 19:49:18,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 197 transitions, 2368 flow
[2024-06-20 19:49:18,969 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 197 transitions, 2311 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-20 19:49:18,972 INFO  L231             Difference]: Finished difference. Result has 138 places, 171 transitions, 1903 flow
[2024-06-20 19:49:18,972 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1835, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1903, PETRI_PLACES=138, PETRI_TRANSITIONS=171}
[2024-06-20 19:49:18,972 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 97 predicate places.
[2024-06-20 19:49:18,972 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 171 transitions, 1903 flow
[2024-06-20 19:49:18,972 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:18,972 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:18,973 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:18,973 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 19:49:18,973 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-20 19:49:18,973 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:18,973 INFO  L85        PathProgramCache]: Analyzing trace with hash -708351386, now seen corresponding path program 2 times
[2024-06-20 19:49:18,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:18,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589223073]
[2024-06-20 19:49:18,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:18,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:19,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:25,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:25,563 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:25,563 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589223073]
[2024-06-20 19:49:25,563 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589223073] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:25,563 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:25,563 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:49:25,563 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383595516]
[2024-06-20 19:49:25,563 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:25,563 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:49:25,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:25,564 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:49:25,564 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:49:25,716 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:25,716 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 171 transitions, 1903 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:25,716 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:25,716 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:25,716 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:26,793 INFO  L124   PetriNetUnfolderBase]: 2158/3207 cut-off events.
[2024-06-20 19:49:26,793 INFO  L125   PetriNetUnfolderBase]: For 67892/67904 co-relation queries the response was YES.
[2024-06-20 19:49:26,804 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21899 conditions, 3207 events. 2158/3207 cut-off events. For 67892/67904 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14882 event pairs, 542 based on Foata normal form. 6/3206 useless extension candidates. Maximal degree in co-relation 21832. Up to 2773 conditions per place. 
[2024-06-20 19:49:26,813 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 148 selfloop transitions, 67 changer transitions 0/218 dead transitions.
[2024-06-20 19:49:26,813 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 218 transitions, 2759 flow
[2024-06-20 19:49:26,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:49:26,815 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:49:26,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-20 19:49:26,815 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.434375
[2024-06-20 19:49:26,815 INFO  L175             Difference]: Start difference. First operand has 138 places, 171 transitions, 1903 flow. Second operand 8 states and 139 transitions.
[2024-06-20 19:49:26,815 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 218 transitions, 2759 flow
[2024-06-20 19:49:26,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 218 transitions, 2713 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-20 19:49:26,863 INFO  L231             Difference]: Finished difference. Result has 142 places, 188 transitions, 2248 flow
[2024-06-20 19:49:26,863 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2248, PETRI_PLACES=142, PETRI_TRANSITIONS=188}
[2024-06-20 19:49:26,863 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 101 predicate places.
[2024-06-20 19:49:26,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 188 transitions, 2248 flow
[2024-06-20 19:49:26,864 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:26,864 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:26,864 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:26,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 19:49:26,864 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-20 19:49:26,864 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:26,864 INFO  L85        PathProgramCache]: Analyzing trace with hash -708618296, now seen corresponding path program 3 times
[2024-06-20 19:49:26,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:26,864 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321209063]
[2024-06-20 19:49:26,864 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:26,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:26,895 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:33,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:33,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:33,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321209063]
[2024-06-20 19:49:33,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321209063] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:33,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:33,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:49:33,282 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926145042]
[2024-06-20 19:49:33,282 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:33,283 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:49:33,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:33,283 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:49:33,283 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:49:33,387 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:33,388 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 188 transitions, 2248 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:33,388 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:33,388 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:33,388 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:34,486 INFO  L124   PetriNetUnfolderBase]: 2169/3220 cut-off events.
[2024-06-20 19:49:34,486 INFO  L125   PetriNetUnfolderBase]: For 75436/75463 co-relation queries the response was YES.
[2024-06-20 19:49:34,499 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23236 conditions, 3220 events. 2169/3220 cut-off events. For 75436/75463 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14917 event pairs, 573 based on Foata normal form. 20/3236 useless extension candidates. Maximal degree in co-relation 23166. Up to 3119 conditions per place. 
[2024-06-20 19:49:34,510 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 181 selfloop transitions, 30 changer transitions 0/214 dead transitions.
[2024-06-20 19:49:34,510 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 214 transitions, 2768 flow
[2024-06-20 19:49:34,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:49:34,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:49:34,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions.
[2024-06-20 19:49:34,512 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39375
[2024-06-20 19:49:34,512 INFO  L175             Difference]: Start difference. First operand has 142 places, 188 transitions, 2248 flow. Second operand 8 states and 126 transitions.
[2024-06-20 19:49:34,512 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 214 transitions, 2768 flow
[2024-06-20 19:49:34,580 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 214 transitions, 2684 flow, removed 36 selfloop flow, removed 2 redundant places.
[2024-06-20 19:49:34,582 INFO  L231             Difference]: Finished difference. Result has 148 places, 191 transitions, 2278 flow
[2024-06-20 19:49:34,582 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2176, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2278, PETRI_PLACES=148, PETRI_TRANSITIONS=191}
[2024-06-20 19:49:34,583 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 107 predicate places.
[2024-06-20 19:49:34,583 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 191 transitions, 2278 flow
[2024-06-20 19:49:34,583 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:34,583 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:34,583 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:34,583 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 19:49:34,583 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:34,584 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:34,584 INFO  L85        PathProgramCache]: Analyzing trace with hash -715975743, now seen corresponding path program 4 times
[2024-06-20 19:49:34,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:34,584 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745870920]
[2024-06-20 19:49:34,584 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:34,584 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:34,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:40,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:40,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:40,648 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745870920]
[2024-06-20 19:49:40,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745870920] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:40,648 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:40,649 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:49:40,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455364130]
[2024-06-20 19:49:40,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:40,650 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:49:40,650 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:40,650 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:49:40,650 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:49:40,782 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:40,784 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 191 transitions, 2278 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:40,784 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:40,784 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:40,784 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:41,873 INFO  L124   PetriNetUnfolderBase]: 2191/3255 cut-off events.
[2024-06-20 19:49:41,874 INFO  L125   PetriNetUnfolderBase]: For 81429/81441 co-relation queries the response was YES.
[2024-06-20 19:49:41,889 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23642 conditions, 3255 events. 2191/3255 cut-off events. For 81429/81441 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15127 event pairs, 548 based on Foata normal form. 8/3256 useless extension candidates. Maximal degree in co-relation 23570. Up to 2740 conditions per place. 
[2024-06-20 19:49:41,900 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 158 selfloop transitions, 70 changer transitions 0/231 dead transitions.
[2024-06-20 19:49:41,901 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 231 transitions, 3190 flow
[2024-06-20 19:49:41,902 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:49:41,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:49:41,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-20 19:49:41,903 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.453125
[2024-06-20 19:49:41,903 INFO  L175             Difference]: Start difference. First operand has 148 places, 191 transitions, 2278 flow. Second operand 8 states and 145 transitions.
[2024-06-20 19:49:41,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 231 transitions, 3190 flow
[2024-06-20 19:49:41,970 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 231 transitions, 3118 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-20 19:49:41,973 INFO  L231             Difference]: Finished difference. Result has 151 places, 198 transitions, 2471 flow
[2024-06-20 19:49:41,973 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2206, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2471, PETRI_PLACES=151, PETRI_TRANSITIONS=198}
[2024-06-20 19:49:41,973 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 110 predicate places.
[2024-06-20 19:49:41,973 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 198 transitions, 2471 flow
[2024-06-20 19:49:41,973 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:41,973 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:41,974 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:41,974 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 19:49:41,974 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-20 19:49:41,974 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:41,974 INFO  L85        PathProgramCache]: Analyzing trace with hash -715969946, now seen corresponding path program 4 times
[2024-06-20 19:49:41,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:41,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635002072]
[2024-06-20 19:49:41,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:41,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:42,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:48,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:48,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:48,302 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635002072]
[2024-06-20 19:49:48,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635002072] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:48,302 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:48,302 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:49:48,302 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589735517]
[2024-06-20 19:49:48,302 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:48,302 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:49:48,302 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:48,303 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:49:48,303 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:49:48,457 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:48,457 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 198 transitions, 2471 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:48,457 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:48,457 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:48,457 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:49,601 INFO  L124   PetriNetUnfolderBase]: 2246/3336 cut-off events.
[2024-06-20 19:49:49,601 INFO  L125   PetriNetUnfolderBase]: For 90082/90094 co-relation queries the response was YES.
[2024-06-20 19:49:49,616 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25024 conditions, 3336 events. 2246/3336 cut-off events. For 90082/90094 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15595 event pairs, 562 based on Foata normal form. 10/3339 useless extension candidates. Maximal degree in co-relation 24950. Up to 2954 conditions per place. 
[2024-06-20 19:49:49,628 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 175 selfloop transitions, 59 changer transitions 0/237 dead transitions.
[2024-06-20 19:49:49,628 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 237 transitions, 3401 flow
[2024-06-20 19:49:49,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:49:49,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:49:49,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-20 19:49:49,630 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.446875
[2024-06-20 19:49:49,630 INFO  L175             Difference]: Start difference. First operand has 151 places, 198 transitions, 2471 flow. Second operand 8 states and 143 transitions.
[2024-06-20 19:49:49,630 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 237 transitions, 3401 flow
[2024-06-20 19:49:49,703 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 237 transitions, 3255 flow, removed 38 selfloop flow, removed 3 redundant places.
[2024-06-20 19:49:49,706 INFO  L231             Difference]: Finished difference. Result has 156 places, 204 transitions, 2548 flow
[2024-06-20 19:49:49,706 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2346, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2548, PETRI_PLACES=156, PETRI_TRANSITIONS=204}
[2024-06-20 19:49:49,707 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 115 predicate places.
[2024-06-20 19:49:49,707 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 204 transitions, 2548 flow
[2024-06-20 19:49:49,707 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:49,707 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:49,707 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:49,708 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 19:49:49,708 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-20 19:49:49,708 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:49,708 INFO  L85        PathProgramCache]: Analyzing trace with hash -715970163, now seen corresponding path program 5 times
[2024-06-20 19:49:49,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:49,708 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804154635]
[2024-06-20 19:49:49,708 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:49,708 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:49,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:56,236 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:56,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:56,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804154635]
[2024-06-20 19:49:56,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804154635] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:56,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:56,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:49:56,237 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73434293]
[2024-06-20 19:49:56,237 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:56,237 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:49:56,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:56,238 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:49:56,238 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:49:56,360 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:56,360 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 204 transitions, 2548 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:56,360 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:56,360 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:56,361 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:57,485 INFO  L124   PetriNetUnfolderBase]: 2252/3344 cut-off events.
[2024-06-20 19:49:57,486 INFO  L125   PetriNetUnfolderBase]: For 94947/94959 co-relation queries the response was YES.
[2024-06-20 19:49:57,500 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24922 conditions, 3344 events. 2252/3344 cut-off events. For 94947/94959 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15590 event pairs, 561 based on Foata normal form. 12/3349 useless extension candidates. Maximal degree in co-relation 24847. Up to 2784 conditions per place. 
[2024-06-20 19:49:57,511 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 161 selfloop transitions, 74 changer transitions 0/238 dead transitions.
[2024-06-20 19:49:57,511 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 238 transitions, 3330 flow
[2024-06-20 19:49:57,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:49:57,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:49:57,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-20 19:49:57,513 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-20 19:49:57,513 INFO  L175             Difference]: Start difference. First operand has 156 places, 204 transitions, 2548 flow. Second operand 8 states and 144 transitions.
[2024-06-20 19:49:57,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 238 transitions, 3330 flow
[2024-06-20 19:49:57,595 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 238 transitions, 3233 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-20 19:49:57,598 INFO  L231             Difference]: Finished difference. Result has 161 places, 207 transitions, 2641 flow
[2024-06-20 19:49:57,599 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2451, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2641, PETRI_PLACES=161, PETRI_TRANSITIONS=207}
[2024-06-20 19:49:57,599 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 120 predicate places.
[2024-06-20 19:49:57,599 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 207 transitions, 2641 flow
[2024-06-20 19:49:57,599 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:57,599 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:57,599 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:57,600 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 19:49:57,600 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-20 19:49:57,600 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:57,600 INFO  L85        PathProgramCache]: Analyzing trace with hash -708618513, now seen corresponding path program 6 times
[2024-06-20 19:49:57,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:57,600 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516732732]
[2024-06-20 19:49:57,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:57,600 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:57,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:03,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:03,764 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:03,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516732732]
[2024-06-20 19:50:03,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516732732] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:03,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:03,764 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:50:03,764 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457565205]
[2024-06-20 19:50:03,764 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:03,765 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:50:03,765 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:03,765 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:50:03,765 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:50:03,911 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:50:03,912 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 207 transitions, 2641 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:03,912 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:03,912 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:50:03,912 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:04,961 INFO  L124   PetriNetUnfolderBase]: 2232/3316 cut-off events.
[2024-06-20 19:50:04,961 INFO  L125   PetriNetUnfolderBase]: For 98595/98607 co-relation queries the response was YES.
[2024-06-20 19:50:04,978 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24833 conditions, 3316 events. 2232/3316 cut-off events. For 98595/98607 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15426 event pairs, 541 based on Foata normal form. 12/3321 useless extension candidates. Maximal degree in co-relation 24757. Up to 2772 conditions per place. 
[2024-06-20 19:50:04,991 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 156 selfloop transitions, 79 changer transitions 0/238 dead transitions.
[2024-06-20 19:50:04,991 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 238 transitions, 3401 flow
[2024-06-20 19:50:04,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:50:04,992 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:50:04,992 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-20 19:50:04,992 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44375
[2024-06-20 19:50:04,992 INFO  L175             Difference]: Start difference. First operand has 161 places, 207 transitions, 2641 flow. Second operand 8 states and 142 transitions.
[2024-06-20 19:50:04,992 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 238 transitions, 3401 flow
[2024-06-20 19:50:05,083 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 238 transitions, 3209 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-20 19:50:05,086 INFO  L231             Difference]: Finished difference. Result has 163 places, 207 transitions, 2620 flow
[2024-06-20 19:50:05,086 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2449, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2620, PETRI_PLACES=163, PETRI_TRANSITIONS=207}
[2024-06-20 19:50:05,086 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 122 predicate places.
[2024-06-20 19:50:05,086 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 207 transitions, 2620 flow
[2024-06-20 19:50:05,087 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:05,087 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:05,087 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:05,087 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 19:50:05,087 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:05,087 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:05,087 INFO  L85        PathProgramCache]: Analyzing trace with hash -1426608859, now seen corresponding path program 1 times
[2024-06-20 19:50:05,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:05,087 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163438488]
[2024-06-20 19:50:05,088 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:05,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:05,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:15,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:15,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:15,310 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163438488]
[2024-06-20 19:50:15,310 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163438488] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:15,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:15,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:50:15,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688792503]
[2024-06-20 19:50:15,312 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:15,312 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:50:15,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:15,312 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:50:15,312 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:50:15,385 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:50:15,385 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 207 transitions, 2620 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:15,385 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:15,385 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:50:15,386 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:16,414 INFO  L124   PetriNetUnfolderBase]: 2168/3215 cut-off events.
[2024-06-20 19:50:16,414 INFO  L125   PetriNetUnfolderBase]: For 98546/98573 co-relation queries the response was YES.
[2024-06-20 19:50:16,430 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24267 conditions, 3215 events. 2168/3215 cut-off events. For 98546/98573 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14903 event pairs, 556 based on Foata normal form. 22/3233 useless extension candidates. Maximal degree in co-relation 24190. Up to 3158 conditions per place. 
[2024-06-20 19:50:16,442 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 192 selfloop transitions, 20 changer transitions 0/215 dead transitions.
[2024-06-20 19:50:16,442 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 215 transitions, 3064 flow
[2024-06-20 19:50:16,443 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:50:16,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:50:16,444 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions.
[2024-06-20 19:50:16,444 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.415
[2024-06-20 19:50:16,444 INFO  L175             Difference]: Start difference. First operand has 163 places, 207 transitions, 2620 flow. Second operand 5 states and 83 transitions.
[2024-06-20 19:50:16,444 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 215 transitions, 3064 flow
[2024-06-20 19:50:16,546 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 215 transitions, 2881 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-20 19:50:16,549 INFO  L231             Difference]: Finished difference. Result has 161 places, 207 transitions, 2488 flow
[2024-06-20 19:50:16,549 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2437, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2488, PETRI_PLACES=161, PETRI_TRANSITIONS=207}
[2024-06-20 19:50:16,549 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 120 predicate places.
[2024-06-20 19:50:16,550 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 207 transitions, 2488 flow
[2024-06-20 19:50:16,550 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:16,550 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:16,550 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:16,550 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 19:50:16,550 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-20 19:50:16,551 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:16,551 INFO  L85        PathProgramCache]: Analyzing trace with hash 709782774, now seen corresponding path program 1 times
[2024-06-20 19:50:16,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:16,551 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952605119]
[2024-06-20 19:50:16,551 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:16,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:16,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:23,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-20 19:50:23,009 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:23,010 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952605119]
[2024-06-20 19:50:23,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952605119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:23,010 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:23,010 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:50:23,010 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688721693]
[2024-06-20 19:50:23,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:23,010 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:50:23,010 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:23,010 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:50:23,010 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:50:23,205 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:50:23,206 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 207 transitions, 2488 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:23,206 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:23,206 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:50:23,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:24,373 INFO  L124   PetriNetUnfolderBase]: 2219/3321 cut-off events.
[2024-06-20 19:50:24,373 INFO  L125   PetriNetUnfolderBase]: For 112279/112310 co-relation queries the response was YES.
[2024-06-20 19:50:24,390 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25351 conditions, 3321 events. 2219/3321 cut-off events. For 112279/112310 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15791 event pairs, 511 based on Foata normal form. 11/3278 useless extension candidates. Maximal degree in co-relation 25273. Up to 2952 conditions per place. 
[2024-06-20 19:50:24,403 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 179 selfloop transitions, 59 changer transitions 0/275 dead transitions.
[2024-06-20 19:50:24,403 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 275 transitions, 3601 flow
[2024-06-20 19:50:24,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:50:24,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:50:24,405 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-20 19:50:24,405 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45555555555555555
[2024-06-20 19:50:24,406 INFO  L175             Difference]: Start difference. First operand has 161 places, 207 transitions, 2488 flow. Second operand 9 states and 164 transitions.
[2024-06-20 19:50:24,406 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 275 transitions, 3601 flow
[2024-06-20 19:50:24,484 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 275 transitions, 3539 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-06-20 19:50:24,488 INFO  L231             Difference]: Finished difference. Result has 169 places, 234 transitions, 3051 flow
[2024-06-20 19:50:24,488 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2436, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3051, PETRI_PLACES=169, PETRI_TRANSITIONS=234}
[2024-06-20 19:50:24,488 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 128 predicate places.
[2024-06-20 19:50:24,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 234 transitions, 3051 flow
[2024-06-20 19:50:24,489 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:24,489 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:24,489 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:24,489 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 19:50:24,489 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-20 19:50:24,489 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:24,490 INFO  L85        PathProgramCache]: Analyzing trace with hash -1395655934, now seen corresponding path program 2 times
[2024-06-20 19:50:24,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:24,490 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515870014]
[2024-06-20 19:50:24,490 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:24,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:24,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:31,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:31,076 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:31,076 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515870014]
[2024-06-20 19:50:31,076 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515870014] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:31,076 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:31,076 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:50:31,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092333495]
[2024-06-20 19:50:31,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:31,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:50:31,077 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:31,077 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:50:31,077 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:50:31,219 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:50:31,219 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 234 transitions, 3051 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:31,219 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:31,219 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:50:31,219 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:32,598 INFO  L124   PetriNetUnfolderBase]: 2308/3462 cut-off events.
[2024-06-20 19:50:32,598 INFO  L125   PetriNetUnfolderBase]: For 125449/125497 co-relation queries the response was YES.
[2024-06-20 19:50:32,614 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26837 conditions, 3462 events. 2308/3462 cut-off events. For 125449/125497 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16647 event pairs, 376 based on Foata normal form. 37/3443 useless extension candidates. Maximal degree in co-relation 26756. Up to 2915 conditions per place. 
[2024-06-20 19:50:32,625 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 177 selfloop transitions, 68 changer transitions 0/282 dead transitions.
[2024-06-20 19:50:32,626 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 282 transitions, 3867 flow
[2024-06-20 19:50:32,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:50:32,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:50:32,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-20 19:50:32,627 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.496875
[2024-06-20 19:50:32,627 INFO  L175             Difference]: Start difference. First operand has 169 places, 234 transitions, 3051 flow. Second operand 8 states and 159 transitions.
[2024-06-20 19:50:32,627 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 282 transitions, 3867 flow
[2024-06-20 19:50:32,716 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 282 transitions, 3769 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-06-20 19:50:32,720 INFO  L231             Difference]: Finished difference. Result has 175 places, 239 transitions, 3187 flow
[2024-06-20 19:50:32,720 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2953, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3187, PETRI_PLACES=175, PETRI_TRANSITIONS=239}
[2024-06-20 19:50:32,720 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 134 predicate places.
[2024-06-20 19:50:32,720 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 239 transitions, 3187 flow
[2024-06-20 19:50:32,720 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:32,720 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:32,720 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:32,721 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 19:50:32,721 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-20 19:50:32,721 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:32,721 INFO  L85        PathProgramCache]: Analyzing trace with hash 736798740, now seen corresponding path program 1 times
[2024-06-20 19:50:32,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:32,721 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743930782]
[2024-06-20 19:50:32,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:32,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:32,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:38,946 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:38,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:38,946 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743930782]
[2024-06-20 19:50:38,946 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743930782] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:38,946 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:38,946 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:50:38,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541858724]
[2024-06-20 19:50:38,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:38,946 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:50:38,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:38,948 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:50:38,948 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:50:39,096 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:50:39,097 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 239 transitions, 3187 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:39,097 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:39,097 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:50:39,097 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:40,339 INFO  L124   PetriNetUnfolderBase]: 2404/3581 cut-off events.
[2024-06-20 19:50:40,339 INFO  L125   PetriNetUnfolderBase]: For 120235/120239 co-relation queries the response was YES.
[2024-06-20 19:50:40,356 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28027 conditions, 3581 events. 2404/3581 cut-off events. For 120235/120239 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17075 event pairs, 536 based on Foata normal form. 6/3585 useless extension candidates. Maximal degree in co-relation 27944. Up to 3396 conditions per place. 
[2024-06-20 19:50:40,369 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 234 selfloop transitions, 33 changer transitions 0/270 dead transitions.
[2024-06-20 19:50:40,370 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 270 transitions, 3827 flow
[2024-06-20 19:50:40,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:50:40,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:50:40,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-20 19:50:40,372 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4125
[2024-06-20 19:50:40,372 INFO  L175             Difference]: Start difference. First operand has 175 places, 239 transitions, 3187 flow. Second operand 8 states and 132 transitions.
[2024-06-20 19:50:40,372 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 270 transitions, 3827 flow
[2024-06-20 19:50:40,493 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 270 transitions, 3667 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-20 19:50:40,496 INFO  L231             Difference]: Finished difference. Result has 178 places, 239 transitions, 3105 flow
[2024-06-20 19:50:40,496 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3027, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3105, PETRI_PLACES=178, PETRI_TRANSITIONS=239}
[2024-06-20 19:50:40,496 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 137 predicate places.
[2024-06-20 19:50:40,497 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 239 transitions, 3105 flow
[2024-06-20 19:50:40,497 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:40,497 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:40,497 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:40,497 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 19:50:40,497 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-20 19:50:40,497 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:40,497 INFO  L85        PathProgramCache]: Analyzing trace with hash 1233177638, now seen corresponding path program 3 times
[2024-06-20 19:50:40,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:40,497 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213634214]
[2024-06-20 19:50:40,498 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:40,498 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:40,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:46,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:46,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:46,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213634214]
[2024-06-20 19:50:46,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213634214] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:46,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:46,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:50:46,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190176638]
[2024-06-20 19:50:46,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:46,862 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:50:46,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:46,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:50:46,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:50:47,034 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:50:47,034 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 239 transitions, 3105 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:47,034 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:47,034 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:50:47,034 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:48,346 INFO  L124   PetriNetUnfolderBase]: 2364/3552 cut-off events.
[2024-06-20 19:50:48,347 INFO  L125   PetriNetUnfolderBase]: For 134461/134520 co-relation queries the response was YES.
[2024-06-20 19:50:48,366 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27838 conditions, 3552 events. 2364/3552 cut-off events. For 134461/134520 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17289 event pairs, 505 based on Foata normal form. 28/3522 useless extension candidates. Maximal degree in co-relation 27754. Up to 3058 conditions per place. 
[2024-06-20 19:50:48,382 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 173 selfloop transitions, 72 changer transitions 0/282 dead transitions.
[2024-06-20 19:50:48,383 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 282 transitions, 3889 flow
[2024-06-20 19:50:48,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:50:48,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:50:48,384 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-20 19:50:48,384 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.490625
[2024-06-20 19:50:48,384 INFO  L175             Difference]: Start difference. First operand has 178 places, 239 transitions, 3105 flow. Second operand 8 states and 157 transitions.
[2024-06-20 19:50:48,384 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 282 transitions, 3889 flow
[2024-06-20 19:50:48,550 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 282 transitions, 3846 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-20 19:50:48,553 INFO  L231             Difference]: Finished difference. Result has 183 places, 241 transitions, 3262 flow
[2024-06-20 19:50:48,553 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3062, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3262, PETRI_PLACES=183, PETRI_TRANSITIONS=241}
[2024-06-20 19:50:48,553 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 142 predicate places.
[2024-06-20 19:50:48,554 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 241 transitions, 3262 flow
[2024-06-20 19:50:48,554 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:48,554 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:48,554 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:48,554 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 19:50:48,554 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-20 19:50:48,555 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:48,555 INFO  L85        PathProgramCache]: Analyzing trace with hash 739600086, now seen corresponding path program 1 times
[2024-06-20 19:50:48,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:48,555 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008458205]
[2024-06-20 19:50:48,555 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:48,555 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:48,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:55,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:55,060 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:55,060 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008458205]
[2024-06-20 19:50:55,060 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008458205] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:55,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:55,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:50:55,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035831586]
[2024-06-20 19:50:55,061 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:55,061 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:50:55,061 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:55,061 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:50:55,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:50:55,212 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:50:55,213 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 241 transitions, 3262 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:55,213 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:55,213 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:50:55,213 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:56,556 INFO  L124   PetriNetUnfolderBase]: 2495/3721 cut-off events.
[2024-06-20 19:50:56,557 INFO  L125   PetriNetUnfolderBase]: For 130242/130248 co-relation queries the response was YES.
[2024-06-20 19:50:56,574 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29118 conditions, 3721 events. 2495/3721 cut-off events. For 130242/130248 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17912 event pairs, 541 based on Foata normal form. 10/3729 useless extension candidates. Maximal degree in co-relation 29033. Up to 3540 conditions per place. 
[2024-06-20 19:50:56,587 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 246 selfloop transitions, 31 changer transitions 0/280 dead transitions.
[2024-06-20 19:50:56,588 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 280 transitions, 3978 flow
[2024-06-20 19:50:56,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:50:56,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:50:56,590 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-20 19:50:56,590 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4083333333333333
[2024-06-20 19:50:56,590 INFO  L175             Difference]: Start difference. First operand has 183 places, 241 transitions, 3262 flow. Second operand 9 states and 147 transitions.
[2024-06-20 19:50:56,590 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 280 transitions, 3978 flow
[2024-06-20 19:50:56,729 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 280 transitions, 3822 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-06-20 19:50:56,732 INFO  L231             Difference]: Finished difference. Result has 186 places, 244 transitions, 3220 flow
[2024-06-20 19:50:56,733 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3106, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3220, PETRI_PLACES=186, PETRI_TRANSITIONS=244}
[2024-06-20 19:50:56,733 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 145 predicate places.
[2024-06-20 19:50:56,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 244 transitions, 3220 flow
[2024-06-20 19:50:56,733 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:56,733 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:56,733 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:56,733 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 19:50:56,733 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-20 19:50:56,733 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:56,733 INFO  L85        PathProgramCache]: Analyzing trace with hash -664800702, now seen corresponding path program 4 times
[2024-06-20 19:50:56,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:56,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823084147]
[2024-06-20 19:50:56,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:56,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:56,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:03,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:03,368 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:03,368 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823084147]
[2024-06-20 19:51:03,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823084147] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:03,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:03,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:51:03,368 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594992141]
[2024-06-20 19:51:03,368 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:03,368 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:51:03,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:03,369 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:51:03,369 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:51:03,505 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:51:03,505 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 244 transitions, 3220 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-20 19:51:03,505 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:03,505 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:51:03,505 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:04,823 INFO  L124   PetriNetUnfolderBase]: 2463/3709 cut-off events.
[2024-06-20 19:51:04,823 INFO  L125   PetriNetUnfolderBase]: For 152629/152687 co-relation queries the response was YES.
[2024-06-20 19:51:04,842 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29471 conditions, 3709 events. 2463/3709 cut-off events. For 152629/152687 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 18200 event pairs, 509 based on Foata normal form. 27/3670 useless extension candidates. Maximal degree in co-relation 29385. Up to 3124 conditions per place. 
[2024-06-20 19:51:04,856 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 167 selfloop transitions, 81 changer transitions 0/286 dead transitions.
[2024-06-20 19:51:04,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 286 transitions, 4084 flow
[2024-06-20 19:51:04,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:51:04,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:51:04,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-20 19:51:04,858 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4875
[2024-06-20 19:51:04,858 INFO  L175             Difference]: Start difference. First operand has 186 places, 244 transitions, 3220 flow. Second operand 8 states and 156 transitions.
[2024-06-20 19:51:04,858 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 286 transitions, 4084 flow
[2024-06-20 19:51:04,990 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 286 transitions, 4012 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-20 19:51:04,994 INFO  L231             Difference]: Finished difference. Result has 187 places, 246 transitions, 3367 flow
[2024-06-20 19:51:04,994 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3148, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3367, PETRI_PLACES=187, PETRI_TRANSITIONS=246}
[2024-06-20 19:51:04,994 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 146 predicate places.
[2024-06-20 19:51:04,994 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 246 transitions, 3367 flow
[2024-06-20 19:51:04,995 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-20 19:51:04,995 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:04,995 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:04,995 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 19:51:04,995 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-20 19:51:04,995 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:04,995 INFO  L85        PathProgramCache]: Analyzing trace with hash -1939365080, now seen corresponding path program 2 times
[2024-06-20 19:51:04,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:04,995 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290270402]
[2024-06-20 19:51:04,995 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:04,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:05,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:11,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:11,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:11,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290270402]
[2024-06-20 19:51:11,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290270402] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:11,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:11,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:51:11,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31049329]
[2024-06-20 19:51:11,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:11,766 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:51:11,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:11,767 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:51:11,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:51:11,956 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:51:11,957 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 246 transitions, 3367 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-20 19:51:11,957 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:11,957 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:51:11,957 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:13,211 INFO  L124   PetriNetUnfolderBase]: 2567/3838 cut-off events.
[2024-06-20 19:51:13,211 INFO  L125   PetriNetUnfolderBase]: For 144340/144342 co-relation queries the response was YES.
[2024-06-20 19:51:13,234 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30389 conditions, 3838 events. 2567/3838 cut-off events. For 144340/144342 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18658 event pairs, 555 based on Foata normal form. 6/3842 useless extension candidates. Maximal degree in co-relation 30302. Up to 3499 conditions per place. 
[2024-06-20 19:51:13,249 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 218 selfloop transitions, 53 changer transitions 0/274 dead transitions.
[2024-06-20 19:51:13,249 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 274 transitions, 4003 flow
[2024-06-20 19:51:13,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:51:13,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:51:13,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-20 19:51:13,251 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41875
[2024-06-20 19:51:13,251 INFO  L175             Difference]: Start difference. First operand has 187 places, 246 transitions, 3367 flow. Second operand 8 states and 134 transitions.
[2024-06-20 19:51:13,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 274 transitions, 4003 flow
[2024-06-20 19:51:13,399 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 274 transitions, 3814 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-20 19:51:13,403 INFO  L231             Difference]: Finished difference. Result has 189 places, 246 transitions, 3302 flow
[2024-06-20 19:51:13,403 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3178, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3302, PETRI_PLACES=189, PETRI_TRANSITIONS=246}
[2024-06-20 19:51:13,403 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 148 predicate places.
[2024-06-20 19:51:13,403 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 246 transitions, 3302 flow
[2024-06-20 19:51:13,403 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-20 19:51:13,403 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:13,403 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:13,404 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 19:51:13,404 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-20 19:51:13,404 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:13,404 INFO  L85        PathProgramCache]: Analyzing trace with hash -664616004, now seen corresponding path program 1 times
[2024-06-20 19:51:13,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:13,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116682237]
[2024-06-20 19:51:13,404 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:13,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:13,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:20,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:20,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:20,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116682237]
[2024-06-20 19:51:20,536 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116682237] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:20,536 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:20,536 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:51:20,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708164907]
[2024-06-20 19:51:20,536 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:20,536 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:51:20,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:20,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:51:20,537 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:51:20,688 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:51:20,688 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 246 transitions, 3302 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:20,689 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:20,689 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:51:20,689 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:21,994 INFO  L124   PetriNetUnfolderBase]: 2584/3863 cut-off events.
[2024-06-20 19:51:21,994 INFO  L125   PetriNetUnfolderBase]: For 149874/149878 co-relation queries the response was YES.
[2024-06-20 19:51:22,014 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30507 conditions, 3863 events. 2584/3863 cut-off events. For 149874/149878 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18882 event pairs, 576 based on Foata normal form. 8/3869 useless extension candidates. Maximal degree in co-relation 30419. Up to 3775 conditions per place. 
[2024-06-20 19:51:22,028 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 256 selfloop transitions, 21 changer transitions 0/280 dead transitions.
[2024-06-20 19:51:22,028 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 280 transitions, 3992 flow
[2024-06-20 19:51:22,030 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:51:22,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:51:22,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions.
[2024-06-20 19:51:22,032 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-20 19:51:22,033 INFO  L175             Difference]: Start difference. First operand has 189 places, 246 transitions, 3302 flow. Second operand 9 states and 140 transitions.
[2024-06-20 19:51:22,033 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 280 transitions, 3992 flow
[2024-06-20 19:51:22,174 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 280 transitions, 3820 flow, removed 5 selfloop flow, removed 8 redundant places.
[2024-06-20 19:51:22,177 INFO  L231             Difference]: Finished difference. Result has 190 places, 248 transitions, 3217 flow
[2024-06-20 19:51:22,178 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3130, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3217, PETRI_PLACES=190, PETRI_TRANSITIONS=248}
[2024-06-20 19:51:22,178 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 149 predicate places.
[2024-06-20 19:51:22,178 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 248 transitions, 3217 flow
[2024-06-20 19:51:22,178 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:22,178 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:22,178 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:22,178 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 19:51:22,178 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-20 19:51:22,179 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:22,179 INFO  L85        PathProgramCache]: Analyzing trace with hash -720230126, now seen corresponding path program 2 times
[2024-06-20 19:51:22,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:22,179 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830173639]
[2024-06-20 19:51:22,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:22,179 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:22,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:30,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-20 19:51:30,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:30,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830173639]
[2024-06-20 19:51:30,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830173639] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:30,062 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:30,062 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:51:30,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409260721]
[2024-06-20 19:51:30,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:30,062 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:51:30,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:30,062 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:51:30,063 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:51:30,228 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:51:30,229 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 248 transitions, 3217 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:30,229 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:30,229 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:51:30,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:31,547 INFO  L124   PetriNetUnfolderBase]: 2601/3892 cut-off events.
[2024-06-20 19:51:31,547 INFO  L125   PetriNetUnfolderBase]: For 144224/144257 co-relation queries the response was YES.
[2024-06-20 19:51:31,568 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30404 conditions, 3892 events. 2601/3892 cut-off events. For 144224/144257 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 19053 event pairs, 588 based on Foata normal form. 26/3912 useless extension candidates. Maximal degree in co-relation 30315. Up to 3757 conditions per place. 
[2024-06-20 19:51:31,583 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 246 selfloop transitions, 33 changer transitions 0/282 dead transitions.
[2024-06-20 19:51:31,583 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 282 transitions, 3921 flow
[2024-06-20 19:51:31,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:51:31,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:51:31,585 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions.
[2024-06-20 19:51:31,585 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39166666666666666
[2024-06-20 19:51:31,585 INFO  L175             Difference]: Start difference. First operand has 190 places, 248 transitions, 3217 flow. Second operand 9 states and 141 transitions.
[2024-06-20 19:51:31,585 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 282 transitions, 3921 flow
[2024-06-20 19:51:31,721 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 282 transitions, 3852 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-20 19:51:31,724 INFO  L231             Difference]: Finished difference. Result has 193 places, 252 transitions, 3283 flow
[2024-06-20 19:51:31,725 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3148, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3283, PETRI_PLACES=193, PETRI_TRANSITIONS=252}
[2024-06-20 19:51:31,725 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 152 predicate places.
[2024-06-20 19:51:31,725 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 252 transitions, 3283 flow
[2024-06-20 19:51:31,725 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:31,725 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:31,725 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:31,726 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 19:51:31,726 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-20 19:51:31,726 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:31,726 INFO  L85        PathProgramCache]: Analyzing trace with hash -720414824, now seen corresponding path program 5 times
[2024-06-20 19:51:31,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:31,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237534334]
[2024-06-20 19:51:31,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:31,727 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:31,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:38,802 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:38,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:38,802 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237534334]
[2024-06-20 19:51:38,802 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237534334] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:38,802 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:38,802 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:51:38,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370097136]
[2024-06-20 19:51:38,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:38,803 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:51:38,803 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:38,803 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:51:38,803 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:51:38,954 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:51:38,955 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 252 transitions, 3283 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-20 19:51:38,955 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:38,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:51:38,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:40,227 INFO  L124   PetriNetUnfolderBase]: 2539/3835 cut-off events.
[2024-06-20 19:51:40,227 INFO  L125   PetriNetUnfolderBase]: For 166825/166909 co-relation queries the response was YES.
[2024-06-20 19:51:40,249 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30557 conditions, 3835 events. 2539/3835 cut-off events. For 166825/166909 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 19046 event pairs, 511 based on Foata normal form. 31/3788 useless extension candidates. Maximal degree in co-relation 30466. Up to 3065 conditions per place. 
[2024-06-20 19:51:40,265 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 165 selfloop transitions, 88 changer transitions 0/294 dead transitions.
[2024-06-20 19:51:40,265 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 294 transitions, 4263 flow
[2024-06-20 19:51:40,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:51:40,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:51:40,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-20 19:51:40,266 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.478125
[2024-06-20 19:51:40,266 INFO  L175             Difference]: Start difference. First operand has 193 places, 252 transitions, 3283 flow. Second operand 8 states and 153 transitions.
[2024-06-20 19:51:40,266 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 294 transitions, 4263 flow
[2024-06-20 19:51:40,413 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 294 transitions, 4170 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-20 19:51:40,417 INFO  L231             Difference]: Finished difference. Result has 195 places, 254 transitions, 3427 flow
[2024-06-20 19:51:40,417 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3190, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3427, PETRI_PLACES=195, PETRI_TRANSITIONS=254}
[2024-06-20 19:51:40,417 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 154 predicate places.
[2024-06-20 19:51:40,418 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 254 transitions, 3427 flow
[2024-06-20 19:51:40,418 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-20 19:51:40,418 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:40,418 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:40,418 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 19:51:40,418 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-20 19:51:40,418 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:40,419 INFO  L85        PathProgramCache]: Analyzing trace with hash 720398110, now seen corresponding path program 3 times
[2024-06-20 19:51:40,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:40,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024770492]
[2024-06-20 19:51:40,419 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:40,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:40,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:47,655 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:47,655 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:47,655 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024770492]
[2024-06-20 19:51:47,655 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024770492] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:47,655 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:47,655 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:51:47,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494893716]
[2024-06-20 19:51:47,655 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:47,656 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:51:47,656 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:47,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:51:47,656 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:51:47,743 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:51:47,744 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 254 transitions, 3427 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:47,744 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:47,744 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:51:47,744 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:49,127 INFO  L124   PetriNetUnfolderBase]: 2638/3959 cut-off events.
[2024-06-20 19:51:49,128 INFO  L125   PetriNetUnfolderBase]: For 156990/157014 co-relation queries the response was YES.
[2024-06-20 19:51:49,150 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31498 conditions, 3959 events. 2638/3959 cut-off events. For 156990/157014 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 19437 event pairs, 574 based on Foata normal form. 12/3957 useless extension candidates. Maximal degree in co-relation 31406. Up to 3343 conditions per place. 
[2024-06-20 19:51:49,164 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 191 selfloop transitions, 91 changer transitions 0/285 dead transitions.
[2024-06-20 19:51:49,164 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 285 transitions, 4097 flow
[2024-06-20 19:51:49,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:51:49,166 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:51:49,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-20 19:51:49,167 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41944444444444445
[2024-06-20 19:51:49,167 INFO  L175             Difference]: Start difference. First operand has 195 places, 254 transitions, 3427 flow. Second operand 9 states and 151 transitions.
[2024-06-20 19:51:49,167 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 285 transitions, 4097 flow
[2024-06-20 19:51:49,336 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 285 transitions, 3882 flow, removed 22 selfloop flow, removed 6 redundant places.
[2024-06-20 19:51:49,340 INFO  L231             Difference]: Finished difference. Result has 198 places, 254 transitions, 3402 flow
[2024-06-20 19:51:49,340 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3212, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3402, PETRI_PLACES=198, PETRI_TRANSITIONS=254}
[2024-06-20 19:51:49,341 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 157 predicate places.
[2024-06-20 19:51:49,341 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 254 transitions, 3402 flow
[2024-06-20 19:51:49,341 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:49,341 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:49,341 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:49,341 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 19:51:49,341 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-20 19:51:49,342 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:49,342 INFO  L85        PathProgramCache]: Analyzing trace with hash 728975748, now seen corresponding path program 3 times
[2024-06-20 19:51:49,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:49,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392598803]
[2024-06-20 19:51:49,342 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:49,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:49,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:56,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:56,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:56,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392598803]
[2024-06-20 19:51:56,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392598803] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:56,406 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:56,406 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:51:56,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552483924]
[2024-06-20 19:51:56,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:56,407 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:51:56,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:56,407 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:51:56,407 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:51:56,579 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:51:56,580 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 254 transitions, 3402 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:56,580 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:56,580 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:51:56,580 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:57,924 INFO  L124   PetriNetUnfolderBase]: 2766/4167 cut-off events.
[2024-06-20 19:51:57,924 INFO  L125   PetriNetUnfolderBase]: For 175717/175741 co-relation queries the response was YES.
[2024-06-20 19:51:57,949 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33119 conditions, 4167 events. 2766/4167 cut-off events. For 175717/175741 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20847 event pairs, 538 based on Foata normal form. 12/4165 useless extension candidates. Maximal degree in co-relation 33026. Up to 3293 conditions per place. 
[2024-06-20 19:51:57,967 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 192 selfloop transitions, 101 changer transitions 0/296 dead transitions.
[2024-06-20 19:51:57,968 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 296 transitions, 4358 flow
[2024-06-20 19:51:57,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:51:57,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:51:57,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-20 19:51:57,970 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 19:51:57,970 INFO  L175             Difference]: Start difference. First operand has 198 places, 254 transitions, 3402 flow. Second operand 9 states and 156 transitions.
[2024-06-20 19:51:57,970 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 296 transitions, 4358 flow
[2024-06-20 19:51:58,154 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 296 transitions, 4127 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-20 19:51:58,158 INFO  L231             Difference]: Finished difference. Result has 198 places, 258 transitions, 3468 flow
[2024-06-20 19:51:58,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3171, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3468, PETRI_PLACES=198, PETRI_TRANSITIONS=258}
[2024-06-20 19:51:58,159 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 157 predicate places.
[2024-06-20 19:51:58,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 258 transitions, 3468 flow
[2024-06-20 19:51:58,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:58,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:58,159 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:58,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 19:51:58,159 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-20 19:51:58,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:58,160 INFO  L85        PathProgramCache]: Analyzing trace with hash 720404868, now seen corresponding path program 4 times
[2024-06-20 19:51:58,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:58,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357032189]
[2024-06-20 19:51:58,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:58,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:58,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:05,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:05,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:05,942 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357032189]
[2024-06-20 19:52:05,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357032189] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:05,943 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:05,943 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:52:05,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960195501]
[2024-06-20 19:52:05,943 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:05,943 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:52:05,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:05,943 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:52:05,943 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:52:06,070 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:52:06,071 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 258 transitions, 3468 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:06,071 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:06,071 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:52:06,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:07,420 INFO  L124   PetriNetUnfolderBase]: 2783/4190 cut-off events.
[2024-06-20 19:52:07,421 INFO  L125   PetriNetUnfolderBase]: For 185390/185423 co-relation queries the response was YES.
[2024-06-20 19:52:07,446 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33713 conditions, 4190 events. 2783/4190 cut-off events. For 185390/185423 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 21112 event pairs, 641 based on Foata normal form. 26/4210 useless extension candidates. Maximal degree in co-relation 33619. Up to 4055 conditions per place. 
[2024-06-20 19:52:07,530 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 253 selfloop transitions, 34 changer transitions 0/290 dead transitions.
[2024-06-20 19:52:07,531 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 290 transitions, 4184 flow
[2024-06-20 19:52:07,533 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:52:07,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:52:07,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions.
[2024-06-20 19:52:07,533 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-20 19:52:07,533 INFO  L175             Difference]: Start difference. First operand has 198 places, 258 transitions, 3468 flow. Second operand 9 states and 140 transitions.
[2024-06-20 19:52:07,533 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 290 transitions, 4184 flow
[2024-06-20 19:52:07,698 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 290 transitions, 3999 flow, removed 33 selfloop flow, removed 5 redundant places.
[2024-06-20 19:52:07,702 INFO  L231             Difference]: Finished difference. Result has 202 places, 260 transitions, 3408 flow
[2024-06-20 19:52:07,702 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3297, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3408, PETRI_PLACES=202, PETRI_TRANSITIONS=260}
[2024-06-20 19:52:07,702 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 161 predicate places.
[2024-06-20 19:52:07,702 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 260 transitions, 3408 flow
[2024-06-20 19:52:07,703 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:07,703 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:07,703 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:07,703 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 19:52:07,703 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-20 19:52:07,703 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:07,704 INFO  L85        PathProgramCache]: Analyzing trace with hash 728679078, now seen corresponding path program 5 times
[2024-06-20 19:52:07,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:07,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511694937]
[2024-06-20 19:52:07,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:07,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:07,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:14,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:14,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:14,434 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511694937]
[2024-06-20 19:52:14,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511694937] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:14,435 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:14,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:52:14,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081944329]
[2024-06-20 19:52:14,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:14,435 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:52:14,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:14,435 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:52:14,436 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:52:14,608 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:52:14,609 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 260 transitions, 3408 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:14,609 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:14,609 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:52:14,609 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:15,978 INFO  L124   PetriNetUnfolderBase]: 2775/4182 cut-off events.
[2024-06-20 19:52:15,978 INFO  L125   PetriNetUnfolderBase]: For 188311/188335 co-relation queries the response was YES.
[2024-06-20 19:52:16,001 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33415 conditions, 4182 events. 2775/4182 cut-off events. For 188311/188335 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 20964 event pairs, 619 based on Foata normal form. 12/4180 useless extension candidates. Maximal degree in co-relation 33319. Up to 3607 conditions per place. 
[2024-06-20 19:52:16,014 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 195 selfloop transitions, 94 changer transitions 0/292 dead transitions.
[2024-06-20 19:52:16,014 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 292 transitions, 4108 flow
[2024-06-20 19:52:16,016 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:52:16,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:52:16,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-20 19:52:16,016 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-20 19:52:16,016 INFO  L175             Difference]: Start difference. First operand has 202 places, 260 transitions, 3408 flow. Second operand 9 states and 149 transitions.
[2024-06-20 19:52:16,017 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 292 transitions, 4108 flow
[2024-06-20 19:52:16,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 292 transitions, 4019 flow, removed 12 selfloop flow, removed 7 redundant places.
[2024-06-20 19:52:16,195 INFO  L231             Difference]: Finished difference. Result has 204 places, 261 transitions, 3536 flow
[2024-06-20 19:52:16,195 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3319, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3536, PETRI_PLACES=204, PETRI_TRANSITIONS=261}
[2024-06-20 19:52:16,195 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 163 predicate places.
[2024-06-20 19:52:16,195 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 261 transitions, 3536 flow
[2024-06-20 19:52:16,195 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:16,195 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:16,195 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:16,195 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 19:52:16,196 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-20 19:52:16,196 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:16,196 INFO  L85        PathProgramCache]: Analyzing trace with hash -72806492, now seen corresponding path program 1 times
[2024-06-20 19:52:16,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:16,196 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016487589]
[2024-06-20 19:52:16,196 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:16,196 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:16,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:22,620 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:22,620 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:22,621 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016487589]
[2024-06-20 19:52:22,621 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016487589] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:22,621 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:22,621 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:52:22,621 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867320326]
[2024-06-20 19:52:22,621 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:22,621 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:52:22,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:22,622 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:52:22,622 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:52:22,810 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:52:22,811 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 261 transitions, 3536 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:22,811 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:22,811 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:52:22,811 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:24,191 INFO  L124   PetriNetUnfolderBase]: 2792/4203 cut-off events.
[2024-06-20 19:52:24,191 INFO  L125   PetriNetUnfolderBase]: For 193883/193887 co-relation queries the response was YES.
[2024-06-20 19:52:24,216 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34098 conditions, 4203 events. 2792/4203 cut-off events. For 193883/193887 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 21076 event pairs, 456 based on Foata normal form. 8/4209 useless extension candidates. Maximal degree in co-relation 34001. Up to 3960 conditions per place. 
[2024-06-20 19:52:24,232 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 273 selfloop transitions, 29 changer transitions 0/305 dead transitions.
[2024-06-20 19:52:24,232 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 305 transitions, 4376 flow
[2024-06-20 19:52:24,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:52:24,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:52:24,234 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions.
[2024-06-20 19:52:24,234 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:52:24,234 INFO  L175             Difference]: Start difference. First operand has 204 places, 261 transitions, 3536 flow. Second operand 9 states and 144 transitions.
[2024-06-20 19:52:24,234 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 305 transitions, 4376 flow
[2024-06-20 19:52:24,403 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 305 transitions, 4163 flow, removed 14 selfloop flow, removed 7 redundant places.
[2024-06-20 19:52:24,407 INFO  L231             Difference]: Finished difference. Result has 208 places, 269 transitions, 3536 flow
[2024-06-20 19:52:24,407 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3323, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3536, PETRI_PLACES=208, PETRI_TRANSITIONS=269}
[2024-06-20 19:52:24,407 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 167 predicate places.
[2024-06-20 19:52:24,407 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 269 transitions, 3536 flow
[2024-06-20 19:52:24,408 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:24,408 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:24,408 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:24,408 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 19:52:24,408 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-20 19:52:24,408 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:24,408 INFO  L85        PathProgramCache]: Analyzing trace with hash -426193508, now seen corresponding path program 2 times
[2024-06-20 19:52:24,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:24,408 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477003508]
[2024-06-20 19:52:24,408 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:24,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:24,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:31,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:31,086 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:31,086 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477003508]
[2024-06-20 19:52:31,086 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477003508] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:31,086 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:31,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:52:31,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672754111]
[2024-06-20 19:52:31,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:31,087 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:52:31,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:31,087 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:52:31,087 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:52:31,291 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:52:31,292 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 269 transitions, 3536 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:31,292 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:31,292 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:52:31,292 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:32,814 INFO  L124   PetriNetUnfolderBase]: 2809/4230 cut-off events.
[2024-06-20 19:52:32,814 INFO  L125   PetriNetUnfolderBase]: For 202985/202989 co-relation queries the response was YES.
[2024-06-20 19:52:32,842 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34392 conditions, 4230 events. 2809/4230 cut-off events. For 202985/202989 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 21316 event pairs, 577 based on Foata normal form. 8/4236 useless extension candidates. Maximal degree in co-relation 34292. Up to 4022 conditions per place. 
[2024-06-20 19:52:32,860 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 269 selfloop transitions, 35 changer transitions 0/307 dead transitions.
[2024-06-20 19:52:32,860 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 307 transitions, 4304 flow
[2024-06-20 19:52:32,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:52:32,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:52:32,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions.
[2024-06-20 19:52:32,862 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40555555555555556
[2024-06-20 19:52:32,862 INFO  L175             Difference]: Start difference. First operand has 208 places, 269 transitions, 3536 flow. Second operand 9 states and 146 transitions.
[2024-06-20 19:52:32,862 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 307 transitions, 4304 flow
[2024-06-20 19:52:33,115 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 307 transitions, 4197 flow, removed 41 selfloop flow, removed 4 redundant places.
[2024-06-20 19:52:33,118 INFO  L231             Difference]: Finished difference. Result has 213 places, 271 transitions, 3551 flow
[2024-06-20 19:52:33,119 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3429, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3551, PETRI_PLACES=213, PETRI_TRANSITIONS=271}
[2024-06-20 19:52:33,119 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 172 predicate places.
[2024-06-20 19:52:33,119 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 271 transitions, 3551 flow
[2024-06-20 19:52:33,119 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:33,119 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:33,119 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:33,119 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 19:52:33,119 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-20 19:52:33,120 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:33,120 INFO  L85        PathProgramCache]: Analyzing trace with hash 643321778, now seen corresponding path program 3 times
[2024-06-20 19:52:33,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:33,120 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105764046]
[2024-06-20 19:52:33,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:33,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:33,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:39,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:39,890 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:39,890 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105764046]
[2024-06-20 19:52:39,890 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105764046] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:39,890 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:39,891 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:52:39,891 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393977366]
[2024-06-20 19:52:39,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:39,891 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:52:39,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:39,891 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:52:39,891 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:52:40,030 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:52:40,030 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 271 transitions, 3551 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:40,030 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:40,030 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:52:40,030 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:41,684 INFO  L124   PetriNetUnfolderBase]: 2826/4257 cut-off events.
[2024-06-20 19:52:41,684 INFO  L125   PetriNetUnfolderBase]: For 212932/212936 co-relation queries the response was YES.
[2024-06-20 19:52:41,708 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34807 conditions, 4257 events. 2826/4257 cut-off events. For 212932/212936 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 21474 event pairs, 575 based on Foata normal form. 8/4263 useless extension candidates. Maximal degree in co-relation 34705. Up to 4003 conditions per place. 
[2024-06-20 19:52:41,723 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 271 selfloop transitions, 37 changer transitions 0/311 dead transitions.
[2024-06-20 19:52:41,723 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 311 transitions, 4365 flow
[2024-06-20 19:52:41,725 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:52:41,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:52:41,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-20 19:52:41,726 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4083333333333333
[2024-06-20 19:52:41,726 INFO  L175             Difference]: Start difference. First operand has 213 places, 271 transitions, 3551 flow. Second operand 9 states and 147 transitions.
[2024-06-20 19:52:41,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 311 transitions, 4365 flow
[2024-06-20 19:52:41,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 311 transitions, 4276 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-20 19:52:41,933 INFO  L231             Difference]: Finished difference. Result has 217 places, 275 transitions, 3639 flow
[2024-06-20 19:52:41,933 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3462, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3639, PETRI_PLACES=217, PETRI_TRANSITIONS=275}
[2024-06-20 19:52:41,933 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 176 predicate places.
[2024-06-20 19:52:41,933 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 275 transitions, 3639 flow
[2024-06-20 19:52:41,934 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:41,934 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:41,934 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:41,934 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 19:52:41,934 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-20 19:52:41,934 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:41,934 INFO  L85        PathProgramCache]: Analyzing trace with hash 730167410, now seen corresponding path program 1 times
[2024-06-20 19:52:41,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:41,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312439377]
[2024-06-20 19:52:41,935 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:41,935 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:41,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:48,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:48,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:48,670 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312439377]
[2024-06-20 19:52:48,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312439377] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:48,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:48,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:52:48,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877863148]
[2024-06-20 19:52:48,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:48,670 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:52:48,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:48,671 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:52:48,671 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:52:48,826 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:52:48,826 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 275 transitions, 3639 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-20 19:52:48,826 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:48,826 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:52:48,826 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:50,404 INFO  L124   PetriNetUnfolderBase]: 2901/4384 cut-off events.
[2024-06-20 19:52:50,404 INFO  L125   PetriNetUnfolderBase]: For 239040/239042 co-relation queries the response was YES.
[2024-06-20 19:52:50,431 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35780 conditions, 4384 events. 2901/4384 cut-off events. For 239040/239042 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 22350 event pairs, 592 based on Foata normal form. 22/4404 useless extension candidates. Maximal degree in co-relation 35676. Up to 3892 conditions per place. 
[2024-06-20 19:52:50,448 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 254 selfloop transitions, 56 changer transitions 0/313 dead transitions.
[2024-06-20 19:52:50,448 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 313 transitions, 4425 flow
[2024-06-20 19:52:50,450 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:52:50,450 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:52:50,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions.
[2024-06-20 19:52:50,450 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4222222222222222
[2024-06-20 19:52:50,450 INFO  L175             Difference]: Start difference. First operand has 217 places, 275 transitions, 3639 flow. Second operand 9 states and 152 transitions.
[2024-06-20 19:52:50,450 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 313 transitions, 4425 flow
[2024-06-20 19:52:50,731 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 313 transitions, 4314 flow, removed 35 selfloop flow, removed 5 redundant places.
[2024-06-20 19:52:50,735 INFO  L231             Difference]: Finished difference. Result has 221 places, 276 transitions, 3676 flow
[2024-06-20 19:52:50,735 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3528, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3676, PETRI_PLACES=221, PETRI_TRANSITIONS=276}
[2024-06-20 19:52:50,736 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 180 predicate places.
[2024-06-20 19:52:50,736 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 276 transitions, 3676 flow
[2024-06-20 19:52:50,736 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-20 19:52:50,736 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:50,736 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:50,736 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 19:52:50,737 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-20 19:52:50,737 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:50,737 INFO  L85        PathProgramCache]: Analyzing trace with hash 871526626, now seen corresponding path program 4 times
[2024-06-20 19:52:50,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:50,737 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270733608]
[2024-06-20 19:52:50,737 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:50,737 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:50,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:57,539 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:57,540 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:57,540 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270733608]
[2024-06-20 19:52:57,540 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270733608] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:57,540 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:57,540 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:52:57,540 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653456505]
[2024-06-20 19:52:57,540 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:57,540 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:52:57,540 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:57,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:52:57,541 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:52:57,720 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:52:57,720 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 276 transitions, 3676 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:57,720 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:57,720 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:52:57,720 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:59,262 INFO  L124   PetriNetUnfolderBase]: 2918/4411 cut-off events.
[2024-06-20 19:52:59,262 INFO  L125   PetriNetUnfolderBase]: For 233351/233353 co-relation queries the response was YES.
[2024-06-20 19:52:59,293 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36300 conditions, 4411 events. 2918/4411 cut-off events. For 233351/233353 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 22559 event pairs, 598 based on Foata normal form. 6/4415 useless extension candidates. Maximal degree in co-relation 36194. Up to 4124 conditions per place. 
[2024-06-20 19:52:59,311 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 261 selfloop transitions, 47 changer transitions 0/311 dead transitions.
[2024-06-20 19:52:59,311 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 311 transitions, 4448 flow
[2024-06-20 19:52:59,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:52:59,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:52:59,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-20 19:52:59,313 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4083333333333333
[2024-06-20 19:52:59,314 INFO  L175             Difference]: Start difference. First operand has 221 places, 276 transitions, 3676 flow. Second operand 9 states and 147 transitions.
[2024-06-20 19:52:59,314 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 311 transitions, 4448 flow
[2024-06-20 19:52:59,668 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 311 transitions, 4336 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-20 19:52:59,671 INFO  L231             Difference]: Finished difference. Result has 223 places, 278 transitions, 3717 flow
[2024-06-20 19:52:59,672 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3564, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3717, PETRI_PLACES=223, PETRI_TRANSITIONS=278}
[2024-06-20 19:52:59,672 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 182 predicate places.
[2024-06-20 19:52:59,672 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 278 transitions, 3717 flow
[2024-06-20 19:52:59,672 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:52:59,672 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:59,672 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:59,672 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 19:52:59,672 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-20 19:52:59,673 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:59,673 INFO  L85        PathProgramCache]: Analyzing trace with hash 871741828, now seen corresponding path program 2 times
[2024-06-20 19:52:59,673 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:59,673 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814863647]
[2024-06-20 19:52:59,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:59,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:59,703 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:06,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:06,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:06,471 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814863647]
[2024-06-20 19:53:06,471 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814863647] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:06,471 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:06,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:53:06,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492946847]
[2024-06-20 19:53:06,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:06,472 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:53:06,472 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:06,472 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:53:06,472 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:53:06,657 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:06,657 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 278 transitions, 3717 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-20 19:53:06,657 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:06,657 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:06,658 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:08,290 INFO  L124   PetriNetUnfolderBase]: 3112/4729 cut-off events.
[2024-06-20 19:53:08,290 INFO  L125   PetriNetUnfolderBase]: For 282380/282382 co-relation queries the response was YES.
[2024-06-20 19:53:08,320 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39433 conditions, 4729 events. 3112/4729 cut-off events. For 282380/282382 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 24762 event pairs, 632 based on Foata normal form. 18/4745 useless extension candidates. Maximal degree in co-relation 39326. Up to 3862 conditions per place. 
[2024-06-20 19:53:08,337 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 263 selfloop transitions, 57 changer transitions 0/323 dead transitions.
[2024-06-20 19:53:08,337 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 323 transitions, 4781 flow
[2024-06-20 19:53:08,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:53:08,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:53:08,339 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-20 19:53:08,339 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 19:53:08,339 INFO  L175             Difference]: Start difference. First operand has 223 places, 278 transitions, 3717 flow. Second operand 9 states and 156 transitions.
[2024-06-20 19:53:08,339 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 323 transitions, 4781 flow
[2024-06-20 19:53:08,627 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 323 transitions, 4632 flow, removed 22 selfloop flow, removed 7 redundant places.
[2024-06-20 19:53:08,630 INFO  L231             Difference]: Finished difference. Result has 225 places, 280 transitions, 3746 flow
[2024-06-20 19:53:08,631 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3568, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3746, PETRI_PLACES=225, PETRI_TRANSITIONS=280}
[2024-06-20 19:53:08,631 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 184 predicate places.
[2024-06-20 19:53:08,631 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 280 transitions, 3746 flow
[2024-06-20 19:53:08,631 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-20 19:53:08,631 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:08,631 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:08,631 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 19:53:08,631 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-20 19:53:08,632 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:08,632 INFO  L85        PathProgramCache]: Analyzing trace with hash 14790574, now seen corresponding path program 3 times
[2024-06-20 19:53:08,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:08,632 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646873352]
[2024-06-20 19:53:08,632 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:08,632 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:08,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:15,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:15,662 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:15,662 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646873352]
[2024-06-20 19:53:15,662 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646873352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:15,662 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:15,662 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:53:15,662 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899058511]
[2024-06-20 19:53:15,662 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:15,662 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:53:15,663 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:15,663 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:53:15,663 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:53:15,839 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:15,839 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 280 transitions, 3746 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-20 19:53:15,839 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:15,839 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:15,839 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:17,547 INFO  L124   PetriNetUnfolderBase]: 3137/4776 cut-off events.
[2024-06-20 19:53:17,548 INFO  L125   PetriNetUnfolderBase]: For 290114/290116 co-relation queries the response was YES.
[2024-06-20 19:53:17,578 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39531 conditions, 4776 events. 3137/4776 cut-off events. For 290114/290116 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 25161 event pairs, 664 based on Foata normal form. 22/4796 useless extension candidates. Maximal degree in co-relation 39423. Up to 4281 conditions per place. 
[2024-06-20 19:53:17,595 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 259 selfloop transitions, 56 changer transitions 0/318 dead transitions.
[2024-06-20 19:53:17,596 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 318 transitions, 4550 flow
[2024-06-20 19:53:17,597 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:53:17,597 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:53:17,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-20 19:53:17,598 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-20 19:53:17,598 INFO  L175             Difference]: Start difference. First operand has 225 places, 280 transitions, 3746 flow. Second operand 9 states and 153 transitions.
[2024-06-20 19:53:17,598 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 318 transitions, 4550 flow
[2024-06-20 19:53:17,912 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 318 transitions, 4462 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-20 19:53:17,916 INFO  L231             Difference]: Finished difference. Result has 229 places, 281 transitions, 3812 flow
[2024-06-20 19:53:17,917 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3660, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3812, PETRI_PLACES=229, PETRI_TRANSITIONS=281}
[2024-06-20 19:53:17,917 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 188 predicate places.
[2024-06-20 19:53:17,917 INFO  L495      AbstractCegarLoop]: Abstraction has has 229 places, 281 transitions, 3812 flow
[2024-06-20 19:53:17,917 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-20 19:53:17,917 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:17,917 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:17,917 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 19:53:17,917 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-20 19:53:17,918 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:17,918 INFO  L85        PathProgramCache]: Analyzing trace with hash 731676778, now seen corresponding path program 5 times
[2024-06-20 19:53:17,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:17,918 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780040589]
[2024-06-20 19:53:17,918 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:17,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:17,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:24,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-20 19:53:24,778 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:24,778 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780040589]
[2024-06-20 19:53:24,778 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780040589] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:24,778 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:24,778 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:53:24,778 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492037977]
[2024-06-20 19:53:24,778 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:24,778 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:53:24,778 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:24,779 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:53:24,779 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:53:24,901 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:24,902 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 281 transitions, 3812 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:24,902 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:24,902 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:24,902 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:26,641 INFO  L124   PetriNetUnfolderBase]: 3129/4764 cut-off events.
[2024-06-20 19:53:26,641 INFO  L125   PetriNetUnfolderBase]: For 279150/279152 co-relation queries the response was YES.
[2024-06-20 19:53:26,677 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39563 conditions, 4764 events. 3129/4764 cut-off events. For 279150/279152 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 25132 event pairs, 677 based on Foata normal form. 6/4768 useless extension candidates. Maximal degree in co-relation 39453. Up to 4477 conditions per place. 
[2024-06-20 19:53:26,697 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 268 selfloop transitions, 45 changer transitions 0/316 dead transitions.
[2024-06-20 19:53:26,697 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 316 transitions, 4600 flow
[2024-06-20 19:53:26,699 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:53:26,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:53:26,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-20 19:53:26,699 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4111111111111111
[2024-06-20 19:53:26,699 INFO  L175             Difference]: Start difference. First operand has 229 places, 281 transitions, 3812 flow. Second operand 9 states and 148 transitions.
[2024-06-20 19:53:26,699 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 316 transitions, 4600 flow
[2024-06-20 19:53:27,137 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 316 transitions, 4480 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-20 19:53:27,143 INFO  L231             Difference]: Finished difference. Result has 231 places, 283 transitions, 3847 flow
[2024-06-20 19:53:27,143 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3692, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3847, PETRI_PLACES=231, PETRI_TRANSITIONS=283}
[2024-06-20 19:53:27,143 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 190 predicate places.
[2024-06-20 19:53:27,144 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 283 transitions, 3847 flow
[2024-06-20 19:53:27,144 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:27,144 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:27,144 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:27,144 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 19:53:27,144 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-20 19:53:27,145 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:27,145 INFO  L85        PathProgramCache]: Analyzing trace with hash -173469776, now seen corresponding path program 6 times
[2024-06-20 19:53:27,145 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:27,145 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764200832]
[2024-06-20 19:53:27,145 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:27,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:27,181 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:34,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:34,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:34,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764200832]
[2024-06-20 19:53:34,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764200832] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:34,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:34,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:53:34,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033523804]
[2024-06-20 19:53:34,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:34,291 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:53:34,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:34,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:53:34,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:53:34,488 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:34,488 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 283 transitions, 3847 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-20 19:53:34,488 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:34,488 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:34,488 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:36,120 INFO  L124   PetriNetUnfolderBase]: 3146/4791 cut-off events.
[2024-06-20 19:53:36,121 INFO  L125   PetriNetUnfolderBase]: For 290407/290409 co-relation queries the response was YES.
[2024-06-20 19:53:36,154 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39968 conditions, 4791 events. 3146/4791 cut-off events. For 290407/290409 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 25315 event pairs, 670 based on Foata normal form. 6/4795 useless extension candidates. Maximal degree in co-relation 39857. Up to 4237 conditions per place. 
[2024-06-20 19:53:36,172 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 261 selfloop transitions, 60 changer transitions 0/324 dead transitions.
[2024-06-20 19:53:36,172 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 324 transitions, 4729 flow
[2024-06-20 19:53:36,174 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:53:36,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:53:36,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-20 19:53:36,174 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42777777777777776
[2024-06-20 19:53:36,174 INFO  L175             Difference]: Start difference. First operand has 231 places, 283 transitions, 3847 flow. Second operand 9 states and 154 transitions.
[2024-06-20 19:53:36,174 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 324 transitions, 4729 flow
[2024-06-20 19:53:36,523 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 324 transitions, 4590 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-20 19:53:36,527 INFO  L231             Difference]: Finished difference. Result has 234 places, 287 transitions, 3953 flow
[2024-06-20 19:53:36,527 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3708, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3953, PETRI_PLACES=234, PETRI_TRANSITIONS=287}
[2024-06-20 19:53:36,527 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 193 predicate places.
[2024-06-20 19:53:36,527 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 287 transitions, 3953 flow
[2024-06-20 19:53:36,527 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-20 19:53:36,528 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:36,528 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:36,528 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 19:53:36,528 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-20 19:53:36,528 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:36,528 INFO  L85        PathProgramCache]: Analyzing trace with hash -1917830036, now seen corresponding path program 7 times
[2024-06-20 19:53:36,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:36,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659833471]
[2024-06-20 19:53:36,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:36,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:36,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:43,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:43,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:43,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659833471]
[2024-06-20 19:53:43,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659833471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:43,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:43,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:53:43,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275436955]
[2024-06-20 19:53:43,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:43,548 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:53:43,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:43,548 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:53:43,549 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:53:43,721 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:43,722 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 287 transitions, 3953 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:43,722 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:43,722 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:43,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:45,381 INFO  L124   PetriNetUnfolderBase]: 3163/4822 cut-off events.
[2024-06-20 19:53:45,382 INFO  L125   PetriNetUnfolderBase]: For 304612/304636 co-relation queries the response was YES.
[2024-06-20 19:53:45,415 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40647 conditions, 4822 events. 3163/4822 cut-off events. For 304612/304636 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 25532 event pairs, 671 based on Foata normal form. 12/4820 useless extension candidates. Maximal degree in co-relation 40534. Up to 4409 conditions per place. 
[2024-06-20 19:53:45,434 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 251 selfloop transitions, 66 changer transitions 0/320 dead transitions.
[2024-06-20 19:53:45,434 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 320 transitions, 4749 flow
[2024-06-20 19:53:45,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:53:45,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:53:45,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-20 19:53:45,437 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4111111111111111
[2024-06-20 19:53:45,437 INFO  L175             Difference]: Start difference. First operand has 234 places, 287 transitions, 3953 flow. Second operand 9 states and 148 transitions.
[2024-06-20 19:53:45,437 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 320 transitions, 4749 flow
[2024-06-20 19:53:45,798 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 320 transitions, 4609 flow, removed 37 selfloop flow, removed 5 redundant places.
[2024-06-20 19:53:45,802 INFO  L231             Difference]: Finished difference. Result has 238 places, 289 transitions, 4016 flow
[2024-06-20 19:53:45,802 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3813, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4016, PETRI_PLACES=238, PETRI_TRANSITIONS=289}
[2024-06-20 19:53:45,802 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 197 predicate places.
[2024-06-20 19:53:45,802 INFO  L495      AbstractCegarLoop]: Abstraction has has 238 places, 289 transitions, 4016 flow
[2024-06-20 19:53:45,803 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:45,803 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:45,803 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:45,803 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 19:53:45,803 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-20 19:53:45,803 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:45,803 INFO  L85        PathProgramCache]: Analyzing trace with hash -1917824084, now seen corresponding path program 4 times
[2024-06-20 19:53:45,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:45,803 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859779413]
[2024-06-20 19:53:45,803 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:45,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:45,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:53,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:53,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:53,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859779413]
[2024-06-20 19:53:53,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859779413] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:53,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:53,486 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:53:53,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711104657]
[2024-06-20 19:53:53,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:53,486 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:53:53,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:53,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:53:53,487 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:53:53,598 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:53:53,598 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 289 transitions, 4016 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:53,598 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:53,598 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:53:53,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:55,405 INFO  L124   PetriNetUnfolderBase]: 3260/4979 cut-off events.
[2024-06-20 19:53:55,405 INFO  L125   PetriNetUnfolderBase]: For 335480/335504 co-relation queries the response was YES.
[2024-06-20 19:53:55,440 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41821 conditions, 4979 events. 3260/4979 cut-off events. For 335480/335504 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 26581 event pairs, 657 based on Foata normal form. 28/4993 useless extension candidates. Maximal degree in co-relation 41706. Up to 4212 conditions per place. 
[2024-06-20 19:53:55,458 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 234 selfloop transitions, 97 changer transitions 0/334 dead transitions.
[2024-06-20 19:53:55,458 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 334 transitions, 4886 flow
[2024-06-20 19:53:55,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:53:55,460 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:53:55,460 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions.
[2024-06-20 19:53:55,460 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43
[2024-06-20 19:53:55,460 INFO  L175             Difference]: Start difference. First operand has 238 places, 289 transitions, 4016 flow. Second operand 10 states and 172 transitions.
[2024-06-20 19:53:55,460 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 334 transitions, 4886 flow
[2024-06-20 19:53:55,930 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 334 transitions, 4692 flow, removed 28 selfloop flow, removed 7 redundant places.
[2024-06-20 19:53:55,934 INFO  L231             Difference]: Finished difference. Result has 241 places, 293 transitions, 4074 flow
[2024-06-20 19:53:55,934 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3822, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4074, PETRI_PLACES=241, PETRI_TRANSITIONS=293}
[2024-06-20 19:53:55,934 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 200 predicate places.
[2024-06-20 19:53:55,934 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 293 transitions, 4074 flow
[2024-06-20 19:53:55,934 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:53:55,934 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:55,935 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:55,935 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 19:53:55,935 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:53:55,935 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:55,935 INFO  L85        PathProgramCache]: Analyzing trace with hash -1912252454, now seen corresponding path program 5 times
[2024-06-20 19:53:55,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:55,935 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308773951]
[2024-06-20 19:53:55,935 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:55,935 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:55,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:02,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:02,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:02,604 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308773951]
[2024-06-20 19:54:02,604 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308773951] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:02,604 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:02,604 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:54:02,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613978931]
[2024-06-20 19:54:02,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:02,604 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:54:02,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:02,604 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:54:02,604 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:54:02,801 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:02,801 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 293 transitions, 4074 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-20 19:54:02,802 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:02,802 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:02,802 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:04,630 INFO  L124   PetriNetUnfolderBase]: 3565/5478 cut-off events.
[2024-06-20 19:54:04,630 INFO  L125   PetriNetUnfolderBase]: For 402923/402947 co-relation queries the response was YES.
[2024-06-20 19:54:04,671 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47230 conditions, 5478 events. 3565/5478 cut-off events. For 402923/402947 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 30050 event pairs, 748 based on Foata normal form. 24/5488 useless extension candidates. Maximal degree in co-relation 47114. Up to 4221 conditions per place. 
[2024-06-20 19:54:04,692 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 242 selfloop transitions, 93 changer transitions 0/338 dead transitions.
[2024-06-20 19:54:04,692 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 338 transitions, 5236 flow
[2024-06-20 19:54:04,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:54:04,694 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:54:04,694 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions.
[2024-06-20 19:54:04,694 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44722222222222224
[2024-06-20 19:54:04,695 INFO  L175             Difference]: Start difference. First operand has 241 places, 293 transitions, 4074 flow. Second operand 9 states and 161 transitions.
[2024-06-20 19:54:04,695 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 338 transitions, 5236 flow
[2024-06-20 19:54:05,094 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 338 transitions, 5062 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-20 19:54:05,098 INFO  L231             Difference]: Finished difference. Result has 245 places, 296 transitions, 4205 flow
[2024-06-20 19:54:05,099 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3900, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4205, PETRI_PLACES=245, PETRI_TRANSITIONS=296}
[2024-06-20 19:54:05,099 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places.
[2024-06-20 19:54:05,099 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 296 transitions, 4205 flow
[2024-06-20 19:54:05,100 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-20 19:54:05,100 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:05,100 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:05,100 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 19:54:05,100 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:05,100 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:05,100 INFO  L85        PathProgramCache]: Analyzing trace with hash -1912467656, now seen corresponding path program 8 times
[2024-06-20 19:54:05,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:05,101 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416650360]
[2024-06-20 19:54:05,101 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:05,101 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:05,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:11,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:11,799 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:11,800 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416650360]
[2024-06-20 19:54:11,800 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416650360] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:11,800 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:11,800 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:54:11,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267196067]
[2024-06-20 19:54:11,800 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:11,800 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:54:11,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:11,800 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:54:11,800 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:54:11,919 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:11,919 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 296 transitions, 4205 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:11,919 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:11,919 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:11,919 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:13,793 INFO  L124   PetriNetUnfolderBase]: 3557/5466 cut-off events.
[2024-06-20 19:54:13,793 INFO  L125   PetriNetUnfolderBase]: For 397715/397739 co-relation queries the response was YES.
[2024-06-20 19:54:13,835 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47336 conditions, 5466 events. 3557/5466 cut-off events. For 397715/397739 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 30134 event pairs, 771 based on Foata normal form. 12/5464 useless extension candidates. Maximal degree in co-relation 47218. Up to 5053 conditions per place. 
[2024-06-20 19:54:13,857 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 262 selfloop transitions, 65 changer transitions 0/330 dead transitions.
[2024-06-20 19:54:13,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 330 transitions, 5034 flow
[2024-06-20 19:54:13,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:54:13,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:54:13,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-20 19:54:13,859 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 19:54:13,859 INFO  L175             Difference]: Start difference. First operand has 245 places, 296 transitions, 4205 flow. Second operand 9 states and 150 transitions.
[2024-06-20 19:54:13,859 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 330 transitions, 5034 flow
[2024-06-20 19:54:14,314 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 330 transitions, 4891 flow, removed 21 selfloop flow, removed 5 redundant places.
[2024-06-20 19:54:14,318 INFO  L231             Difference]: Finished difference. Result has 249 places, 298 transitions, 4270 flow
[2024-06-20 19:54:14,319 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4070, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4270, PETRI_PLACES=249, PETRI_TRANSITIONS=298}
[2024-06-20 19:54:14,319 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 208 predicate places.
[2024-06-20 19:54:14,319 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 298 transitions, 4270 flow
[2024-06-20 19:54:14,319 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:14,319 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:14,319 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:14,319 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 19:54:14,319 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:14,319 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:14,320 INFO  L85        PathProgramCache]: Analyzing trace with hash -1912461704, now seen corresponding path program 6 times
[2024-06-20 19:54:14,320 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:14,320 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420757578]
[2024-06-20 19:54:14,320 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:14,320 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:14,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:21,836 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:21,836 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:21,836 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420757578]
[2024-06-20 19:54:21,836 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420757578] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:21,836 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:21,836 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:54:21,836 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768120850]
[2024-06-20 19:54:21,836 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:21,836 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:54:21,837 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:21,837 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:54:21,837 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:54:21,976 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:21,976 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 298 transitions, 4270 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:21,976 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:21,976 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:21,976 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:23,946 INFO  L124   PetriNetUnfolderBase]: 3546/5457 cut-off events.
[2024-06-20 19:54:23,946 INFO  L125   PetriNetUnfolderBase]: For 419655/419679 co-relation queries the response was YES.
[2024-06-20 19:54:23,982 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46136 conditions, 5457 events. 3546/5457 cut-off events. For 419655/419679 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 30061 event pairs, 726 based on Foata normal form. 48/5491 useless extension candidates. Maximal degree in co-relation 46016. Up to 4570 conditions per place. 
[2024-06-20 19:54:24,003 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 244 selfloop transitions, 93 changer transitions 0/340 dead transitions.
[2024-06-20 19:54:24,003 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 340 transitions, 5137 flow
[2024-06-20 19:54:24,003 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:54:24,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:54:24,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-20 19:54:24,004 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4325
[2024-06-20 19:54:24,004 INFO  L175             Difference]: Start difference. First operand has 249 places, 298 transitions, 4270 flow. Second operand 10 states and 173 transitions.
[2024-06-20 19:54:24,004 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 340 transitions, 5137 flow
[2024-06-20 19:54:24,494 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 340 transitions, 4952 flow, removed 26 selfloop flow, removed 7 redundant places.
[2024-06-20 19:54:24,498 INFO  L231             Difference]: Finished difference. Result has 252 places, 299 transitions, 4317 flow
[2024-06-20 19:54:24,498 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4085, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4317, PETRI_PLACES=252, PETRI_TRANSITIONS=299}
[2024-06-20 19:54:24,498 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 211 predicate places.
[2024-06-20 19:54:24,498 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 299 transitions, 4317 flow
[2024-06-20 19:54:24,498 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:24,499 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:24,499 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:24,499 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 19:54:24,499 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:24,499 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:24,499 INFO  L85        PathProgramCache]: Analyzing trace with hash -1917977906, now seen corresponding path program 9 times
[2024-06-20 19:54:24,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:24,499 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719837776]
[2024-06-20 19:54:24,499 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:24,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:24,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:31,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:31,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:31,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719837776]
[2024-06-20 19:54:31,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719837776] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:31,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:31,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:54:31,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231118874]
[2024-06-20 19:54:31,298 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:31,299 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:54:31,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:31,301 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:54:31,301 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:54:31,535 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:31,535 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 299 transitions, 4317 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:31,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:31,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:31,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:33,480 INFO  L124   PetriNetUnfolderBase]: 3563/5484 cut-off events.
[2024-06-20 19:54:33,480 INFO  L125   PetriNetUnfolderBase]: For 386881/386905 co-relation queries the response was YES.
[2024-06-20 19:54:33,518 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46694 conditions, 5484 events. 3563/5484 cut-off events. For 386881/386905 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 30390 event pairs, 753 based on Foata normal form. 12/5482 useless extension candidates. Maximal degree in co-relation 46573. Up to 4988 conditions per place. 
[2024-06-20 19:54:33,538 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 262 selfloop transitions, 72 changer transitions 0/337 dead transitions.
[2024-06-20 19:54:33,538 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 337 transitions, 5447 flow
[2024-06-20 19:54:33,540 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:54:33,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:54:33,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-20 19:54:33,540 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 19:54:33,540 INFO  L175             Difference]: Start difference. First operand has 252 places, 299 transitions, 4317 flow. Second operand 9 states and 150 transitions.
[2024-06-20 19:54:33,540 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 337 transitions, 5447 flow
[2024-06-20 19:54:34,089 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 337 transitions, 5198 flow, removed 17 selfloop flow, removed 10 redundant places.
[2024-06-20 19:54:34,093 INFO  L231             Difference]: Finished difference. Result has 252 places, 304 transitions, 4386 flow
[2024-06-20 19:54:34,093 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4068, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4386, PETRI_PLACES=252, PETRI_TRANSITIONS=304}
[2024-06-20 19:54:34,093 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 211 predicate places.
[2024-06-20 19:54:34,094 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 304 transitions, 4386 flow
[2024-06-20 19:54:34,094 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:34,094 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:34,094 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:34,094 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-20 19:54:34,094 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:34,095 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:34,095 INFO  L85        PathProgramCache]: Analyzing trace with hash 1123413180, now seen corresponding path program 7 times
[2024-06-20 19:54:34,095 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:34,095 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095383476]
[2024-06-20 19:54:34,095 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:34,095 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:34,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:41,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:41,017 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:41,018 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095383476]
[2024-06-20 19:54:41,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095383476] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:41,018 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:41,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:54:41,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355820106]
[2024-06-20 19:54:41,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:41,018 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:54:41,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:41,018 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:54:41,018 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:54:41,195 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:41,195 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 304 transitions, 4386 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-20 19:54:41,195 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:41,195 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:41,195 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:43,205 INFO  L124   PetriNetUnfolderBase]: 3682/5685 cut-off events.
[2024-06-20 19:54:43,206 INFO  L125   PetriNetUnfolderBase]: For 435038/435062 co-relation queries the response was YES.
[2024-06-20 19:54:43,246 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48579 conditions, 5685 events. 3682/5685 cut-off events. For 435038/435062 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 31711 event pairs, 694 based on Foata normal form. 24/5695 useless extension candidates. Maximal degree in co-relation 48457. Up to 3347 conditions per place. 
[2024-06-20 19:54:43,268 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 231 selfloop transitions, 114 changer transitions 0/348 dead transitions.
[2024-06-20 19:54:43,268 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 348 transitions, 5571 flow
[2024-06-20 19:54:43,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:54:43,270 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:54:43,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-20 19:54:43,270 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4361111111111111
[2024-06-20 19:54:43,270 INFO  L175             Difference]: Start difference. First operand has 252 places, 304 transitions, 4386 flow. Second operand 9 states and 157 transitions.
[2024-06-20 19:54:43,271 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 348 transitions, 5571 flow
[2024-06-20 19:54:43,891 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 348 transitions, 5381 flow, removed 56 selfloop flow, removed 5 redundant places.
[2024-06-20 19:54:43,895 INFO  L231             Difference]: Finished difference. Result has 257 places, 307 transitions, 4600 flow
[2024-06-20 19:54:43,896 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4214, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4600, PETRI_PLACES=257, PETRI_TRANSITIONS=307}
[2024-06-20 19:54:43,896 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 216 predicate places.
[2024-06-20 19:54:43,896 INFO  L495      AbstractCegarLoop]: Abstraction has has 257 places, 307 transitions, 4600 flow
[2024-06-20 19:54:43,896 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-20 19:54:43,897 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:43,897 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:43,897 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-20 19:54:43,897 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:43,899 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:43,899 INFO  L85        PathProgramCache]: Analyzing trace with hash 857500698, now seen corresponding path program 10 times
[2024-06-20 19:54:43,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:43,900 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133256446]
[2024-06-20 19:54:43,900 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:43,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:43,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:50,828 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:50,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:50,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133256446]
[2024-06-20 19:54:50,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133256446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:50,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:50,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:54:50,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043280912]
[2024-06-20 19:54:50,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:50,829 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:54:50,829 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:50,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:54:50,830 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:54:51,010 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:54:51,010 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 307 transitions, 4600 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:51,010 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:51,010 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:54:51,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:52,969 INFO  L124   PetriNetUnfolderBase]: 3674/5673 cut-off events.
[2024-06-20 19:54:52,969 INFO  L125   PetriNetUnfolderBase]: For 428195/428219 co-relation queries the response was YES.
[2024-06-20 19:54:53,007 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49125 conditions, 5673 events. 3674/5673 cut-off events. For 428195/428219 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 31886 event pairs, 792 based on Foata normal form. 12/5671 useless extension candidates. Maximal degree in co-relation 49000. Up to 5260 conditions per place. 
[2024-06-20 19:54:53,025 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 266 selfloop transitions, 69 changer transitions 0/338 dead transitions.
[2024-06-20 19:54:53,025 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 338 transitions, 5372 flow
[2024-06-20 19:54:53,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:54:53,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:54:53,027 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-20 19:54:53,027 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4083333333333333
[2024-06-20 19:54:53,027 INFO  L175             Difference]: Start difference. First operand has 257 places, 307 transitions, 4600 flow. Second operand 9 states and 147 transitions.
[2024-06-20 19:54:53,027 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 338 transitions, 5372 flow
[2024-06-20 19:54:53,641 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 338 transitions, 5182 flow, removed 41 selfloop flow, removed 5 redundant places.
[2024-06-20 19:54:53,646 INFO  L231             Difference]: Finished difference. Result has 261 places, 307 transitions, 4555 flow
[2024-06-20 19:54:53,646 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4410, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4555, PETRI_PLACES=261, PETRI_TRANSITIONS=307}
[2024-06-20 19:54:53,646 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 220 predicate places.
[2024-06-20 19:54:53,646 INFO  L495      AbstractCegarLoop]: Abstraction has has 261 places, 307 transitions, 4555 flow
[2024-06-20 19:54:53,646 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:54:53,646 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:53,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:53,646 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-20 19:54:53,646 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:53,647 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:53,647 INFO  L85        PathProgramCache]: Analyzing trace with hash -2120794386, now seen corresponding path program 8 times
[2024-06-20 19:54:53,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:53,647 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097160184]
[2024-06-20 19:54:53,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:53,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:53,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:00,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:00,482 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:00,482 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097160184]
[2024-06-20 19:55:00,482 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097160184] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:00,482 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:00,482 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:55:00,482 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126540778]
[2024-06-20 19:55:00,482 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:00,482 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:55:00,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:00,483 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:55:00,483 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:55:00,595 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:00,595 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 307 transitions, 4555 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-20 19:55:00,595 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:00,595 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:00,595 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:02,669 INFO  L124   PetriNetUnfolderBase]: 3732/5771 cut-off events.
[2024-06-20 19:55:02,669 INFO  L125   PetriNetUnfolderBase]: For 457075/457099 co-relation queries the response was YES.
[2024-06-20 19:55:02,718 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49773 conditions, 5771 events. 3732/5771 cut-off events. For 457075/457099 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 32525 event pairs, 763 based on Foata normal form. 24/5781 useless extension candidates. Maximal degree in co-relation 49646. Up to 4644 conditions per place. 
[2024-06-20 19:55:02,743 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 248 selfloop transitions, 98 changer transitions 0/349 dead transitions.
[2024-06-20 19:55:02,744 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 349 transitions, 5676 flow
[2024-06-20 19:55:02,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:55:02,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:55:02,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-20 19:55:02,746 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44166666666666665
[2024-06-20 19:55:02,746 INFO  L175             Difference]: Start difference. First operand has 261 places, 307 transitions, 4555 flow. Second operand 9 states and 159 transitions.
[2024-06-20 19:55:02,746 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 349 transitions, 5676 flow
[2024-06-20 19:55:03,353 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 349 transitions, 5501 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-20 19:55:03,357 INFO  L231             Difference]: Finished difference. Result has 263 places, 308 transitions, 4620 flow
[2024-06-20 19:55:03,357 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4380, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4620, PETRI_PLACES=263, PETRI_TRANSITIONS=308}
[2024-06-20 19:55:03,357 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 222 predicate places.
[2024-06-20 19:55:03,357 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 308 transitions, 4620 flow
[2024-06-20 19:55:03,358 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-20 19:55:03,358 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:03,358 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:03,358 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-20 19:55:03,358 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:03,358 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:03,358 INFO  L85        PathProgramCache]: Analyzing trace with hash 1917664960, now seen corresponding path program 9 times
[2024-06-20 19:55:03,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:03,359 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073619663]
[2024-06-20 19:55:03,359 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:03,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:03,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:10,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:10,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:10,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073619663]
[2024-06-20 19:55:10,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073619663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:10,238 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:10,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:55:10,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797895740]
[2024-06-20 19:55:10,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:10,238 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:55:10,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:10,238 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:55:10,238 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:55:10,450 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:10,450 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 308 transitions, 4620 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-20 19:55:10,450 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:10,450 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:10,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:12,465 INFO  L124   PetriNetUnfolderBase]: 3757/5818 cut-off events.
[2024-06-20 19:55:12,466 INFO  L125   PetriNetUnfolderBase]: For 467781/467805 co-relation queries the response was YES.
[2024-06-20 19:55:12,511 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49976 conditions, 5818 events. 3757/5818 cut-off events. For 467781/467805 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 33013 event pairs, 784 based on Foata normal form. 28/5832 useless extension candidates. Maximal degree in co-relation 49848. Up to 5051 conditions per place. 
[2024-06-20 19:55:12,533 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 245 selfloop transitions, 97 changer transitions 0/345 dead transitions.
[2024-06-20 19:55:12,534 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 345 transitions, 5487 flow
[2024-06-20 19:55:12,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:55:12,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:55:12,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-20 19:55:12,536 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 19:55:12,536 INFO  L175             Difference]: Start difference. First operand has 263 places, 308 transitions, 4620 flow. Second operand 9 states and 156 transitions.
[2024-06-20 19:55:12,536 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 345 transitions, 5487 flow
[2024-06-20 19:55:13,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 345 transitions, 5193 flow, removed 22 selfloop flow, removed 8 redundant places.
[2024-06-20 19:55:13,067 INFO  L231             Difference]: Finished difference. Result has 264 places, 309 transitions, 4571 flow
[2024-06-20 19:55:13,067 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4336, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4571, PETRI_PLACES=264, PETRI_TRANSITIONS=309}
[2024-06-20 19:55:13,067 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 223 predicate places.
[2024-06-20 19:55:13,067 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 309 transitions, 4571 flow
[2024-06-20 19:55:13,067 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-20 19:55:13,068 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:13,068 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:13,068 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-20 19:55:13,068 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:13,068 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:13,068 INFO  L85        PathProgramCache]: Analyzing trace with hash 1048374032, now seen corresponding path program 10 times
[2024-06-20 19:55:13,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:13,068 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238867741]
[2024-06-20 19:55:13,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:13,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:13,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:20,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:20,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:20,056 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238867741]
[2024-06-20 19:55:20,056 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238867741] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:20,056 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:20,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:55:20,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728061742]
[2024-06-20 19:55:20,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:20,057 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:55:20,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:20,057 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:55:20,057 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:55:20,173 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:20,173 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 309 transitions, 4571 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:20,173 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:20,173 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:20,173 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:22,229 INFO  L124   PetriNetUnfolderBase]: 3721/5762 cut-off events.
[2024-06-20 19:55:22,229 INFO  L125   PetriNetUnfolderBase]: For 442513/442537 co-relation queries the response was YES.
[2024-06-20 19:55:22,271 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48146 conditions, 5762 events. 3721/5762 cut-off events. For 442513/442537 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32655 event pairs, 796 based on Foata normal form. 28/5776 useless extension candidates. Maximal degree in co-relation 48018. Up to 5197 conditions per place. 
[2024-06-20 19:55:22,291 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 270 selfloop transitions, 76 changer transitions 0/349 dead transitions.
[2024-06-20 19:55:22,291 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 349 transitions, 5419 flow
[2024-06-20 19:55:22,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:55:22,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:55:22,293 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions.
[2024-06-20 19:55:22,293 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4175
[2024-06-20 19:55:22,293 INFO  L175             Difference]: Start difference. First operand has 264 places, 309 transitions, 4571 flow. Second operand 10 states and 167 transitions.
[2024-06-20 19:55:22,293 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 349 transitions, 5419 flow
[2024-06-20 19:55:22,943 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 349 transitions, 5210 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-20 19:55:22,947 INFO  L231             Difference]: Finished difference. Result has 266 places, 309 transitions, 4524 flow
[2024-06-20 19:55:22,948 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4362, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4524, PETRI_PLACES=266, PETRI_TRANSITIONS=309}
[2024-06-20 19:55:22,948 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 225 predicate places.
[2024-06-20 19:55:22,948 INFO  L495      AbstractCegarLoop]: Abstraction has has 266 places, 309 transitions, 4524 flow
[2024-06-20 19:55:22,948 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:22,948 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:22,948 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:22,948 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-20 19:55:22,948 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:22,949 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:22,949 INFO  L85        PathProgramCache]: Analyzing trace with hash -1054015478, now seen corresponding path program 1 times
[2024-06-20 19:55:22,949 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:22,949 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072936496]
[2024-06-20 19:55:22,949 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:22,949 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:22,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:31,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:31,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:31,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072936496]
[2024-06-20 19:55:31,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072936496] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:31,017 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:31,017 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:55:31,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208417685]
[2024-06-20 19:55:31,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:31,017 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:55:31,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:31,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:55:31,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:55:31,132 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:31,133 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 309 transitions, 4524 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:31,133 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:31,133 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:31,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:32,918 INFO  L124   PetriNetUnfolderBase]: 3726/5767 cut-off events.
[2024-06-20 19:55:32,919 INFO  L125   PetriNetUnfolderBase]: For 409509/409509 co-relation queries the response was YES.
[2024-06-20 19:55:32,961 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48036 conditions, 5767 events. 3726/5767 cut-off events. For 409509/409509 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32739 event pairs, 880 based on Foata normal form. 1/5766 useless extension candidates. Maximal degree in co-relation 47908. Up to 5712 conditions per place. 
[2024-06-20 19:55:32,983 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 308 selfloop transitions, 21 changer transitions 0/332 dead transitions.
[2024-06-20 19:55:32,983 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 332 transitions, 5508 flow
[2024-06-20 19:55:32,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:55:32,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:55:32,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-20 19:55:32,985 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3892857142857143
[2024-06-20 19:55:32,985 INFO  L175             Difference]: Start difference. First operand has 266 places, 309 transitions, 4524 flow. Second operand 7 states and 109 transitions.
[2024-06-20 19:55:32,985 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 332 transitions, 5508 flow
[2024-06-20 19:55:33,562 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 332 transitions, 5344 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-20 19:55:33,566 INFO  L231             Difference]: Finished difference. Result has 265 places, 315 transitions, 4576 flow
[2024-06-20 19:55:33,567 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4362, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4576, PETRI_PLACES=265, PETRI_TRANSITIONS=315}
[2024-06-20 19:55:33,567 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 224 predicate places.
[2024-06-20 19:55:33,567 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 315 transitions, 4576 flow
[2024-06-20 19:55:33,567 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:33,567 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:33,567 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:33,567 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-20 19:55:33,567 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:33,568 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:33,568 INFO  L85        PathProgramCache]: Analyzing trace with hash -1053895508, now seen corresponding path program 2 times
[2024-06-20 19:55:33,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:33,568 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272962565]
[2024-06-20 19:55:33,568 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:33,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:33,600 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:41,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:41,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:41,623 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272962565]
[2024-06-20 19:55:41,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272962565] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:41,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:41,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:55:41,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132300975]
[2024-06-20 19:55:41,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:41,623 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:55:41,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:41,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:55:41,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:55:41,754 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:41,754 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 315 transitions, 4576 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:41,754 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:41,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:41,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:43,513 INFO  L124   PetriNetUnfolderBase]: 3736/5781 cut-off events.
[2024-06-20 19:55:43,513 INFO  L125   PetriNetUnfolderBase]: For 408271/408271 co-relation queries the response was YES.
[2024-06-20 19:55:43,564 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47944 conditions, 5781 events. 3736/5781 cut-off events. For 408271/408271 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32776 event pairs, 880 based on Foata normal form. 1/5780 useless extension candidates. Maximal degree in co-relation 47815. Up to 5738 conditions per place. 
[2024-06-20 19:55:43,588 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 312 selfloop transitions, 19 changer transitions 0/334 dead transitions.
[2024-06-20 19:55:43,588 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 334 transitions, 5398 flow
[2024-06-20 19:55:43,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:55:43,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:55:43,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions.
[2024-06-20 19:55:43,589 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37142857142857144
[2024-06-20 19:55:43,589 INFO  L175             Difference]: Start difference. First operand has 265 places, 315 transitions, 4576 flow. Second operand 7 states and 104 transitions.
[2024-06-20 19:55:43,589 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 334 transitions, 5398 flow
[2024-06-20 19:55:44,361 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 334 transitions, 5290 flow, removed 45 selfloop flow, removed 3 redundant places.
[2024-06-20 19:55:44,365 INFO  L231             Difference]: Finished difference. Result has 269 places, 321 transitions, 4640 flow
[2024-06-20 19:55:44,365 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4479, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4640, PETRI_PLACES=269, PETRI_TRANSITIONS=321}
[2024-06-20 19:55:44,366 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 228 predicate places.
[2024-06-20 19:55:44,366 INFO  L495      AbstractCegarLoop]: Abstraction has has 269 places, 321 transitions, 4640 flow
[2024-06-20 19:55:44,366 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:44,366 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:44,366 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:44,366 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-20 19:55:44,367 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:44,367 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:44,367 INFO  L85        PathProgramCache]: Analyzing trace with hash -1053895322, now seen corresponding path program 1 times
[2024-06-20 19:55:44,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:44,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072204395]
[2024-06-20 19:55:44,367 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:44,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:44,399 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:52,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:52,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:52,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072204395]
[2024-06-20 19:55:52,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072204395] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:52,849 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:52,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:55:52,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335226877]
[2024-06-20 19:55:52,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:52,850 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:55:52,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:52,850 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:55:52,850 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:55:52,973 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:55:52,973 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 321 transitions, 4640 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:52,973 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:52,973 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:55:52,974 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:54,742 INFO  L124   PetriNetUnfolderBase]: 3776/5835 cut-off events.
[2024-06-20 19:55:54,742 INFO  L125   PetriNetUnfolderBase]: For 425230/425263 co-relation queries the response was YES.
[2024-06-20 19:55:54,792 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48461 conditions, 5835 events. 3776/5835 cut-off events. For 425230/425263 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 33066 event pairs, 839 based on Foata normal form. 26/5855 useless extension candidates. Maximal degree in co-relation 48330. Up to 5656 conditions per place. 
[2024-06-20 19:55:54,817 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 301 selfloop transitions, 47 changer transitions 0/351 dead transitions.
[2024-06-20 19:55:54,817 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 351 transitions, 5661 flow
[2024-06-20 19:55:54,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:55:54,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:55:54,818 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-20 19:55:54,819 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4107142857142857
[2024-06-20 19:55:54,819 INFO  L175             Difference]: Start difference. First operand has 269 places, 321 transitions, 4640 flow. Second operand 7 states and 115 transitions.
[2024-06-20 19:55:54,819 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 351 transitions, 5661 flow
[2024-06-20 19:55:55,574 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 351 transitions, 5559 flow, removed 35 selfloop flow, removed 4 redundant places.
[2024-06-20 19:55:55,579 INFO  L231             Difference]: Finished difference. Result has 273 places, 332 transitions, 4779 flow
[2024-06-20 19:55:55,579 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4538, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4779, PETRI_PLACES=273, PETRI_TRANSITIONS=332}
[2024-06-20 19:55:55,579 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 232 predicate places.
[2024-06-20 19:55:55,579 INFO  L495      AbstractCegarLoop]: Abstraction has has 273 places, 332 transitions, 4779 flow
[2024-06-20 19:55:55,579 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:55:55,579 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:55,579 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:55,579 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-20 19:55:55,580 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:55,580 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:55,580 INFO  L85        PathProgramCache]: Analyzing trace with hash -1380817142, now seen corresponding path program 3 times
[2024-06-20 19:55:55,580 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:55,580 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372472309]
[2024-06-20 19:55:55,580 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:55,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:55,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:03,758 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:03,758 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:03,758 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372472309]
[2024-06-20 19:56:03,758 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372472309] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:03,758 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:03,758 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:56:03,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398389391]
[2024-06-20 19:56:03,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:03,759 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:56:03,759 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:03,759 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:56:03,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:56:03,929 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:56:03,929 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 332 transitions, 4779 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:56:03,929 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:03,929 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:56:03,929 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:05,741 INFO  L124   PetriNetUnfolderBase]: 3773/5833 cut-off events.
[2024-06-20 19:56:05,742 INFO  L125   PetriNetUnfolderBase]: For 428964/428964 co-relation queries the response was YES.
[2024-06-20 19:56:05,792 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48684 conditions, 5833 events. 3773/5833 cut-off events. For 428964/428964 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 33069 event pairs, 876 based on Foata normal form. 1/5832 useless extension candidates. Maximal degree in co-relation 48551. Up to 5784 conditions per place. 
[2024-06-20 19:56:05,817 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 325 selfloop transitions, 19 changer transitions 0/347 dead transitions.
[2024-06-20 19:56:05,817 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 347 transitions, 5513 flow
[2024-06-20 19:56:05,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:56:05,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:56:05,818 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-20 19:56:05,818 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4041666666666667
[2024-06-20 19:56:05,818 INFO  L175             Difference]: Start difference. First operand has 273 places, 332 transitions, 4779 flow. Second operand 6 states and 97 transitions.
[2024-06-20 19:56:05,818 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 347 transitions, 5513 flow
[2024-06-20 19:56:06,686 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 347 transitions, 5386 flow, removed 39 selfloop flow, removed 3 redundant places.
[2024-06-20 19:56:06,690 INFO  L231             Difference]: Finished difference. Result has 276 places, 332 transitions, 4700 flow
[2024-06-20 19:56:06,691 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4652, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4700, PETRI_PLACES=276, PETRI_TRANSITIONS=332}
[2024-06-20 19:56:06,691 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 235 predicate places.
[2024-06-20 19:56:06,691 INFO  L495      AbstractCegarLoop]: Abstraction has has 276 places, 332 transitions, 4700 flow
[2024-06-20 19:56:06,691 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:56:06,691 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:06,691 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:06,691 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-20 19:56:06,691 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:06,691 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:06,692 INFO  L85        PathProgramCache]: Analyzing trace with hash -1380579806, now seen corresponding path program 2 times
[2024-06-20 19:56:06,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:06,692 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046855516]
[2024-06-20 19:56:06,692 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:06,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:06,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:14,190 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:14,190 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:14,190 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046855516]
[2024-06-20 19:56:14,190 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046855516] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:14,190 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:14,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:56:14,191 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73052743]
[2024-06-20 19:56:14,191 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:14,191 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:56:14,191 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:14,191 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:56:14,191 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:56:14,280 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:56:14,281 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 332 transitions, 4700 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:56:14,281 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:14,281 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:56:14,281 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:16,222 INFO  L124   PetriNetUnfolderBase]: 3793/5859 cut-off events.
[2024-06-20 19:56:16,222 INFO  L125   PetriNetUnfolderBase]: For 446039/446072 co-relation queries the response was YES.
[2024-06-20 19:56:16,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48881 conditions, 5859 events. 3793/5859 cut-off events. For 446039/446072 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 33204 event pairs, 859 based on Foata normal form. 26/5879 useless extension candidates. Maximal degree in co-relation 48747. Up to 5785 conditions per place. 
[2024-06-20 19:56:16,287 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 321 selfloop transitions, 24 changer transitions 0/348 dead transitions.
[2024-06-20 19:56:16,287 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 348 transitions, 5490 flow
[2024-06-20 19:56:16,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:56:16,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:56:16,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions.
[2024-06-20 19:56:16,288 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39166666666666666
[2024-06-20 19:56:16,288 INFO  L175             Difference]: Start difference. First operand has 276 places, 332 transitions, 4700 flow. Second operand 6 states and 94 transitions.
[2024-06-20 19:56:16,288 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 348 transitions, 5490 flow
[2024-06-20 19:56:17,032 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 348 transitions, 5442 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-20 19:56:17,036 INFO  L231             Difference]: Finished difference. Result has 277 places, 336 transitions, 4765 flow
[2024-06-20 19:56:17,036 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4652, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4765, PETRI_PLACES=277, PETRI_TRANSITIONS=336}
[2024-06-20 19:56:17,037 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 236 predicate places.
[2024-06-20 19:56:17,037 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 336 transitions, 4765 flow
[2024-06-20 19:56:17,037 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:56:17,037 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:17,037 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:17,037 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-20 19:56:17,037 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:17,037 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:17,037 INFO  L85        PathProgramCache]: Analyzing trace with hash -1096939826, now seen corresponding path program 3 times
[2024-06-20 19:56:17,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:17,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686316993]
[2024-06-20 19:56:17,037 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:17,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:17,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:24,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:24,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:24,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686316993]
[2024-06-20 19:56:24,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686316993] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:24,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:24,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:56:24,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653482950]
[2024-06-20 19:56:24,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:24,567 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:56:24,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:24,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:56:24,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:56:24,686 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:56:24,686 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 336 transitions, 4765 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:56:24,686 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:24,686 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:56:24,686 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:26,443 INFO  L124   PetriNetUnfolderBase]: 3770/5826 cut-off events.
[2024-06-20 19:56:26,444 INFO  L125   PetriNetUnfolderBase]: For 450279/450312 co-relation queries the response was YES.
[2024-06-20 19:56:26,492 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48680 conditions, 5826 events. 3770/5826 cut-off events. For 450279/450312 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32986 event pairs, 834 based on Foata normal form. 26/5846 useless extension candidates. Maximal degree in co-relation 48545. Up to 5644 conditions per place. 
[2024-06-20 19:56:26,514 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 298 selfloop transitions, 51 changer transitions 0/352 dead transitions.
[2024-06-20 19:56:26,514 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 352 transitions, 5535 flow
[2024-06-20 19:56:26,515 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:56:26,515 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:56:26,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions.
[2024-06-20 19:56:26,515 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 19:56:26,515 INFO  L175             Difference]: Start difference. First operand has 277 places, 336 transitions, 4765 flow. Second operand 6 states and 100 transitions.
[2024-06-20 19:56:26,515 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 352 transitions, 5535 flow
[2024-06-20 19:56:27,150 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 352 transitions, 5468 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-20 19:56:27,155 INFO  L231             Difference]: Finished difference. Result has 279 places, 336 transitions, 4816 flow
[2024-06-20 19:56:27,155 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4698, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4816, PETRI_PLACES=279, PETRI_TRANSITIONS=336}
[2024-06-20 19:56:27,155 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 238 predicate places.
[2024-06-20 19:56:27,155 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 336 transitions, 4816 flow
[2024-06-20 19:56:27,156 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:56:27,156 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:27,156 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:27,156 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-20 19:56:27,156 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:27,156 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:27,156 INFO  L85        PathProgramCache]: Analyzing trace with hash -1380570878, now seen corresponding path program 1 times
[2024-06-20 19:56:27,156 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:27,156 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736755821]
[2024-06-20 19:56:27,156 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:27,156 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:27,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:37,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:37,125 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:37,125 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736755821]
[2024-06-20 19:56:37,125 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736755821] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:37,125 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:37,125 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:56:37,125 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378863236]
[2024-06-20 19:56:37,126 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:37,126 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:56:37,126 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:37,126 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:56:37,126 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:56:37,241 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:56:37,241 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 336 transitions, 4816 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-20 19:56:37,241 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:37,241 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:56:37,241 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:39,161 INFO  L124   PetriNetUnfolderBase]: 3773/5831 cut-off events.
[2024-06-20 19:56:39,161 INFO  L125   PetriNetUnfolderBase]: For 457868/457901 co-relation queries the response was YES.
[2024-06-20 19:56:39,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48906 conditions, 5831 events. 3773/5831 cut-off events. For 457868/457901 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32923 event pairs, 839 based on Foata normal form. 26/5851 useless extension candidates. Maximal degree in co-relation 48771. Up to 5746 conditions per place. 
[2024-06-20 19:56:39,226 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 320 selfloop transitions, 28 changer transitions 0/351 dead transitions.
[2024-06-20 19:56:39,226 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 351 transitions, 5606 flow
[2024-06-20 19:56:39,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:56:39,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:56:39,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions.
[2024-06-20 19:56:39,227 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3958333333333333
[2024-06-20 19:56:39,227 INFO  L175             Difference]: Start difference. First operand has 279 places, 336 transitions, 4816 flow. Second operand 6 states and 95 transitions.
[2024-06-20 19:56:39,227 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 351 transitions, 5606 flow
[2024-06-20 19:56:39,877 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 351 transitions, 5464 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-20 19:56:39,881 INFO  L231             Difference]: Finished difference. Result has 280 places, 339 transitions, 4796 flow
[2024-06-20 19:56:39,881 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4674, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4796, PETRI_PLACES=280, PETRI_TRANSITIONS=339}
[2024-06-20 19:56:39,882 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 239 predicate places.
[2024-06-20 19:56:39,882 INFO  L495      AbstractCegarLoop]: Abstraction has has 280 places, 339 transitions, 4796 flow
[2024-06-20 19:56:39,882 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-20 19:56:39,882 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:39,882 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:39,882 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-20 19:56:39,882 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:39,882 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:39,882 INFO  L85        PathProgramCache]: Analyzing trace with hash 923398775, now seen corresponding path program 1 times
[2024-06-20 19:56:39,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:39,883 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609981075]
[2024-06-20 19:56:39,883 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:39,883 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:39,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:47,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:47,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:47,635 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609981075]
[2024-06-20 19:56:47,635 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609981075] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:47,635 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:47,635 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-20 19:56:47,636 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909382836]
[2024-06-20 19:56:47,636 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:47,636 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-20 19:56:47,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:47,636 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-20 19:56:47,636 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2024-06-20 19:56:47,874 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:56:47,874 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 339 transitions, 4796 flow. Second operand  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:56:47,874 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:47,874 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:56:47,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:50,056 INFO  L124   PetriNetUnfolderBase]: 3814/5900 cut-off events.
[2024-06-20 19:56:50,057 INFO  L125   PetriNetUnfolderBase]: For 472787/472791 co-relation queries the response was YES.
[2024-06-20 19:56:50,111 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49355 conditions, 5900 events. 3814/5900 cut-off events. For 472787/472791 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 33329 event pairs, 681 based on Foata normal form. 16/5914 useless extension candidates. Maximal degree in co-relation 49219. Up to 5588 conditions per place. 
[2024-06-20 19:56:50,136 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 350 selfloop transitions, 30 changer transitions 0/383 dead transitions.
[2024-06-20 19:56:50,136 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 383 transitions, 5734 flow
[2024-06-20 19:56:50,138 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:56:50,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:56:50,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions.
[2024-06-20 19:56:50,139 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3975
[2024-06-20 19:56:50,139 INFO  L175             Difference]: Start difference. First operand has 280 places, 339 transitions, 4796 flow. Second operand 10 states and 159 transitions.
[2024-06-20 19:56:50,139 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 383 transitions, 5734 flow
[2024-06-20 19:56:50,983 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 383 transitions, 5634 flow, removed 24 selfloop flow, removed 4 redundant places.
[2024-06-20 19:56:50,987 INFO  L231             Difference]: Finished difference. Result has 286 places, 340 transitions, 4804 flow
[2024-06-20 19:56:50,987 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4696, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4804, PETRI_PLACES=286, PETRI_TRANSITIONS=340}
[2024-06-20 19:56:50,988 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 245 predicate places.
[2024-06-20 19:56:50,988 INFO  L495      AbstractCegarLoop]: Abstraction has has 286 places, 340 transitions, 4804 flow
[2024-06-20 19:56:50,988 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:56:50,988 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:50,988 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:50,988 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-20 19:56:50,988 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:50,988 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:50,988 INFO  L85        PathProgramCache]: Analyzing trace with hash -606080777, now seen corresponding path program 2 times
[2024-06-20 19:56:50,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:50,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187034337]
[2024-06-20 19:56:50,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:50,989 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:51,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:58,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:58,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:58,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187034337]
[2024-06-20 19:56:58,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187034337] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:58,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:58,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:56:58,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870705721]
[2024-06-20 19:56:58,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:58,865 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:56:58,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:58,865 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:56:58,865 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:56:59,067 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:56:59,067 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 340 transitions, 4804 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-20 19:56:59,067 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:59,067 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:56:59,067 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:01,240 INFO  L124   PetriNetUnfolderBase]: 3855/5973 cut-off events.
[2024-06-20 19:57:01,240 INFO  L125   PetriNetUnfolderBase]: For 488567/488569 co-relation queries the response was YES.
[2024-06-20 19:57:01,286 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50027 conditions, 5973 events. 3855/5973 cut-off events. For 488567/488569 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 34116 event pairs, 817 based on Foata normal form. 14/5985 useless extension candidates. Maximal degree in co-relation 49890. Up to 5479 conditions per place. 
[2024-06-20 19:57:01,308 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 318 selfloop transitions, 55 changer transitions 0/376 dead transitions.
[2024-06-20 19:57:01,309 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 376 transitions, 5704 flow
[2024-06-20 19:57:01,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:57:01,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:57:01,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-20 19:57:01,311 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4083333333333333
[2024-06-20 19:57:01,311 INFO  L175             Difference]: Start difference. First operand has 286 places, 340 transitions, 4804 flow. Second operand 9 states and 147 transitions.
[2024-06-20 19:57:01,311 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 376 transitions, 5704 flow
[2024-06-20 19:57:02,046 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 376 transitions, 5616 flow, removed 15 selfloop flow, removed 8 redundant places.
[2024-06-20 19:57:02,050 INFO  L231             Difference]: Finished difference. Result has 287 places, 341 transitions, 4877 flow
[2024-06-20 19:57:02,050 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4716, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4877, PETRI_PLACES=287, PETRI_TRANSITIONS=341}
[2024-06-20 19:57:02,051 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 246 predicate places.
[2024-06-20 19:57:02,051 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 341 transitions, 4877 flow
[2024-06-20 19:57:02,051 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-20 19:57:02,051 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:02,051 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:02,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-20 19:57:02,052 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:02,052 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:02,052 INFO  L85        PathProgramCache]: Analyzing trace with hash 1970658133, now seen corresponding path program 3 times
[2024-06-20 19:57:02,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:02,052 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947629446]
[2024-06-20 19:57:02,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:02,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:02,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:10,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:10,101 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:10,101 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947629446]
[2024-06-20 19:57:10,101 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947629446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:10,101 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:10,101 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-20 19:57:10,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071861422]
[2024-06-20 19:57:10,101 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:10,101 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-20 19:57:10,101 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:10,102 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-20 19:57:10,102 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2024-06-20 19:57:10,269 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:57:10,269 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 341 transitions, 4877 flow. Second operand  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:10,269 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:10,269 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:57:10,269 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:12,372 INFO  L124   PetriNetUnfolderBase]: 3896/6042 cut-off events.
[2024-06-20 19:57:12,372 INFO  L125   PetriNetUnfolderBase]: For 503443/503447 co-relation queries the response was YES.
[2024-06-20 19:57:12,425 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50606 conditions, 6042 events. 3896/6042 cut-off events. For 503443/503447 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 34692 event pairs, 840 based on Foata normal form. 16/6056 useless extension candidates. Maximal degree in co-relation 50468. Up to 5765 conditions per place. 
[2024-06-20 19:57:12,449 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 346 selfloop transitions, 36 changer transitions 0/385 dead transitions.
[2024-06-20 19:57:12,450 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 385 transitions, 5819 flow
[2024-06-20 19:57:12,451 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:57:12,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:57:12,451 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions.
[2024-06-20 19:57:12,452 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4025
[2024-06-20 19:57:12,452 INFO  L175             Difference]: Start difference. First operand has 287 places, 341 transitions, 4877 flow. Second operand 10 states and 161 transitions.
[2024-06-20 19:57:12,452 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 385 transitions, 5819 flow
[2024-06-20 19:57:13,189 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 385 transitions, 5683 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-20 19:57:13,194 INFO  L231             Difference]: Finished difference. Result has 291 places, 342 transitions, 4853 flow
[2024-06-20 19:57:13,194 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4741, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4853, PETRI_PLACES=291, PETRI_TRANSITIONS=342}
[2024-06-20 19:57:13,195 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 250 predicate places.
[2024-06-20 19:57:13,195 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 342 transitions, 4853 flow
[2024-06-20 19:57:13,195 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:13,195 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:13,195 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:13,195 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-20 19:57:13,195 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:13,195 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:13,195 INFO  L85        PathProgramCache]: Analyzing trace with hash 477888582, now seen corresponding path program 1 times
[2024-06-20 19:57:13,195 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:13,195 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259841212]
[2024-06-20 19:57:13,195 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:13,196 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:13,220 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:24,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:24,426 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:24,426 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259841212]
[2024-06-20 19:57:24,426 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259841212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:24,426 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:24,426 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:57:24,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655513946]
[2024-06-20 19:57:24,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:24,426 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:57:24,426 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:24,426 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:57:24,426 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:57:24,500 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:57:24,500 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 342 transitions, 4853 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-20 19:57:24,500 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:24,500 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:57:24,500 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:26,720 INFO  L124   PetriNetUnfolderBase]: 3936/6100 cut-off events.
[2024-06-20 19:57:26,720 INFO  L125   PetriNetUnfolderBase]: For 502117/502150 co-relation queries the response was YES.
[2024-06-20 19:57:26,767 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50912 conditions, 6100 events. 3936/6100 cut-off events. For 502117/502150 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 35016 event pairs, 874 based on Foata normal form. 26/6120 useless extension candidates. Maximal degree in co-relation 50773. Up to 5847 conditions per place. 
[2024-06-20 19:57:26,789 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 312 selfloop transitions, 63 changer transitions 0/378 dead transitions.
[2024-06-20 19:57:26,789 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 378 transitions, 6014 flow
[2024-06-20 19:57:26,791 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:57:26,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:57:26,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-20 19:57:26,791 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41785714285714287
[2024-06-20 19:57:26,791 INFO  L175             Difference]: Start difference. First operand has 291 places, 342 transitions, 4853 flow. Second operand 7 states and 117 transitions.
[2024-06-20 19:57:26,791 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 378 transitions, 6014 flow
[2024-06-20 19:57:27,487 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 378 transitions, 5926 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-20 19:57:27,491 INFO  L231             Difference]: Finished difference. Result has 291 places, 355 transitions, 5105 flow
[2024-06-20 19:57:27,492 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4765, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5105, PETRI_PLACES=291, PETRI_TRANSITIONS=355}
[2024-06-20 19:57:27,492 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 250 predicate places.
[2024-06-20 19:57:27,492 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 355 transitions, 5105 flow
[2024-06-20 19:57:27,492 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-20 19:57:27,492 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:27,492 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:27,492 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-20 19:57:27,492 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:27,492 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:27,493 INFO  L85        PathProgramCache]: Analyzing trace with hash -124898355, now seen corresponding path program 4 times
[2024-06-20 19:57:27,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:27,493 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65587644]
[2024-06-20 19:57:27,493 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:27,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:27,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:34,618 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:34,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:34,618 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65587644]
[2024-06-20 19:57:34,618 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65587644] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:34,618 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:34,618 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:57:34,618 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587500033]
[2024-06-20 19:57:34,618 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:34,618 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:57:34,618 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:34,619 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:57:34,619 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:57:34,862 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:57:34,862 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 355 transitions, 5105 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-20 19:57:34,862 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:34,862 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:57:34,862 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:36,997 INFO  L124   PetriNetUnfolderBase]: 3916/6068 cut-off events.
[2024-06-20 19:57:36,997 INFO  L125   PetriNetUnfolderBase]: For 503976/503978 co-relation queries the response was YES.
[2024-06-20 19:57:37,044 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50161 conditions, 6068 events. 3916/6068 cut-off events. For 503976/503978 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 34787 event pairs, 808 based on Foata normal form. 14/6080 useless extension candidates. Maximal degree in co-relation 50020. Up to 5592 conditions per place. 
[2024-06-20 19:57:37,064 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 335 selfloop transitions, 52 changer transitions 0/390 dead transitions.
[2024-06-20 19:57:37,064 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 390 transitions, 5995 flow
[2024-06-20 19:57:37,066 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:57:37,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:57:37,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-20 19:57:37,066 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4083333333333333
[2024-06-20 19:57:37,066 INFO  L175             Difference]: Start difference. First operand has 291 places, 355 transitions, 5105 flow. Second operand 9 states and 147 transitions.
[2024-06-20 19:57:37,067 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 390 transitions, 5995 flow
[2024-06-20 19:57:38,020 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 390 transitions, 5901 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-06-20 19:57:38,025 INFO  L231             Difference]: Finished difference. Result has 297 places, 355 transitions, 5124 flow
[2024-06-20 19:57:38,025 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5011, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5124, PETRI_PLACES=297, PETRI_TRANSITIONS=355}
[2024-06-20 19:57:38,025 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 256 predicate places.
[2024-06-20 19:57:38,025 INFO  L495      AbstractCegarLoop]: Abstraction has has 297 places, 355 transitions, 5124 flow
[2024-06-20 19:57:38,025 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-20 19:57:38,025 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:38,025 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:38,026 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-20 19:57:38,026 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:38,026 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:38,026 INFO  L85        PathProgramCache]: Analyzing trace with hash 487154172, now seen corresponding path program 2 times
[2024-06-20 19:57:38,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:38,026 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095637919]
[2024-06-20 19:57:38,026 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:38,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:38,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:48,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:48,944 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:48,944 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095637919]
[2024-06-20 19:57:48,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095637919] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:48,944 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:48,944 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:57:48,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714982758]
[2024-06-20 19:57:48,944 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:48,945 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:57:48,945 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:48,945 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:57:48,945 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:57:49,049 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:57:49,049 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 355 transitions, 5124 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-20 19:57:49,049 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:49,049 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:57:49,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:51,021 INFO  L124   PetriNetUnfolderBase]: 3936/6100 cut-off events.
[2024-06-20 19:57:51,022 INFO  L125   PetriNetUnfolderBase]: For 505354/505372 co-relation queries the response was YES.
[2024-06-20 19:57:51,072 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50560 conditions, 6100 events. 3936/6100 cut-off events. For 505354/505372 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 34978 event pairs, 891 based on Foata normal form. 10/6096 useless extension candidates. Maximal degree in co-relation 50418. Up to 5831 conditions per place. 
[2024-06-20 19:57:51,094 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 302 selfloop transitions, 68 changer transitions 0/373 dead transitions.
[2024-06-20 19:57:51,094 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 373 transitions, 6094 flow
[2024-06-20 19:57:51,095 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:57:51,095 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:57:51,095 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions.
[2024-06-20 19:57:51,095 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42083333333333334
[2024-06-20 19:57:51,095 INFO  L175             Difference]: Start difference. First operand has 297 places, 355 transitions, 5124 flow. Second operand 6 states and 101 transitions.
[2024-06-20 19:57:51,095 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 373 transitions, 6094 flow
[2024-06-20 19:57:51,976 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 373 transitions, 5955 flow, removed 10 selfloop flow, removed 8 redundant places.
[2024-06-20 19:57:51,981 INFO  L231             Difference]: Finished difference. Result has 295 places, 358 transitions, 5154 flow
[2024-06-20 19:57:51,981 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4987, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5154, PETRI_PLACES=295, PETRI_TRANSITIONS=358}
[2024-06-20 19:57:51,981 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 254 predicate places.
[2024-06-20 19:57:51,981 INFO  L495      AbstractCegarLoop]: Abstraction has has 295 places, 358 transitions, 5154 flow
[2024-06-20 19:57:51,981 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-20 19:57:51,982 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:51,982 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:51,982 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-20 19:57:51,982 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:51,982 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:51,982 INFO  L85        PathProgramCache]: Analyzing trace with hash -1703439866, now seen corresponding path program 3 times
[2024-06-20 19:57:51,982 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:51,982 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680860540]
[2024-06-20 19:57:51,982 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:51,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:52,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:03,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:03,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:03,091 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680860540]
[2024-06-20 19:58:03,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680860540] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:03,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:03,091 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:58:03,091 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94576655]
[2024-06-20 19:58:03,091 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:03,091 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:58:03,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:03,091 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:58:03,091 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:58:03,162 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:03,162 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 358 transitions, 5154 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-20 19:58:03,162 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:03,162 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:03,162 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:05,145 INFO  L124   PetriNetUnfolderBase]: 3924/6080 cut-off events.
[2024-06-20 19:58:05,145 INFO  L125   PetriNetUnfolderBase]: For 492947/492980 co-relation queries the response was YES.
[2024-06-20 19:58:05,201 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50022 conditions, 6080 events. 3924/6080 cut-off events. For 492947/492980 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 34861 event pairs, 861 based on Foata normal form. 26/6100 useless extension candidates. Maximal degree in co-relation 49879. Up to 5823 conditions per place. 
[2024-06-20 19:58:05,223 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 307 selfloop transitions, 68 changer transitions 0/378 dead transitions.
[2024-06-20 19:58:05,223 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 378 transitions, 5994 flow
[2024-06-20 19:58:05,225 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:58:05,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:58:05,225 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions.
[2024-06-20 19:58:05,225 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 19:58:05,225 INFO  L175             Difference]: Start difference. First operand has 295 places, 358 transitions, 5154 flow. Second operand 6 states and 104 transitions.
[2024-06-20 19:58:05,225 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 378 transitions, 5994 flow
[2024-06-20 19:58:06,048 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 378 transitions, 5854 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-20 19:58:06,052 INFO  L231             Difference]: Finished difference. Result has 297 places, 358 transitions, 5168 flow
[2024-06-20 19:58:06,052 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5014, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5168, PETRI_PLACES=297, PETRI_TRANSITIONS=358}
[2024-06-20 19:58:06,053 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 256 predicate places.
[2024-06-20 19:58:06,053 INFO  L495      AbstractCegarLoop]: Abstraction has has 297 places, 358 transitions, 5168 flow
[2024-06-20 19:58:06,053 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-20 19:58:06,053 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:06,053 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:06,053 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-20 19:58:06,053 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:06,053 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:06,053 INFO  L85        PathProgramCache]: Analyzing trace with hash -828742801, now seen corresponding path program 5 times
[2024-06-20 19:58:06,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:06,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541263151]
[2024-06-20 19:58:06,053 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:06,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:06,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:13,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-20 19:58:13,918 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:13,919 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541263151]
[2024-06-20 19:58:13,919 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541263151] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:13,919 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:13,919 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-20 19:58:13,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192731934]
[2024-06-20 19:58:13,919 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:13,919 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-20 19:58:13,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:13,919 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-20 19:58:13,919 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-06-20 19:58:14,057 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:14,057 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 358 transitions, 5168 flow. Second operand  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:14,058 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:14,058 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:14,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:16,352 INFO  L124   PetriNetUnfolderBase]: 3965/6155 cut-off events.
[2024-06-20 19:58:16,353 INFO  L125   PetriNetUnfolderBase]: For 521262/521280 co-relation queries the response was YES.
[2024-06-20 19:58:16,401 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50629 conditions, 6155 events. 3965/6155 cut-off events. For 521262/521280 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 35425 event pairs, 809 based on Foata normal form. 18/6159 useless extension candidates. Maximal degree in co-relation 50486. Up to 5673 conditions per place. 
[2024-06-20 19:58:16,424 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 327 selfloop transitions, 67 changer transitions 0/397 dead transitions.
[2024-06-20 19:58:16,424 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 397 transitions, 6116 flow
[2024-06-20 19:58:16,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:58:16,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:58:16,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions.
[2024-06-20 19:58:16,426 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4075
[2024-06-20 19:58:16,426 INFO  L175             Difference]: Start difference. First operand has 297 places, 358 transitions, 5168 flow. Second operand 10 states and 163 transitions.
[2024-06-20 19:58:16,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 397 transitions, 6116 flow
[2024-06-20 19:58:17,276 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 397 transitions, 5959 flow, removed 1 selfloop flow, removed 6 redundant places.
[2024-06-20 19:58:17,280 INFO  L231             Difference]: Finished difference. Result has 301 places, 359 transitions, 5185 flow
[2024-06-20 19:58:17,281 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5011, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5185, PETRI_PLACES=301, PETRI_TRANSITIONS=359}
[2024-06-20 19:58:17,281 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 260 predicate places.
[2024-06-20 19:58:17,281 INFO  L495      AbstractCegarLoop]: Abstraction has has 301 places, 359 transitions, 5185 flow
[2024-06-20 19:58:17,281 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:17,281 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:17,282 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:17,282 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-20 19:58:17,282 INFO  L420      AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:17,282 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:17,282 INFO  L85        PathProgramCache]: Analyzing trace with hash -828858121, now seen corresponding path program 6 times
[2024-06-20 19:58:17,282 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:17,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932906988]
[2024-06-20 19:58:17,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:17,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:17,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:24,740 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:24,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:24,740 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932906988]
[2024-06-20 19:58:24,740 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932906988] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:24,740 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:24,740 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:58:24,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615040064]
[2024-06-20 19:58:24,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:24,741 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:58:24,741 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:24,741 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:58:24,741 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:58:25,011 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:25,011 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 359 transitions, 5185 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-20 19:58:25,011 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:25,011 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:25,011 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:27,131 INFO  L124   PetriNetUnfolderBase]: 3945/6123 cut-off events.
[2024-06-20 19:58:27,131 INFO  L125   PetriNetUnfolderBase]: For 498236/498254 co-relation queries the response was YES.
[2024-06-20 19:58:27,180 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49774 conditions, 6123 events. 3945/6123 cut-off events. For 498236/498254 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 35199 event pairs, 780 based on Foata normal form. 18/6127 useless extension candidates. Maximal degree in co-relation 49631. Up to 5564 conditions per place. 
[2024-06-20 19:58:27,200 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 319 selfloop transitions, 71 changer transitions 0/393 dead transitions.
[2024-06-20 19:58:27,200 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 393 transitions, 6077 flow
[2024-06-20 19:58:27,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:58:27,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:58:27,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-20 19:58:27,202 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-20 19:58:27,202 INFO  L175             Difference]: Start difference. First operand has 301 places, 359 transitions, 5185 flow. Second operand 9 states and 149 transitions.
[2024-06-20 19:58:27,202 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 393 transitions, 6077 flow
[2024-06-20 19:58:28,095 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 393 transitions, 5927 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-20 19:58:28,100 INFO  L231             Difference]: Finished difference. Result has 302 places, 359 transitions, 5183 flow
[2024-06-20 19:58:28,100 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5035, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5183, PETRI_PLACES=302, PETRI_TRANSITIONS=359}
[2024-06-20 19:58:28,100 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 261 predicate places.
[2024-06-20 19:58:28,100 INFO  L495      AbstractCegarLoop]: Abstraction has has 302 places, 359 transitions, 5183 flow
[2024-06-20 19:58:28,100 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-20 19:58:28,100 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:28,101 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:28,101 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-20 19:58:28,101 INFO  L420      AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:28,101 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:28,101 INFO  L85        PathProgramCache]: Analyzing trace with hash -688367317, now seen corresponding path program 7 times
[2024-06-20 19:58:28,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:28,101 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701449905]
[2024-06-20 19:58:28,101 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:28,102 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:28,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:35,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:35,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:35,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701449905]
[2024-06-20 19:58:35,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701449905] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:35,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:35,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-20 19:58:35,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330275952]
[2024-06-20 19:58:35,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:35,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-20 19:58:35,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:35,959 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-20 19:58:35,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2024-06-20 19:58:36,194 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:36,194 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 359 transitions, 5183 flow. Second operand  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:36,194 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:36,194 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:36,194 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:38,336 INFO  L124   PetriNetUnfolderBase]: 3925/6091 cut-off events.
[2024-06-20 19:58:38,336 INFO  L125   PetriNetUnfolderBase]: For 484013/484031 co-relation queries the response was YES.
[2024-06-20 19:58:38,394 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48947 conditions, 6091 events. 3925/6091 cut-off events. For 484013/484031 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 34982 event pairs, 773 based on Foata normal form. 18/6095 useless extension candidates. Maximal degree in co-relation 48803. Up to 5609 conditions per place. 
[2024-06-20 19:58:38,418 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 324 selfloop transitions, 70 changer transitions 0/397 dead transitions.
[2024-06-20 19:58:38,418 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 397 transitions, 6099 flow
[2024-06-20 19:58:38,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:58:38,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:58:38,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions.
[2024-06-20 19:58:38,420 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.405
[2024-06-20 19:58:38,420 INFO  L175             Difference]: Start difference. First operand has 302 places, 359 transitions, 5183 flow. Second operand 10 states and 162 transitions.
[2024-06-20 19:58:38,420 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 397 transitions, 6099 flow
[2024-06-20 19:58:39,341 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 397 transitions, 5763 flow, removed 23 selfloop flow, removed 11 redundant places.
[2024-06-20 19:58:39,345 INFO  L231             Difference]: Finished difference. Result has 301 places, 359 transitions, 4993 flow
[2024-06-20 19:58:39,345 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4847, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4993, PETRI_PLACES=301, PETRI_TRANSITIONS=359}
[2024-06-20 19:58:39,346 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 260 predicate places.
[2024-06-20 19:58:39,346 INFO  L495      AbstractCegarLoop]: Abstraction has has 301 places, 359 transitions, 4993 flow
[2024-06-20 19:58:39,346 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:39,346 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:39,346 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:39,346 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-20 19:58:39,346 INFO  L420      AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:39,346 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:39,346 INFO  L85        PathProgramCache]: Analyzing trace with hash 717486683, now seen corresponding path program 8 times
[2024-06-20 19:58:39,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:39,347 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72885358]
[2024-06-20 19:58:39,347 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:39,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:39,391 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:47,378 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:47,378 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:47,378 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72885358]
[2024-06-20 19:58:47,378 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72885358] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:47,379 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:47,379 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-20 19:58:47,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769442422]
[2024-06-20 19:58:47,379 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:47,379 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-20 19:58:47,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:47,379 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-20 19:58:47,379 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2024-06-20 19:58:47,542 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:47,543 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 359 transitions, 4993 flow. Second operand  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:47,543 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:47,543 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:47,543 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:49,641 INFO  L124   PetriNetUnfolderBase]: 3905/6059 cut-off events.
[2024-06-20 19:58:49,641 INFO  L125   PetriNetUnfolderBase]: For 466692/466710 co-relation queries the response was YES.
[2024-06-20 19:58:49,693 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46998 conditions, 6059 events. 3905/6059 cut-off events. For 466692/466710 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 34708 event pairs, 750 based on Foata normal form. 18/6063 useless extension candidates. Maximal degree in co-relation 46857. Up to 5223 conditions per place. 
[2024-06-20 19:58:49,714 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 305 selfloop transitions, 93 changer transitions 0/401 dead transitions.
[2024-06-20 19:58:49,714 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 401 transitions, 5833 flow
[2024-06-20 19:58:49,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:58:49,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:58:49,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions.
[2024-06-20 19:58:49,716 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43
[2024-06-20 19:58:49,716 INFO  L175             Difference]: Start difference. First operand has 301 places, 359 transitions, 4993 flow. Second operand 10 states and 172 transitions.
[2024-06-20 19:58:49,717 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 401 transitions, 5833 flow
[2024-06-20 19:58:50,609 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 401 transitions, 5666 flow, removed 7 selfloop flow, removed 9 redundant places.
[2024-06-20 19:58:50,613 INFO  L231             Difference]: Finished difference. Result has 301 places, 358 transitions, 4890 flow
[2024-06-20 19:58:50,614 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4700, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4890, PETRI_PLACES=301, PETRI_TRANSITIONS=358}
[2024-06-20 19:58:50,614 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 260 predicate places.
[2024-06-20 19:58:50,614 INFO  L495      AbstractCegarLoop]: Abstraction has has 301 places, 358 transitions, 4890 flow
[2024-06-20 19:58:50,614 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:50,614 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:50,614 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:50,614 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-20 19:58:50,614 INFO  L420      AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:50,614 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:50,615 INFO  L85        PathProgramCache]: Analyzing trace with hash 710952039, now seen corresponding path program 1 times
[2024-06-20 19:58:50,615 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:50,615 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231148249]
[2024-06-20 19:58:50,615 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:50,615 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:50,650 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:59,275 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:59,275 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:59,275 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231148249]
[2024-06-20 19:58:59,275 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231148249] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:59,275 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:59,276 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:58:59,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489663391]
[2024-06-20 19:58:59,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:59,276 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:58:59,276 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:59,276 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:58:59,276 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:58:59,412 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:58:59,412 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 358 transitions, 4890 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-20 19:58:59,412 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:59,412 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:58:59,412 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:01,260 INFO  L124   PetriNetUnfolderBase]: 3910/6064 cut-off events.
[2024-06-20 19:59:01,261 INFO  L125   PetriNetUnfolderBase]: For 452676/452676 co-relation queries the response was YES.
[2024-06-20 19:59:01,315 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47231 conditions, 6064 events. 3910/6064 cut-off events. For 452676/452676 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 34803 event pairs, 857 based on Foata normal form. 1/6063 useless extension candidates. Maximal degree in co-relation 47089. Up to 5986 conditions per place. 
[2024-06-20 19:59:01,339 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 347 selfloop transitions, 36 changer transitions 0/386 dead transitions.
[2024-06-20 19:59:01,339 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 386 transitions, 5988 flow
[2024-06-20 19:59:01,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:59:01,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:59:01,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions.
[2024-06-20 19:59:01,340 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37222222222222223
[2024-06-20 19:59:01,340 INFO  L175             Difference]: Start difference. First operand has 301 places, 358 transitions, 4890 flow. Second operand 9 states and 134 transitions.
[2024-06-20 19:59:01,340 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 386 transitions, 5988 flow
[2024-06-20 19:59:02,279 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 386 transitions, 5778 flow, removed 7 selfloop flow, removed 8 redundant places.
[2024-06-20 19:59:02,283 INFO  L231             Difference]: Finished difference. Result has 302 places, 364 transitions, 4889 flow
[2024-06-20 19:59:02,284 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4680, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4889, PETRI_PLACES=302, PETRI_TRANSITIONS=364}
[2024-06-20 19:59:02,284 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 261 predicate places.
[2024-06-20 19:59:02,284 INFO  L495      AbstractCegarLoop]: Abstraction has has 302 places, 364 transitions, 4889 flow
[2024-06-20 19:59:02,284 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-20 19:59:02,284 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:02,284 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:02,285 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-20 19:59:02,285 INFO  L420      AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:02,285 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:02,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 1685259404, now seen corresponding path program 1 times
[2024-06-20 19:59:02,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:02,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196762460]
[2024-06-20 19:59:02,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:02,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:02,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:10,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:10,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:10,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196762460]
[2024-06-20 19:59:10,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196762460] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:10,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:10,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:59:10,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285474222]
[2024-06-20 19:59:10,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:10,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:59:10,270 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:10,270 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:59:10,270 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:59:10,392 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:10,392 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 364 transitions, 4889 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-20 19:59:10,392 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:10,392 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:10,392 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:12,284 INFO  L124   PetriNetUnfolderBase]: 3974/6151 cut-off events.
[2024-06-20 19:59:12,284 INFO  L125   PetriNetUnfolderBase]: For 487785/487818 co-relation queries the response was YES.
[2024-06-20 19:59:12,334 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48717 conditions, 6151 events. 3974/6151 cut-off events. For 487785/487818 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 35330 event pairs, 826 based on Foata normal form. 26/6171 useless extension candidates. Maximal degree in co-relation 48574. Up to 5812 conditions per place. 
[2024-06-20 19:59:12,355 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 330 selfloop transitions, 69 changer transitions 0/402 dead transitions.
[2024-06-20 19:59:12,355 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 402 transitions, 6445 flow
[2024-06-20 19:59:12,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:59:12,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:59:12,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-20 19:59:12,357 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.415625
[2024-06-20 19:59:12,357 INFO  L175             Difference]: Start difference. First operand has 302 places, 364 transitions, 4889 flow. Second operand 8 states and 133 transitions.
[2024-06-20 19:59:12,357 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 402 transitions, 6445 flow
[2024-06-20 19:59:13,192 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 402 transitions, 6341 flow, removed 35 selfloop flow, removed 5 redundant places.
[2024-06-20 19:59:13,196 INFO  L231             Difference]: Finished difference. Result has 306 places, 375 transitions, 5248 flow
[2024-06-20 19:59:13,197 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4785, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5248, PETRI_PLACES=306, PETRI_TRANSITIONS=375}
[2024-06-20 19:59:13,197 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 265 predicate places.
[2024-06-20 19:59:13,197 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 375 transitions, 5248 flow
[2024-06-20 19:59:13,197 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-20 19:59:13,197 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:13,197 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:13,197 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81
[2024-06-20 19:59:13,197 INFO  L420      AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:13,197 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:13,197 INFO  L85        PathProgramCache]: Analyzing trace with hash 1688978319, now seen corresponding path program 2 times
[2024-06-20 19:59:13,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:13,198 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947152583]
[2024-06-20 19:59:13,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:13,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:13,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:21,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:21,414 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:21,414 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947152583]
[2024-06-20 19:59:21,414 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947152583] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:21,414 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:21,414 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:59:21,414 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935844072]
[2024-06-20 19:59:21,415 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:21,415 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:59:21,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:21,415 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:59:21,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:59:21,550 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:21,550 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 375 transitions, 5248 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-20 19:59:21,550 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:21,550 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:21,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:23,545 INFO  L124   PetriNetUnfolderBase]: 3979/6160 cut-off events.
[2024-06-20 19:59:23,546 INFO  L125   PetriNetUnfolderBase]: For 496955/496955 co-relation queries the response was YES.
[2024-06-20 19:59:23,596 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49602 conditions, 6160 events. 3979/6160 cut-off events. For 496955/496955 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 35395 event pairs, 862 based on Foata normal form. 1/6159 useless extension candidates. Maximal degree in co-relation 49456. Up to 6114 conditions per place. 
[2024-06-20 19:59:23,620 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 367 selfloop transitions, 22 changer transitions 0/392 dead transitions.
[2024-06-20 19:59:23,620 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 392 transitions, 6120 flow
[2024-06-20 19:59:23,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:59:23,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:59:23,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions.
[2024-06-20 19:59:23,621 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.35625
[2024-06-20 19:59:23,621 INFO  L175             Difference]: Start difference. First operand has 306 places, 375 transitions, 5248 flow. Second operand 8 states and 114 transitions.
[2024-06-20 19:59:23,621 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 392 transitions, 6120 flow
[2024-06-20 19:59:24,666 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 392 transitions, 5921 flow, removed 74 selfloop flow, removed 3 redundant places.
[2024-06-20 19:59:24,671 INFO  L231             Difference]: Finished difference. Result has 311 places, 378 transitions, 5159 flow
[2024-06-20 19:59:24,671 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5049, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5159, PETRI_PLACES=311, PETRI_TRANSITIONS=378}
[2024-06-20 19:59:24,671 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 270 predicate places.
[2024-06-20 19:59:24,671 INFO  L495      AbstractCegarLoop]: Abstraction has has 311 places, 378 transitions, 5159 flow
[2024-06-20 19:59:24,672 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-20 19:59:24,672 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:24,672 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:24,672 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82
[2024-06-20 19:59:24,672 INFO  L420      AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:24,672 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:24,672 INFO  L85        PathProgramCache]: Analyzing trace with hash 714761474, now seen corresponding path program 2 times
[2024-06-20 19:59:24,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:24,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214765595]
[2024-06-20 19:59:24,672 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:24,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:24,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:32,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:32,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:32,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214765595]
[2024-06-20 19:59:32,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214765595] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:32,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:32,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:59:32,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424359205]
[2024-06-20 19:59:32,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:32,820 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:59:32,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:32,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:59:32,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:59:32,955 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:32,955 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 378 transitions, 5159 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-20 19:59:32,955 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:32,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:32,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:35,080 INFO  L124   PetriNetUnfolderBase]: 4043/6247 cut-off events.
[2024-06-20 19:59:35,080 INFO  L125   PetriNetUnfolderBase]: For 531838/531871 co-relation queries the response was YES.
[2024-06-20 19:59:35,130 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50673 conditions, 6247 events. 4043/6247 cut-off events. For 531838/531871 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 35947 event pairs, 829 based on Foata normal form. 26/6267 useless extension candidates. Maximal degree in co-relation 50525. Up to 6004 conditions per place. 
[2024-06-20 19:59:35,152 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 349 selfloop transitions, 56 changer transitions 0/408 dead transitions.
[2024-06-20 19:59:35,152 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 408 transitions, 6441 flow
[2024-06-20 19:59:35,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:59:35,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:59:35,152 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-20 19:59:35,153 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:59:35,153 INFO  L175             Difference]: Start difference. First operand has 311 places, 378 transitions, 5159 flow. Second operand 8 states and 128 transitions.
[2024-06-20 19:59:35,153 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 408 transitions, 6441 flow
[2024-06-20 19:59:36,218 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 408 transitions, 6359 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-20 19:59:36,223 INFO  L231             Difference]: Finished difference. Result has 314 places, 386 transitions, 5414 flow
[2024-06-20 19:59:36,223 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5077, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5414, PETRI_PLACES=314, PETRI_TRANSITIONS=386}
[2024-06-20 19:59:36,223 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 273 predicate places.
[2024-06-20 19:59:36,223 INFO  L495      AbstractCegarLoop]: Abstraction has has 314 places, 386 transitions, 5414 flow
[2024-06-20 19:59:36,224 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-20 19:59:36,224 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:36,224 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:36,224 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83
[2024-06-20 19:59:36,224 INFO  L420      AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:36,224 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:36,224 INFO  L85        PathProgramCache]: Analyzing trace with hash 714767054, now seen corresponding path program 3 times
[2024-06-20 19:59:36,224 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:36,224 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160429905]
[2024-06-20 19:59:36,224 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:36,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:36,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:44,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:44,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:44,449 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160429905]
[2024-06-20 19:59:44,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160429905] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:44,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:44,449 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:59:44,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067398780]
[2024-06-20 19:59:44,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:44,449 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:59:44,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:44,450 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:59:44,450 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:59:44,584 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:44,584 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 386 transitions, 5414 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-20 19:59:44,584 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:44,584 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:44,584 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:46,727 INFO  L124   PetriNetUnfolderBase]: 4047/6253 cut-off events.
[2024-06-20 19:59:46,727 INFO  L125   PetriNetUnfolderBase]: For 541358/541391 co-relation queries the response was YES.
[2024-06-20 19:59:46,777 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51155 conditions, 6253 events. 4047/6253 cut-off events. For 541358/541391 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 35932 event pairs, 827 based on Foata normal form. 26/6273 useless extension candidates. Maximal degree in co-relation 51005. Up to 6011 conditions per place. 
[2024-06-20 19:59:46,799 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 348 selfloop transitions, 64 changer transitions 0/415 dead transitions.
[2024-06-20 19:59:46,799 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 415 transitions, 6623 flow
[2024-06-20 19:59:46,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:59:46,800 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:59:46,800 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions.
[2024-06-20 19:59:46,800 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.385
[2024-06-20 19:59:46,800 INFO  L175             Difference]: Start difference. First operand has 314 places, 386 transitions, 5414 flow. Second operand 10 states and 154 transitions.
[2024-06-20 19:59:46,800 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 415 transitions, 6623 flow
[2024-06-20 19:59:47,961 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 415 transitions, 6452 flow, removed 57 selfloop flow, removed 4 redundant places.
[2024-06-20 19:59:47,966 INFO  L231             Difference]: Finished difference. Result has 320 places, 390 transitions, 5483 flow
[2024-06-20 19:59:47,967 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5259, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5483, PETRI_PLACES=320, PETRI_TRANSITIONS=390}
[2024-06-20 19:59:47,967 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 279 predicate places.
[2024-06-20 19:59:47,967 INFO  L495      AbstractCegarLoop]: Abstraction has has 320 places, 390 transitions, 5483 flow
[2024-06-20 19:59:47,967 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-20 19:59:47,967 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:47,967 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:47,967 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84
[2024-06-20 19:59:47,968 INFO  L420      AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:47,968 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:47,968 INFO  L85        PathProgramCache]: Analyzing trace with hash 144347992, now seen corresponding path program 4 times
[2024-06-20 19:59:47,968 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:47,968 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635800556]
[2024-06-20 19:59:47,968 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:47,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:48,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:56,244 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:56,244 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:56,244 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635800556]
[2024-06-20 19:59:56,244 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635800556] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:56,244 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:56,244 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:59:56,244 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952459215]
[2024-06-20 19:59:56,244 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:56,245 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:59:56,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:56,245 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:59:56,245 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:59:56,349 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:59:56,349 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 390 transitions, 5483 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-20 19:59:56,349 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:56,349 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:59:56,349 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:58,470 INFO  L124   PetriNetUnfolderBase]: 4099/6325 cut-off events.
[2024-06-20 19:59:58,471 INFO  L125   PetriNetUnfolderBase]: For 567415/567448 co-relation queries the response was YES.
[2024-06-20 19:59:58,524 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52404 conditions, 6325 events. 4099/6325 cut-off events. For 567415/567448 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 36367 event pairs, 850 based on Foata normal form. 26/6345 useless extension candidates. Maximal degree in co-relation 52252. Up to 6048 conditions per place. 
[2024-06-20 19:59:58,548 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 358 selfloop transitions, 59 changer transitions 0/420 dead transitions.
[2024-06-20 19:59:58,548 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 420 transitions, 6985 flow
[2024-06-20 19:59:58,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:59:58,549 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:59:58,549 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-20 19:59:58,549 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4142857142857143
[2024-06-20 19:59:58,549 INFO  L175             Difference]: Start difference. First operand has 320 places, 390 transitions, 5483 flow. Second operand 7 states and 116 transitions.
[2024-06-20 19:59:58,549 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 420 transitions, 6985 flow
[2024-06-20 19:59:59,791 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 420 transitions, 6795 flow, removed 32 selfloop flow, removed 8 redundant places.
[2024-06-20 19:59:59,796 INFO  L231             Difference]: Finished difference. Result has 321 places, 399 transitions, 5720 flow
[2024-06-20 19:59:59,797 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5293, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5720, PETRI_PLACES=321, PETRI_TRANSITIONS=399}
[2024-06-20 19:59:59,797 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 280 predicate places.
[2024-06-20 19:59:59,797 INFO  L495      AbstractCegarLoop]: Abstraction has has 321 places, 399 transitions, 5720 flow
[2024-06-20 19:59:59,797 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-20 19:59:59,797 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:59,797 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:59,797 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85
[2024-06-20 19:59:59,797 INFO  L420      AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:59,798 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:59,798 INFO  L85        PathProgramCache]: Analyzing trace with hash 144342412, now seen corresponding path program 5 times
[2024-06-20 19:59:59,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:59,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105860897]
[2024-06-20 19:59:59,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:59,798 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:59,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:08,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:08,131 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:08,131 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105860897]
[2024-06-20 20:00:08,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105860897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:08,131 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:08,131 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:08,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419848766]
[2024-06-20 20:00:08,131 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:08,131 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:08,131 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:08,131 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:08,132 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:08,285 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:08,286 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 399 transitions, 5720 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-20 20:00:08,286 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:08,286 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:08,286 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:10,404 INFO  L124   PetriNetUnfolderBase]: 4091/6315 cut-off events.
[2024-06-20 20:00:10,405 INFO  L125   PetriNetUnfolderBase]: For 571252/571285 co-relation queries the response was YES.
[2024-06-20 20:00:10,459 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52357 conditions, 6315 events. 4091/6315 cut-off events. For 571252/571285 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 36333 event pairs, 844 based on Foata normal form. 26/6335 useless extension candidates. Maximal degree in co-relation 52202. Up to 6045 conditions per place. 
[2024-06-20 20:00:10,482 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 358 selfloop transitions, 61 changer transitions 0/422 dead transitions.
[2024-06-20 20:00:10,482 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 422 transitions, 6844 flow
[2024-06-20 20:00:10,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:00:10,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:00:10,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-20 20:00:10,483 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42142857142857143
[2024-06-20 20:00:10,483 INFO  L175             Difference]: Start difference. First operand has 321 places, 399 transitions, 5720 flow. Second operand 7 states and 118 transitions.
[2024-06-20 20:00:10,483 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 422 transitions, 6844 flow
[2024-06-20 20:00:11,839 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 422 transitions, 6587 flow, removed 89 selfloop flow, removed 5 redundant places.
[2024-06-20 20:00:11,844 INFO  L231             Difference]: Finished difference. Result has 323 places, 399 transitions, 5593 flow
[2024-06-20 20:00:11,844 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5463, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5593, PETRI_PLACES=323, PETRI_TRANSITIONS=399}
[2024-06-20 20:00:11,844 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 282 predicate places.
[2024-06-20 20:00:11,845 INFO  L495      AbstractCegarLoop]: Abstraction has has 323 places, 399 transitions, 5593 flow
[2024-06-20 20:00:11,845 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-20 20:00:11,845 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:11,845 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:11,845 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86
[2024-06-20 20:00:11,845 INFO  L420      AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:11,845 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:11,845 INFO  L85        PathProgramCache]: Analyzing trace with hash 151966769, now seen corresponding path program 1 times
[2024-06-20 20:00:11,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:11,845 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000140379]
[2024-06-20 20:00:11,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:11,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:11,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:19,862 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:19,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:19,863 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000140379]
[2024-06-20 20:00:19,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000140379] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:19,863 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:19,863 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:19,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663755376]
[2024-06-20 20:00:19,863 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:19,863 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:19,863 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:19,863 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:19,863 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:19,972 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:19,976 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 399 transitions, 5593 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-20 20:00:19,976 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:19,976 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:19,977 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:22,061 INFO  L124   PetriNetUnfolderBase]: 4085/6307 cut-off events.
[2024-06-20 20:00:22,061 INFO  L125   PetriNetUnfolderBase]: For 569673/569706 co-relation queries the response was YES.
[2024-06-20 20:00:22,115 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51825 conditions, 6307 events. 4085/6307 cut-off events. For 569673/569706 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 36306 event pairs, 846 based on Foata normal form. 24/6325 useless extension candidates. Maximal degree in co-relation 51671. Up to 6216 conditions per place. 
[2024-06-20 20:00:22,138 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 378 selfloop transitions, 33 changer transitions 0/414 dead transitions.
[2024-06-20 20:00:22,138 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 414 transitions, 6525 flow
[2024-06-20 20:00:22,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:00:22,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:00:22,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions.
[2024-06-20 20:00:22,140 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3958333333333333
[2024-06-20 20:00:22,140 INFO  L175             Difference]: Start difference. First operand has 323 places, 399 transitions, 5593 flow. Second operand 6 states and 95 transitions.
[2024-06-20 20:00:22,140 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 414 transitions, 6525 flow
[2024-06-20 20:00:23,367 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 414 transitions, 6336 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-06-20 20:00:23,374 INFO  L231             Difference]: Finished difference. Result has 323 places, 402 transitions, 5548 flow
[2024-06-20 20:00:23,375 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5404, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5548, PETRI_PLACES=323, PETRI_TRANSITIONS=402}
[2024-06-20 20:00:23,375 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 282 predicate places.
[2024-06-20 20:00:23,375 INFO  L495      AbstractCegarLoop]: Abstraction has has 323 places, 402 transitions, 5548 flow
[2024-06-20 20:00:23,375 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-20 20:00:23,375 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:23,375 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:23,375 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87
[2024-06-20 20:00:23,376 INFO  L420      AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:23,376 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:23,376 INFO  L85        PathProgramCache]: Analyzing trace with hash 144342257, now seen corresponding path program 3 times
[2024-06-20 20:00:23,376 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:23,376 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161383946]
[2024-06-20 20:00:23,376 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:23,376 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:23,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:31,296 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:31,296 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:31,296 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161383946]
[2024-06-20 20:00:31,297 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161383946] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:31,297 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:31,297 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:31,297 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180206108]
[2024-06-20 20:00:31,297 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:31,297 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:31,297 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:31,297 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:31,297 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:31,385 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:31,385 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 402 transitions, 5548 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-20 20:00:31,386 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:31,386 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:31,386 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:33,452 INFO  L124   PetriNetUnfolderBase]: 4082/6305 cut-off events.
[2024-06-20 20:00:33,452 INFO  L125   PetriNetUnfolderBase]: For 574554/574554 co-relation queries the response was YES.
[2024-06-20 20:00:33,504 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51565 conditions, 6305 events. 4082/6305 cut-off events. For 574554/574554 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 36253 event pairs, 872 based on Foata normal form. 1/6304 useless extension candidates. Maximal degree in co-relation 51411. Up to 6244 conditions per place. 
[2024-06-20 20:00:33,524 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 393 selfloop transitions, 25 changer transitions 0/421 dead transitions.
[2024-06-20 20:00:33,524 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 421 transitions, 6442 flow
[2024-06-20 20:00:33,525 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:00:33,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:00:33,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions.
[2024-06-20 20:00:33,526 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3964285714285714
[2024-06-20 20:00:33,526 INFO  L175             Difference]: Start difference. First operand has 323 places, 402 transitions, 5548 flow. Second operand 7 states and 111 transitions.
[2024-06-20 20:00:33,526 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 421 transitions, 6442 flow
[2024-06-20 20:00:34,769 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 421 transitions, 6295 flow, removed 43 selfloop flow, removed 5 redundant places.
[2024-06-20 20:00:34,774 INFO  L231             Difference]: Finished difference. Result has 325 places, 402 transitions, 5461 flow
[2024-06-20 20:00:34,774 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5401, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5461, PETRI_PLACES=325, PETRI_TRANSITIONS=402}
[2024-06-20 20:00:34,774 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 284 predicate places.
[2024-06-20 20:00:34,774 INFO  L495      AbstractCegarLoop]: Abstraction has has 325 places, 402 transitions, 5461 flow
[2024-06-20 20:00:34,775 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-20 20:00:34,775 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:34,775 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:34,775 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88
[2024-06-20 20:00:34,775 INFO  L420      AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:34,775 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:34,775 INFO  L85        PathProgramCache]: Analyzing trace with hash 151699642, now seen corresponding path program 6 times
[2024-06-20 20:00:34,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:34,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294508422]
[2024-06-20 20:00:34,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:34,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:34,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:42,919 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:42,920 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:42,920 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294508422]
[2024-06-20 20:00:42,920 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294508422] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:42,920 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:42,920 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:42,920 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462299486]
[2024-06-20 20:00:42,920 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:42,920 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:42,920 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:42,920 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:42,920 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:43,012 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 20:00:43,013 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 402 transitions, 5461 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-20 20:00:43,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:43,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 20:00:43,013 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:45,082 INFO  L124   PetriNetUnfolderBase]: 4086/6309 cut-off events.
[2024-06-20 20:00:45,082 INFO  L125   PetriNetUnfolderBase]: For 577123/577156 co-relation queries the response was YES.
[2024-06-20 20:00:45,136 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51346 conditions, 6309 events. 4086/6309 cut-off events. For 577123/577156 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 36232 event pairs, 846 based on Foata normal form. 26/6329 useless extension candidates. Maximal degree in co-relation 51192. Up to 6219 conditions per place. 
[2024-06-20 20:00:45,157 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 389 selfloop transitions, 28 changer transitions 0/420 dead transitions.
[2024-06-20 20:00:45,157 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 420 transitions, 6463 flow
[2024-06-20 20:00:45,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:00:45,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:00:45,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions.
[2024-06-20 20:00:45,158 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37857142857142856
[2024-06-20 20:00:45,158 INFO  L175             Difference]: Start difference. First operand has 325 places, 402 transitions, 5461 flow. Second operand 7 states and 106 transitions.
[2024-06-20 20:00:45,158 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 420 transitions, 6463 flow
Killed by 15