./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version cde23df1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m
[2024-06-14 16:00:59,896 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 16:00:59,931 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 16:00:59,935 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 16:00:59,935 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 16:00:59,953 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 16:00:59,955 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 16:00:59,955 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 16:00:59,956 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 16:00:59,959 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 16:00:59,959 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 16:00:59,960 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 16:00:59,960 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 16:00:59,962 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 16:00:59,962 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 16:00:59,962 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 16:00:59,962 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 16:00:59,963 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 16:00:59,963 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 16:00:59,963 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 16:00:59,963 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 16:00:59,964 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 16:00:59,964 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 16:00:59,964 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 16:00:59,964 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 16:00:59,965 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 16:00:59,965 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 16:00:59,966 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 16:00:59,966 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 16:00:59,966 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 16:00:59,967 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 16:00:59,967 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 16:00:59,967 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 16:00:59,968 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 16:00:59,968 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 16:00:59,968 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 16:00:59,968 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 16:00:59,969 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 16:00:59,969 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 16:00:59,969 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 16:00:59,969 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 16:00:59,969 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 16:00:59,970 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 16:00:59,970 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-14 16:01:00,194 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 16:01:00,216 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 16:01:00,218 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 16:01:00,219 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 16:01:00,219 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 16:01:00,220 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-14 16:01:01,227 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 16:01:01,398 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 16:01:01,398 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-14 16:01:01,423 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4613d2c6c/ce4f03e63bba4008906543db75237525/FLAG136709e9b
[2024-06-14 16:01:01,433 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4613d2c6c/ce4f03e63bba4008906543db75237525
[2024-06-14 16:01:01,435 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 16:01:01,435 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 16:01:01,437 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-14 16:01:01,635 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 16:01:01,638 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 16:01:01,639 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 16:01:01,639 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 16:01:01,642 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 16:01:01,643 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:01:01" (1/2) ...
[2024-06-14 16:01:01,644 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640e02da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:01:01, skipping insertion in model container
[2024-06-14 16:01:01,644 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:01:01" (1/2) ...
[2024-06-14 16:01:01,645 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@ff0af4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:01:01, skipping insertion in model container
[2024-06-14 16:01:01,645 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:01:01" (2/2) ...
[2024-06-14 16:01:01,646 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640e02da and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:01, skipping insertion in model container
[2024-06-14 16:01:01,646 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:01:01" (2/2) ...
[2024-06-14 16:01:01,646 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 16:01:01,722 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 16:01:01,723 INFO  L97    edCorrectnessWitness]: Location invariant before [L836-L836] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (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_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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 )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-14 16:01:01,724 INFO  L97    edCorrectnessWitness]: Location invariant before [L839-L839] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (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_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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 )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-14 16:01:01,724 INFO  L97    edCorrectnessWitness]: Location invariant before [L838-L838] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (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_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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 )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-14 16:01:01,725 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 16:01:01,725 INFO  L106   edCorrectnessWitness]: ghost_update [L834-L834] multithreaded = 1;
[2024-06-14 16:01:01,769 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 16:01:02,079 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 16:01:02,088 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 16:01:02,381 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 16:01:02,428 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 16:01:02,428 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02 WrapperNode
[2024-06-14 16:01:02,429 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 16:01:02,429 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 16:01:02,429 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 16:01:02,430 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 16:01:02,434 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (1/1) ...
[2024-06-14 16:01:02,458 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (1/1) ...
[2024-06-14 16:01:02,540 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126
[2024-06-14 16:01:02,540 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 16:01:02,541 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 16:01:02,541 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 16:01:02,541 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 16:01:02,550 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (1/1) ...
[2024-06-14 16:01:02,550 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (1/1) ...
[2024-06-14 16:01:02,580 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (1/1) ...
[2024-06-14 16:01:02,634 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-14 16:01:02,634 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (1/1) ...
[2024-06-14 16:01:02,634 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (1/1) ...
[2024-06-14 16:01:02,678 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (1/1) ...
[2024-06-14 16:01:02,680 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (1/1) ...
[2024-06-14 16:01:02,702 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (1/1) ...
[2024-06-14 16:01:02,708 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (1/1) ...
[2024-06-14 16:01:02,745 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 16:01:02,746 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 16:01:02,747 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 16:01:02,747 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 16:01:02,747 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (1/1) ...
[2024-06-14 16:01:02,751 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 16:01:02,758 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 16:01:02,771 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-14 16:01:02,773 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-14 16:01:02,802 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 16:01:02,803 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 16:01:02,803 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 16:01:02,803 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 16:01:02,803 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 16:01:02,804 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 16:01:02,804 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 16:01:02,804 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 16:01:02,804 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 16:01:02,804 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 16:01:02,804 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 16:01:02,805 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 16:01:02,806 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 16:01:02,938 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 16:01:02,939 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 16:01:04,197 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 16:01:04,198 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 16:01:04,467 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 16:01:04,467 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 16:01:04,467 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:01:04 BoogieIcfgContainer
[2024-06-14 16:01:04,467 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 16:01:04,470 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 16:01:04,470 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 16:01:04,473 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 16:01:04,473 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 04:01:01" (1/4) ...
[2024-06-14 16:01:04,474 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf4c23b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 04:01:04, skipping insertion in model container
[2024-06-14 16:01:04,474 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:01:01" (2/4) ...
[2024-06-14 16:01:04,474 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf4c23b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 04:01:04, skipping insertion in model container
[2024-06-14 16:01:04,474 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:01:02" (3/4) ...
[2024-06-14 16:01:04,474 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf4c23b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 04:01:04, skipping insertion in model container
[2024-06-14 16:01:04,475 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:01:04" (4/4) ...
[2024-06-14 16:01:04,476 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-14 16:01:04,489 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 16:01:04,490 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 16:01:04,490 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 16:01:04,620 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 16:01:04,650 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-14 16:01:04,790 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-14 16:01:04,790 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 16:01:04,793 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 16:01:04,793 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-14 16:01:04,795 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-14 16:01:04,801 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 16:01:04,841 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;@5897a7db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 16:01:04,841 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 16:01:04,848 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 16:01:04,849 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 16:01:04,849 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 16:01:04,849 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:04,850 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:04,850 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:04,855 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:04,855 INFO  L85        PathProgramCache]: Analyzing trace with hash -1623706950, now seen corresponding path program 1 times
[2024-06-14 16:01:04,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:04,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870644135]
[2024-06-14 16:01:04,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:04,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:05,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:11,250 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:11,251 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:11,251 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870644135]
[2024-06-14 16:01:11,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870644135] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:11,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:11,252 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 16:01:11,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267220300]
[2024-06-14 16:01:11,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:11,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 16:01:11,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:11,282 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 16:01:11,283 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 16:01:11,347 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-14 16:01:11,349 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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-14 16:01:11,349 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:11,349 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-14 16:01:11,350 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:12,115 INFO  L124   PetriNetUnfolderBase]: 942/1466 cut-off events.
[2024-06-14 16:01:12,116 INFO  L125   PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES.
[2024-06-14 16:01:12,120 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2984 conditions, 1466 events. 942/1466 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7280 event pairs, 546 based on Foata normal form. 2/1428 useless extension candidates. Maximal degree in co-relation 2969. Up to 1428 conditions per place. 
[2024-06-14 16:01:12,127 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/44 dead transitions.
[2024-06-14 16:01:12,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 177 flow
[2024-06-14 16:01:12,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 16:01:12,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 16:01:12,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions.
[2024-06-14 16:01:12,136 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.626984126984127
[2024-06-14 16:01:12,137 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 79 transitions.
[2024-06-14 16:01:12,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 177 flow
[2024-06-14 16:01:12,140 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 16:01:12,141 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-14 16:01:12,143 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-14 16:01:12,145 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-14 16:01:12,145 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-14 16:01:12,145 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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-14 16:01:12,145 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:12,146 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:12,146 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 16:01:12,146 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:12,146 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:12,146 INFO  L85        PathProgramCache]: Analyzing trace with hash -1309217895, now seen corresponding path program 1 times
[2024-06-14 16:01:12,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:12,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858520663]
[2024-06-14 16:01:12,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:12,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:12,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:16,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:16,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:16,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858520663]
[2024-06-14 16:01:16,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858520663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:16,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:16,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 16:01:16,646 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497164024]
[2024-06-14 16:01:16,646 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:16,647 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 16:01:16,648 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:16,648 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 16:01:16,648 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-14 16:01:16,765 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-14 16:01:16,765 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:16,765 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:16,765 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-14 16:01:16,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:17,497 INFO  L124   PetriNetUnfolderBase]: 1140/1745 cut-off events.
[2024-06-14 16:01:17,498 INFO  L125   PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES.
[2024-06-14 16:01:17,500 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4038 conditions, 1745 events. 1140/1745 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8418 event pairs, 658 based on Foata normal form. 3/1746 useless extension candidates. Maximal degree in co-relation 4023. Up to 1700 conditions per place. 
[2024-06-14 16:01:17,505 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 43 selfloop transitions, 7 changer transitions 0/56 dead transitions.
[2024-06-14 16:01:17,505 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 258 flow
[2024-06-14 16:01:17,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 16:01:17,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 16:01:17,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions.
[2024-06-14 16:01:17,507 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2024-06-14 16:01:17,507 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 98 transitions.
[2024-06-14 16:01:17,507 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 258 flow
[2024-06-14 16:01:17,508 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 16:01:17,508 INFO  L231             Difference]: Finished difference. Result has 47 places, 42 transitions, 154 flow
[2024-06-14 16:01:17,509 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=42}
[2024-06-14 16:01:17,509 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places.
[2024-06-14 16:01:17,509 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 154 flow
[2024-06-14 16:01:17,509 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:17,509 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:17,510 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:17,510 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 16:01:17,510 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:17,510 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:17,510 INFO  L85        PathProgramCache]: Analyzing trace with hash 267055224, now seen corresponding path program 1 times
[2024-06-14 16:01:17,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:17,511 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251405449]
[2024-06-14 16:01:17,511 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:17,511 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:17,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:23,229 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:23,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:23,229 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251405449]
[2024-06-14 16:01:23,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251405449] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:23,230 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:23,230 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 16:01:23,230 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779291188]
[2024-06-14 16:01:23,230 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:23,231 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 16:01:23,231 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:23,231 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 16:01:23,232 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-14 16:01:23,359 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-14 16:01:23,360 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 154 flow. Second operand  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:23,360 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:23,360 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-14 16:01:23,360 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:24,243 INFO  L124   PetriNetUnfolderBase]: 1134/1736 cut-off events.
[2024-06-14 16:01:24,243 INFO  L125   PetriNetUnfolderBase]: For 903/911 co-relation queries the response was YES.
[2024-06-14 16:01:24,246 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4500 conditions, 1736 events. 1134/1736 cut-off events. For 903/911 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8378 event pairs, 533 based on Foata normal form. 9/1743 useless extension candidates. Maximal degree in co-relation 4482. Up to 1676 conditions per place. 
[2024-06-14 16:01:24,252 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 50 selfloop transitions, 10 changer transitions 0/66 dead transitions.
[2024-06-14 16:01:24,252 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 340 flow
[2024-06-14 16:01:24,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 16:01:24,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 16:01:24,255 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions.
[2024-06-14 16:01:24,255 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-06-14 16:01:24,255 INFO  L175             Difference]: Start difference. First operand has 47 places, 42 transitions, 154 flow. Second operand 5 states and 120 transitions.
[2024-06-14 16:01:24,255 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 340 flow
[2024-06-14 16:01:24,257 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 338 flow, removed 1 selfloop flow, removed 0 redundant places.
[2024-06-14 16:01:24,257 INFO  L231             Difference]: Finished difference. Result has 52 places, 45 transitions, 200 flow
[2024-06-14 16:01:24,258 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=52, PETRI_TRANSITIONS=45}
[2024-06-14 16:01:24,258 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2024-06-14 16:01:24,258 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 200 flow
[2024-06-14 16:01:24,258 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:24,258 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:24,259 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:24,259 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 16:01:24,259 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:24,259 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:24,259 INFO  L85        PathProgramCache]: Analyzing trace with hash -894743445, now seen corresponding path program 1 times
[2024-06-14 16:01:24,259 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:24,259 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445420636]
[2024-06-14 16:01:24,259 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:24,260 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:24,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:32,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:32,842 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:32,842 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445420636]
[2024-06-14 16:01:32,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445420636] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:32,842 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:32,842 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 16:01:32,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074451319]
[2024-06-14 16:01:32,843 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:32,843 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 16:01:32,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:32,843 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 16:01:32,843 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-14 16:01:33,007 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-14 16:01:33,007 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 200 flow. Second operand  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:33,008 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:33,008 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-14 16:01:33,008 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:33,765 INFO  L124   PetriNetUnfolderBase]: 1038/1612 cut-off events.
[2024-06-14 16:01:33,766 INFO  L125   PetriNetUnfolderBase]: For 1709/1709 co-relation queries the response was YES.
[2024-06-14 16:01:33,769 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4584 conditions, 1612 events. 1038/1612 cut-off events. For 1709/1709 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7825 event pairs, 474 based on Foata normal form. 4/1562 useless extension candidates. Maximal degree in co-relation 4563. Up to 1525 conditions per place. 
[2024-06-14 16:01:33,776 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 42 selfloop transitions, 12 changer transitions 0/64 dead transitions.
[2024-06-14 16:01:33,776 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 372 flow
[2024-06-14 16:01:33,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:01:33,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:01:33,779 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions.
[2024-06-14 16:01:33,781 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4722222222222222
[2024-06-14 16:01:33,781 INFO  L175             Difference]: Start difference. First operand has 52 places, 45 transitions, 200 flow. Second operand 6 states and 119 transitions.
[2024-06-14 16:01:33,781 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 372 flow
[2024-06-14 16:01:33,785 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 348 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-14 16:01:33,787 INFO  L231             Difference]: Finished difference. Result has 57 places, 53 transitions, 268 flow
[2024-06-14 16:01:33,787 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=57, PETRI_TRANSITIONS=53}
[2024-06-14 16:01:33,788 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-14 16:01:33,788 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 268 flow
[2024-06-14 16:01:33,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:33,789 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:33,789 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:33,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 16:01:33,789 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:33,790 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:33,790 INFO  L85        PathProgramCache]: Analyzing trace with hash -1057930921, now seen corresponding path program 1 times
[2024-06-14 16:01:33,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:33,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910605484]
[2024-06-14 16:01:33,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:33,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:33,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:38,754 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:38,754 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:38,755 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910605484]
[2024-06-14 16:01:38,756 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910605484] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:38,756 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:38,756 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 16:01:38,756 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477229697]
[2024-06-14 16:01:38,756 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:38,757 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 16:01:38,757 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:38,758 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 16:01:38,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-14 16:01:38,883 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-14 16:01:38,883 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 268 flow. Second operand  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:38,883 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:38,883 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-14 16:01:38,883 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:39,855 INFO  L124   PetriNetUnfolderBase]: 1122/1717 cut-off events.
[2024-06-14 16:01:39,856 INFO  L125   PetriNetUnfolderBase]: For 2416/2424 co-relation queries the response was YES.
[2024-06-14 16:01:39,860 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5463 conditions, 1717 events. 1122/1717 cut-off events. For 2416/2424 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8116 event pairs, 380 based on Foata normal form. 12/1727 useless extension candidates. Maximal degree in co-relation 5438. Up to 1627 conditions per place. 
[2024-06-14 16:01:39,866 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 60 selfloop transitions, 13 changer transitions 0/79 dead transitions.
[2024-06-14 16:01:39,866 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 488 flow
[2024-06-14 16:01:39,868 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:01:39,869 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:01:39,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions.
[2024-06-14 16:01:39,870 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5476190476190477
[2024-06-14 16:01:39,870 INFO  L175             Difference]: Start difference. First operand has 57 places, 53 transitions, 268 flow. Second operand 6 states and 138 transitions.
[2024-06-14 16:01:39,870 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 488 flow
[2024-06-14 16:01:39,874 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 474 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-14 16:01:39,877 INFO  L231             Difference]: Finished difference. Result has 60 places, 54 transitions, 297 flow
[2024-06-14 16:01:39,877 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=60, PETRI_TRANSITIONS=54}
[2024-06-14 16:01:39,880 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places.
[2024-06-14 16:01:39,880 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 297 flow
[2024-06-14 16:01:39,881 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:39,885 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:39,885 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:39,885 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 16:01:39,885 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:39,886 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:39,886 INFO  L85        PathProgramCache]: Analyzing trace with hash -1967242322, now seen corresponding path program 1 times
[2024-06-14 16:01:39,886 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:39,886 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485510024]
[2024-06-14 16:01:39,886 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:39,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:39,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:49,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:49,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:49,338 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485510024]
[2024-06-14 16:01:49,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485510024] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:49,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:49,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:01:49,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114597405]
[2024-06-14 16:01:49,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:49,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:01:49,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:49,340 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:01:49,340 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:01:49,425 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:01:49,425 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 297 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:49,425 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:49,425 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:01:49,425 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:01:50,342 INFO  L124   PetriNetUnfolderBase]: 1229/1899 cut-off events.
[2024-06-14 16:01:50,342 INFO  L125   PetriNetUnfolderBase]: For 4097/4113 co-relation queries the response was YES.
[2024-06-14 16:01:50,346 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6279 conditions, 1899 events. 1229/1899 cut-off events. For 4097/4113 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9301 event pairs, 529 based on Foata normal form. 2/1876 useless extension candidates. Maximal degree in co-relation 6253. Up to 1790 conditions per place. 
[2024-06-14 16:01:50,353 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 55 selfloop transitions, 12 changer transitions 0/77 dead transitions.
[2024-06-14 16:01:50,354 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 514 flow
[2024-06-14 16:01:50,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:01:50,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:01:50,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions.
[2024-06-14 16:01:50,355 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46825396825396826
[2024-06-14 16:01:50,355 INFO  L175             Difference]: Start difference. First operand has 60 places, 54 transitions, 297 flow. Second operand 6 states and 118 transitions.
[2024-06-14 16:01:50,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 514 flow
[2024-06-14 16:01:50,357 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 477 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-14 16:01:50,358 INFO  L231             Difference]: Finished difference. Result has 64 places, 63 transitions, 362 flow
[2024-06-14 16:01:50,358 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=64, PETRI_TRANSITIONS=63}
[2024-06-14 16:01:50,358 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places.
[2024-06-14 16:01:50,359 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 362 flow
[2024-06-14 16:01:50,359 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:50,359 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:01:50,359 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:01:50,359 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 16:01:50,359 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:01:50,360 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:01:50,360 INFO  L85        PathProgramCache]: Analyzing trace with hash -855215188, now seen corresponding path program 1 times
[2024-06-14 16:01:50,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:01:50,360 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119959668]
[2024-06-14 16:01:50,360 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:01:50,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:01:50,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:01:59,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:01:59,277 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:01:59,277 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119959668]
[2024-06-14 16:01:59,277 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119959668] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:01:59,277 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:01:59,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:01:59,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068628883]
[2024-06-14 16:01:59,278 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:01:59,278 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:01:59,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:01:59,279 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:01:59,279 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:01:59,382 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:01:59,383 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 362 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:01:59,383 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:01:59,383 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:01:59,383 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:00,300 INFO  L124   PetriNetUnfolderBase]: 1263/1942 cut-off events.
[2024-06-14 16:02:00,300 INFO  L125   PetriNetUnfolderBase]: For 5088/5114 co-relation queries the response was YES.
[2024-06-14 16:02:00,304 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6917 conditions, 1942 events. 1263/1942 cut-off events. For 5088/5114 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9367 event pairs, 500 based on Foata normal form. 16/1950 useless extension candidates. Maximal degree in co-relation 6887. Up to 1853 conditions per place. 
[2024-06-14 16:02:00,311 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 61 selfloop transitions, 14 changer transitions 0/84 dead transitions.
[2024-06-14 16:02:00,312 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 578 flow
[2024-06-14 16:02:00,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:02:00,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:02:00,312 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-14 16:02:00,313 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-14 16:02:00,313 INFO  L175             Difference]: Start difference. First operand has 64 places, 63 transitions, 362 flow. Second operand 6 states and 122 transitions.
[2024-06-14 16:02:00,313 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 578 flow
[2024-06-14 16:02:00,315 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 572 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-06-14 16:02:00,317 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 414 flow
[2024-06-14 16:02:00,317 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2024-06-14 16:02:00,317 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-14 16:02:00,317 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 414 flow
[2024-06-14 16:02:00,318 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:00,318 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:00,318 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:00,318 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 16:02:00,318 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:00,318 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:00,319 INFO  L85        PathProgramCache]: Analyzing trace with hash 603720696, now seen corresponding path program 2 times
[2024-06-14 16:02:00,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:00,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982600285]
[2024-06-14 16:02:00,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:00,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:00,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:08,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:08,764 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:08,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982600285]
[2024-06-14 16:02:08,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982600285] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:08,765 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:08,765 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:02:08,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449746733]
[2024-06-14 16:02:08,765 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:08,765 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:02:08,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:08,766 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:02:08,766 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:02:08,897 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:02:08,898 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 414 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:08,898 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:08,898 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:02:08,898 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:09,725 INFO  L124   PetriNetUnfolderBase]: 1293/1989 cut-off events.
[2024-06-14 16:02:09,726 INFO  L125   PetriNetUnfolderBase]: For 6899/6926 co-relation queries the response was YES.
[2024-06-14 16:02:09,731 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7687 conditions, 1989 events. 1293/1989 cut-off events. For 6899/6926 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9738 event pairs, 498 based on Foata normal form. 13/1990 useless extension candidates. Maximal degree in co-relation 7654. Up to 1865 conditions per place. 
[2024-06-14 16:02:09,739 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 61 selfloop transitions, 19 changer transitions 0/89 dead transitions.
[2024-06-14 16:02:09,739 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 666 flow
[2024-06-14 16:02:09,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:02:09,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:02:09,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-14 16:02:09,749 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-14 16:02:09,750 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 414 flow. Second operand 6 states and 122 transitions.
[2024-06-14 16:02:09,750 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 666 flow
[2024-06-14 16:02:09,754 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 632 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-14 16:02:09,757 INFO  L231             Difference]: Finished difference. Result has 72 places, 72 transitions, 492 flow
[2024-06-14 16:02:09,757 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=492, PETRI_PLACES=72, PETRI_TRANSITIONS=72}
[2024-06-14 16:02:09,759 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places.
[2024-06-14 16:02:09,759 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 492 flow
[2024-06-14 16:02:09,759 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:09,760 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:09,760 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:09,760 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 16:02:09,760 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:09,760 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:09,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -854969110, now seen corresponding path program 1 times
[2024-06-14 16:02:09,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:09,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748352038]
[2024-06-14 16:02:09,761 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:09,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:09,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:19,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:19,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:19,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748352038]
[2024-06-14 16:02:19,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748352038] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:19,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:19,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:02:19,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799654496]
[2024-06-14 16:02:19,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:19,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:02:19,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:19,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:02:19,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:02:20,004 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:02:20,005 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 492 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:20,005 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:20,005 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:02:20,005 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:20,873 INFO  L124   PetriNetUnfolderBase]: 1265/1960 cut-off events.
[2024-06-14 16:02:20,873 INFO  L125   PetriNetUnfolderBase]: For 8851/8893 co-relation queries the response was YES.
[2024-06-14 16:02:20,878 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7905 conditions, 1960 events. 1265/1960 cut-off events. For 8851/8893 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9679 event pairs, 504 based on Foata normal form. 2/1932 useless extension candidates. Maximal degree in co-relation 7870. Up to 1824 conditions per place. 
[2024-06-14 16:02:20,885 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 65 selfloop transitions, 15 changer transitions 0/93 dead transitions.
[2024-06-14 16:02:20,886 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 93 transitions, 712 flow
[2024-06-14 16:02:20,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:02:20,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:02:20,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-14 16:02:20,889 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46258503401360546
[2024-06-14 16:02:20,890 INFO  L175             Difference]: Start difference. First operand has 72 places, 72 transitions, 492 flow. Second operand 7 states and 136 transitions.
[2024-06-14 16:02:20,890 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 93 transitions, 712 flow
[2024-06-14 16:02:20,896 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 93 transitions, 668 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-14 16:02:20,897 INFO  L231             Difference]: Finished difference. Result has 76 places, 75 transitions, 506 flow
[2024-06-14 16:02:20,897 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=506, PETRI_PLACES=76, PETRI_TRANSITIONS=75}
[2024-06-14 16:02:20,898 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places.
[2024-06-14 16:02:20,898 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 506 flow
[2024-06-14 16:02:20,898 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:20,898 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:20,898 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:20,898 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 16:02:20,899 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:20,899 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:20,899 INFO  L85        PathProgramCache]: Analyzing trace with hash -658749465, now seen corresponding path program 1 times
[2024-06-14 16:02:20,899 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:20,899 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907688393]
[2024-06-14 16:02:20,899 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:20,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:20,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:31,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:31,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:31,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907688393]
[2024-06-14 16:02:31,069 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907688393] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:31,069 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:31,069 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:02:31,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286293974]
[2024-06-14 16:02:31,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:31,069 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:02:31,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:31,070 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:02:31,070 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:02:31,176 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:02:31,177 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 506 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:31,177 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:31,177 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:02:31,177 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:32,111 INFO  L124   PetriNetUnfolderBase]: 1364/2086 cut-off events.
[2024-06-14 16:02:32,111 INFO  L125   PetriNetUnfolderBase]: For 9718/9718 co-relation queries the response was YES.
[2024-06-14 16:02:32,117 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8716 conditions, 2086 events. 1364/2086 cut-off events. For 9718/9718 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9993 event pairs, 518 based on Foata normal form. 4/2088 useless extension candidates. Maximal degree in co-relation 8680. Up to 1981 conditions per place. 
[2024-06-14 16:02:32,124 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 87 selfloop transitions, 15 changer transitions 0/107 dead transitions.
[2024-06-14 16:02:32,125 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 107 transitions, 833 flow
[2024-06-14 16:02:32,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:02:32,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:02:32,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-14 16:02:32,127 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45918367346938777
[2024-06-14 16:02:32,128 INFO  L175             Difference]: Start difference. First operand has 76 places, 75 transitions, 506 flow. Second operand 7 states and 135 transitions.
[2024-06-14 16:02:32,128 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 107 transitions, 833 flow
[2024-06-14 16:02:32,132 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 107 transitions, 799 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-14 16:02:32,134 INFO  L231             Difference]: Finished difference. Result has 80 places, 84 transitions, 592 flow
[2024-06-14 16:02:32,134 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=592, PETRI_PLACES=80, PETRI_TRANSITIONS=84}
[2024-06-14 16:02:32,135 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places.
[2024-06-14 16:02:32,138 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 592 flow
[2024-06-14 16:02:32,138 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:32,138 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:32,138 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:32,139 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 16:02:32,139 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:32,140 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:32,140 INFO  L85        PathProgramCache]: Analyzing trace with hash -734247795, now seen corresponding path program 2 times
[2024-06-14 16:02:32,140 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:32,140 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280048655]
[2024-06-14 16:02:32,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:32,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:32,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:42,325 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:42,325 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:42,325 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280048655]
[2024-06-14 16:02:42,325 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280048655] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:42,325 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:42,325 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:02:42,325 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888531534]
[2024-06-14 16:02:42,325 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:42,326 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:02:42,326 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:42,326 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:02:42,326 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:02:42,482 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:02:42,482 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 592 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:42,482 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:42,482 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:02:42,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:43,449 INFO  L124   PetriNetUnfolderBase]: 1402/2142 cut-off events.
[2024-06-14 16:02:43,450 INFO  L125   PetriNetUnfolderBase]: For 12377/12377 co-relation queries the response was YES.
[2024-06-14 16:02:43,455 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9512 conditions, 2142 events. 1402/2142 cut-off events. For 12377/12377 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10357 event pairs, 522 based on Foata normal form. 4/2141 useless extension candidates. Maximal degree in co-relation 9473. Up to 1953 conditions per place. 
[2024-06-14 16:02:43,462 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 85 selfloop transitions, 27 changer transitions 0/117 dead transitions.
[2024-06-14 16:02:43,462 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 988 flow
[2024-06-14 16:02:43,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:02:43,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:02:43,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-14 16:02:43,465 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46938775510204084
[2024-06-14 16:02:43,465 INFO  L175             Difference]: Start difference. First operand has 80 places, 84 transitions, 592 flow. Second operand 7 states and 138 transitions.
[2024-06-14 16:02:43,465 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 988 flow
[2024-06-14 16:02:43,471 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 961 flow, removed 10 selfloop flow, removed 2 redundant places.
[2024-06-14 16:02:43,473 INFO  L231             Difference]: Finished difference. Result has 86 places, 93 transitions, 713 flow
[2024-06-14 16:02:43,473 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=713, PETRI_PLACES=86, PETRI_TRANSITIONS=93}
[2024-06-14 16:02:43,473 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places.
[2024-06-14 16:02:43,473 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 93 transitions, 713 flow
[2024-06-14 16:02:43,474 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:43,474 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:43,474 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:43,474 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 16:02:43,474 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:43,474 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:43,475 INFO  L85        PathProgramCache]: Analyzing trace with hash -734514705, now seen corresponding path program 3 times
[2024-06-14 16:02:43,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:43,475 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826423278]
[2024-06-14 16:02:43,475 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:43,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:43,507 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:02:52,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:02:52,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:02:52,931 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826423278]
[2024-06-14 16:02:52,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826423278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:02:52,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:02:52,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:02:52,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644110642]
[2024-06-14 16:02:52,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:02:52,931 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:02:52,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:02:52,932 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:02:52,932 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:02:53,091 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:02:53,091 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 93 transitions, 713 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:53,091 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:02:53,092 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:02:53,092 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:02:54,041 INFO  L124   PetriNetUnfolderBase]: 1392/2133 cut-off events.
[2024-06-14 16:02:54,041 INFO  L125   PetriNetUnfolderBase]: For 15028/15028 co-relation queries the response was YES.
[2024-06-14 16:02:54,047 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10053 conditions, 2133 events. 1392/2133 cut-off events. For 15028/15028 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10382 event pairs, 527 based on Foata normal form. 4/2133 useless extension candidates. Maximal degree in co-relation 10011. Up to 1945 conditions per place. 
[2024-06-14 16:02:54,055 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 84 selfloop transitions, 26 changer transitions 0/115 dead transitions.
[2024-06-14 16:02:54,055 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 115 transitions, 995 flow
[2024-06-14 16:02:54,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:02:54,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:02:54,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-14 16:02:54,058 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-14 16:02:54,058 INFO  L175             Difference]: Start difference. First operand has 86 places, 93 transitions, 713 flow. Second operand 7 states and 137 transitions.
[2024-06-14 16:02:54,058 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 115 transitions, 995 flow
[2024-06-14 16:02:54,069 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 115 transitions, 955 flow, removed 16 selfloop flow, removed 2 redundant places.
[2024-06-14 16:02:54,071 INFO  L231             Difference]: Finished difference. Result has 91 places, 93 transitions, 733 flow
[2024-06-14 16:02:54,071 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=733, PETRI_PLACES=91, PETRI_TRANSITIONS=93}
[2024-06-14 16:02:54,071 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places.
[2024-06-14 16:02:54,071 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 733 flow
[2024-06-14 16:02:54,072 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:02:54,072 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:02:54,072 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:02:54,072 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 16:02:54,072 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:02:54,072 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:02:54,073 INFO  L85        PathProgramCache]: Analyzing trace with hash -733048583, now seen corresponding path program 1 times
[2024-06-14 16:02:54,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:02:54,073 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768094852]
[2024-06-14 16:02:54,073 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:02:54,073 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:02:54,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:04,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:04,540 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:04,540 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768094852]
[2024-06-14 16:03:04,540 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768094852] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:04,540 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:04,540 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:03:04,540 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133108813]
[2024-06-14 16:03:04,540 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:04,541 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:03:04,541 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:04,541 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:03:04,541 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:03:04,829 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:03:04,830 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 733 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:04,830 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:04,830 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:03:04,830 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:05,751 INFO  L124   PetriNetUnfolderBase]: 1298/2035 cut-off events.
[2024-06-14 16:03:05,751 INFO  L125   PetriNetUnfolderBase]: For 16832/16832 co-relation queries the response was YES.
[2024-06-14 16:03:05,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9737 conditions, 2035 events. 1298/2035 cut-off events. For 16832/16832 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10077 event pairs, 476 based on Foata normal form. 4/2023 useless extension candidates. Maximal degree in co-relation 9693. Up to 1850 conditions per place. 
[2024-06-14 16:03:05,764 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 88 selfloop transitions, 17 changer transitions 0/118 dead transitions.
[2024-06-14 16:03:05,764 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 118 transitions, 1017 flow
[2024-06-14 16:03:05,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:03:05,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:03:05,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-14 16:03:05,774 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-14 16:03:05,774 INFO  L175             Difference]: Start difference. First operand has 91 places, 93 transitions, 733 flow. Second operand 8 states and 154 transitions.
[2024-06-14 16:03:05,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 118 transitions, 1017 flow
[2024-06-14 16:03:05,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 118 transitions, 932 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-14 16:03:05,786 INFO  L231             Difference]: Finished difference. Result has 92 places, 95 transitions, 709 flow
[2024-06-14 16:03:05,786 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=709, PETRI_PLACES=92, PETRI_TRANSITIONS=95}
[2024-06-14 16:03:05,786 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places.
[2024-06-14 16:03:05,786 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 95 transitions, 709 flow
[2024-06-14 16:03:05,787 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:05,787 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:05,787 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:05,787 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 16:03:05,787 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:05,787 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:05,788 INFO  L85        PathProgramCache]: Analyzing trace with hash 920658813, now seen corresponding path program 1 times
[2024-06-14 16:03:05,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:05,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190420127]
[2024-06-14 16:03:05,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:05,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:05,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:14,672 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:14,672 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:14,673 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190420127]
[2024-06-14 16:03:14,673 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190420127] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:14,673 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:14,673 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:03:14,673 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362021831]
[2024-06-14 16:03:14,673 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:14,673 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:03:14,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:14,674 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:03:14,674 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:03:14,909 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:03:14,909 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 95 transitions, 709 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:14,909 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:14,909 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:03:14,909 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:15,985 INFO  L124   PetriNetUnfolderBase]: 1332/2061 cut-off events.
[2024-06-14 16:03:15,985 INFO  L125   PetriNetUnfolderBase]: For 19790/19830 co-relation queries the response was YES.
[2024-06-14 16:03:15,991 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10098 conditions, 2061 events. 1332/2061 cut-off events. For 19790/19830 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10136 event pairs, 466 based on Foata normal form. 21/2033 useless extension candidates. Maximal degree in co-relation 10055. Up to 1897 conditions per place. 
[2024-06-14 16:03:15,997 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 86 selfloop transitions, 19 changer transitions 0/122 dead transitions.
[2024-06-14 16:03:15,997 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 122 transitions, 1015 flow
[2024-06-14 16:03:15,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:03:15,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:03:16,000 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-14 16:03:16,000 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48299319727891155
[2024-06-14 16:03:16,000 INFO  L175             Difference]: Start difference. First operand has 92 places, 95 transitions, 709 flow. Second operand 7 states and 142 transitions.
[2024-06-14 16:03:16,000 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 122 transitions, 1015 flow
[2024-06-14 16:03:16,009 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 122 transitions, 972 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-14 16:03:16,011 INFO  L231             Difference]: Finished difference. Result has 93 places, 98 transitions, 748 flow
[2024-06-14 16:03:16,011 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=748, PETRI_PLACES=93, PETRI_TRANSITIONS=98}
[2024-06-14 16:03:16,013 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places.
[2024-06-14 16:03:16,013 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 98 transitions, 748 flow
[2024-06-14 16:03:16,013 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:16,013 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:16,013 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:16,013 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 16:03:16,014 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:16,014 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:16,014 INFO  L85        PathProgramCache]: Analyzing trace with hash -1486151745, now seen corresponding path program 1 times
[2024-06-14 16:03:16,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:16,014 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92809594]
[2024-06-14 16:03:16,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:16,014 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:16,072 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:29,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:29,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:29,572 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92809594]
[2024-06-14 16:03:29,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92809594] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:29,572 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:29,572 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:03:29,572 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802733334]
[2024-06-14 16:03:29,572 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:29,573 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:03:29,573 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:29,573 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:03:29,573 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:03:29,685 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:03:29,685 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 98 transitions, 748 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:29,685 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:29,685 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:03:29,685 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:30,777 INFO  L124   PetriNetUnfolderBase]: 1398/2141 cut-off events.
[2024-06-14 16:03:30,777 INFO  L125   PetriNetUnfolderBase]: For 21092/21092 co-relation queries the response was YES.
[2024-06-14 16:03:30,783 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10666 conditions, 2141 events. 1398/2141 cut-off events. For 21092/21092 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10301 event pairs, 484 based on Foata normal form. 4/2143 useless extension candidates. Maximal degree in co-relation 10622. Up to 2013 conditions per place. 
[2024-06-14 16:03:30,788 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 105 selfloop transitions, 19 changer transitions 0/129 dead transitions.
[2024-06-14 16:03:30,788 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 129 transitions, 1100 flow
[2024-06-14 16:03:30,790 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:03:30,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:03:30,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-14 16:03:30,792 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-14 16:03:30,793 INFO  L175             Difference]: Start difference. First operand has 93 places, 98 transitions, 748 flow. Second operand 8 states and 153 transitions.
[2024-06-14 16:03:30,793 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 129 transitions, 1100 flow
[2024-06-14 16:03:30,801 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 129 transitions, 1044 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-14 16:03:30,803 INFO  L231             Difference]: Finished difference. Result has 96 places, 102 transitions, 777 flow
[2024-06-14 16:03:30,803 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=777, PETRI_PLACES=96, PETRI_TRANSITIONS=102}
[2024-06-14 16:03:30,804 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places.
[2024-06-14 16:03:30,804 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 102 transitions, 777 flow
[2024-06-14 16:03:30,804 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:30,804 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:30,804 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:30,804 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 16:03:30,804 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:30,805 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:30,805 INFO  L85        PathProgramCache]: Analyzing trace with hash -1258250595, now seen corresponding path program 2 times
[2024-06-14 16:03:30,805 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:30,805 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971693674]
[2024-06-14 16:03:30,805 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:30,805 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:30,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:44,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:44,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:44,234 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971693674]
[2024-06-14 16:03:44,236 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971693674] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:44,236 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:44,236 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:03:44,236 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329433347]
[2024-06-14 16:03:44,236 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:44,236 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:03:44,237 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:44,237 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:03:44,237 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:03:44,357 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:03:44,357 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 102 transitions, 777 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:44,357 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:44,357 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:03:44,357 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:45,363 INFO  L124   PetriNetUnfolderBase]: 1420/2174 cut-off events.
[2024-06-14 16:03:45,363 INFO  L125   PetriNetUnfolderBase]: For 24489/24489 co-relation queries the response was YES.
[2024-06-14 16:03:45,369 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11391 conditions, 2174 events. 1420/2174 cut-off events. For 24489/24489 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10561 event pairs, 488 based on Foata normal form. 4/2174 useless extension candidates. Maximal degree in co-relation 11346. Up to 1968 conditions per place. 
[2024-06-14 16:03:45,375 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 97 selfloop transitions, 30 changer transitions 0/132 dead transitions.
[2024-06-14 16:03:45,375 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 132 transitions, 1147 flow
[2024-06-14 16:03:45,377 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:03:45,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:03:45,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-14 16:03:45,378 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-14 16:03:45,378 INFO  L175             Difference]: Start difference. First operand has 96 places, 102 transitions, 777 flow. Second operand 8 states and 155 transitions.
[2024-06-14 16:03:45,378 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 132 transitions, 1147 flow
[2024-06-14 16:03:45,388 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 132 transitions, 1092 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-14 16:03:45,390 INFO  L231             Difference]: Finished difference. Result has 98 places, 106 transitions, 837 flow
[2024-06-14 16:03:45,390 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=837, PETRI_PLACES=98, PETRI_TRANSITIONS=106}
[2024-06-14 16:03:45,390 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places.
[2024-06-14 16:03:45,391 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 106 transitions, 837 flow
[2024-06-14 16:03:45,391 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:45,391 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:45,391 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:45,391 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 16:03:45,391 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:45,392 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:45,392 INFO  L85        PathProgramCache]: Analyzing trace with hash -1249976385, now seen corresponding path program 3 times
[2024-06-14 16:03:45,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:45,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975819618]
[2024-06-14 16:03:45,392 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:45,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:03:45,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:03:58,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:03:58,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:03:58,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975819618]
[2024-06-14 16:03:58,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975819618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:03:58,743 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:03:58,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:03:58,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360247050]
[2024-06-14 16:03:58,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:03:58,744 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:03:58,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:03:58,744 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:03:58,744 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:03:58,938 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:03:58,939 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 106 transitions, 837 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:58,939 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:03:58,939 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:03:58,939 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:03:59,955 INFO  L124   PetriNetUnfolderBase]: 1442/2206 cut-off events.
[2024-06-14 16:03:59,955 INFO  L125   PetriNetUnfolderBase]: For 28340/28340 co-relation queries the response was YES.
[2024-06-14 16:03:59,962 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12181 conditions, 2206 events. 1442/2206 cut-off events. For 28340/28340 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10652 event pairs, 483 based on Foata normal form. 4/2206 useless extension candidates. Maximal degree in co-relation 12135. Up to 2000 conditions per place. 
[2024-06-14 16:03:59,970 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 100 selfloop transitions, 31 changer transitions 0/136 dead transitions.
[2024-06-14 16:03:59,970 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 136 transitions, 1229 flow
[2024-06-14 16:03:59,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:03:59,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:03:59,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-14 16:03:59,973 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-14 16:03:59,973 INFO  L175             Difference]: Start difference. First operand has 98 places, 106 transitions, 837 flow. Second operand 8 states and 154 transitions.
[2024-06-14 16:03:59,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 136 transitions, 1229 flow
[2024-06-14 16:03:59,986 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 136 transitions, 1144 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-14 16:03:59,988 INFO  L231             Difference]: Finished difference. Result has 100 places, 110 transitions, 877 flow
[2024-06-14 16:03:59,988 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=877, PETRI_PLACES=100, PETRI_TRANSITIONS=110}
[2024-06-14 16:03:59,988 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places.
[2024-06-14 16:03:59,988 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 110 transitions, 877 flow
[2024-06-14 16:03:59,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:03:59,989 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:03:59,989 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:03:59,989 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 16:03:59,989 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:03:59,989 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:03:59,989 INFO  L85        PathProgramCache]: Analyzing trace with hash -1249679715, now seen corresponding path program 4 times
[2024-06-14 16:03:59,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:03:59,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636240671]
[2024-06-14 16:03:59,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:03:59,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:00,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:10,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:10,255 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:10,255 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636240671]
[2024-06-14 16:04:10,255 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636240671] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:10,255 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:10,256 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:04:10,256 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759080699]
[2024-06-14 16:04:10,256 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:10,256 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:04:10,256 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:10,256 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:04:10,257 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:04:10,426 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:04:10,426 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 110 transitions, 877 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:10,426 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:10,426 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:04:10,426 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:11,489 INFO  L124   PetriNetUnfolderBase]: 1437/2204 cut-off events.
[2024-06-14 16:04:11,489 INFO  L125   PetriNetUnfolderBase]: For 32007/32007 co-relation queries the response was YES.
[2024-06-14 16:04:11,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12661 conditions, 2204 events. 1437/2204 cut-off events. For 32007/32007 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10709 event pairs, 483 based on Foata normal form. 2/2202 useless extension candidates. Maximal degree in co-relation 12614. Up to 2021 conditions per place. 
[2024-06-14 16:04:11,502 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 111 selfloop transitions, 38 changer transitions 0/154 dead transitions.
[2024-06-14 16:04:11,502 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 154 transitions, 1424 flow
[2024-06-14 16:04:11,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:04:11,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:04:11,504 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-14 16:04:11,505 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494047619047619
[2024-06-14 16:04:11,505 INFO  L175             Difference]: Start difference. First operand has 100 places, 110 transitions, 877 flow. Second operand 8 states and 151 transitions.
[2024-06-14 16:04:11,505 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 154 transitions, 1424 flow
[2024-06-14 16:04:11,518 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 154 transitions, 1292 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-14 16:04:11,519 INFO  L231             Difference]: Finished difference. Result has 105 places, 131 transitions, 1093 flow
[2024-06-14 16:04:11,519 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1093, PETRI_PLACES=105, PETRI_TRANSITIONS=131}
[2024-06-14 16:04:11,520 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places.
[2024-06-14 16:04:11,520 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 131 transitions, 1093 flow
[2024-06-14 16:04:11,520 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:11,520 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:11,520 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:11,520 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 16:04:11,521 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:11,521 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:11,521 INFO  L85        PathProgramCache]: Analyzing trace with hash -21877288, now seen corresponding path program 1 times
[2024-06-14 16:04:11,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:11,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924910856]
[2024-06-14 16:04:11,521 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:11,521 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:11,585 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:21,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:21,747 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:21,747 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924910856]
[2024-06-14 16:04:21,748 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924910856] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:21,748 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:21,748 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:04:21,748 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874109061]
[2024-06-14 16:04:21,748 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:21,748 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:04:21,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:21,749 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:04:21,749 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:04:21,867 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:04:21,868 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 131 transitions, 1093 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:21,868 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:21,868 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:04:21,868 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:22,961 INFO  L124   PetriNetUnfolderBase]: 1432/2201 cut-off events.
[2024-06-14 16:04:22,962 INFO  L125   PetriNetUnfolderBase]: For 34305/34305 co-relation queries the response was YES.
[2024-06-14 16:04:22,969 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13104 conditions, 2201 events. 1432/2201 cut-off events. For 34305/34305 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10638 event pairs, 453 based on Foata normal form. 2/2201 useless extension candidates. Maximal degree in co-relation 13053. Up to 2089 conditions per place. 
[2024-06-14 16:04:22,976 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 145 selfloop transitions, 18 changer transitions 0/168 dead transitions.
[2024-06-14 16:04:22,976 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 168 transitions, 1593 flow
[2024-06-14 16:04:22,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:04:22,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:04:22,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-14 16:04:22,979 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-14 16:04:22,979 INFO  L175             Difference]: Start difference. First operand has 105 places, 131 transitions, 1093 flow. Second operand 8 states and 153 transitions.
[2024-06-14 16:04:22,979 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 168 transitions, 1593 flow
[2024-06-14 16:04:22,995 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 168 transitions, 1541 flow, removed 22 selfloop flow, removed 2 redundant places.
[2024-06-14 16:04:22,997 INFO  L231             Difference]: Finished difference. Result has 113 places, 140 transitions, 1205 flow
[2024-06-14 16:04:22,997 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1205, PETRI_PLACES=113, PETRI_TRANSITIONS=140}
[2024-06-14 16:04:22,998 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places.
[2024-06-14 16:04:22,998 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 140 transitions, 1205 flow
[2024-06-14 16:04:22,998 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:22,998 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:22,998 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:22,998 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 16:04:22,998 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:22,999 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:22,999 INFO  L85        PathProgramCache]: Analyzing trace with hash -1376522246, now seen corresponding path program 1 times
[2024-06-14 16:04:22,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:22,999 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231852306]
[2024-06-14 16:04:22,999 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:22,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:23,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:33,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:33,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:33,628 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231852306]
[2024-06-14 16:04:33,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231852306] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:33,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:33,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:04:33,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020032867]
[2024-06-14 16:04:33,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:33,628 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:04:33,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:33,629 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:04:33,629 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:04:33,821 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:04:33,822 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 140 transitions, 1205 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:33,822 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:33,822 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:04:33,822 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:34,959 INFO  L124   PetriNetUnfolderBase]: 1449/2233 cut-off events.
[2024-06-14 16:04:34,960 INFO  L125   PetriNetUnfolderBase]: For 38778/38778 co-relation queries the response was YES.
[2024-06-14 16:04:34,968 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13629 conditions, 2233 events. 1449/2233 cut-off events. For 38778/38778 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10849 event pairs, 449 based on Foata normal form. 4/2235 useless extension candidates. Maximal degree in co-relation 13574. Up to 2104 conditions per place. 
[2024-06-14 16:04:34,976 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 149 selfloop transitions, 20 changer transitions 0/174 dead transitions.
[2024-06-14 16:04:34,976 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 174 transitions, 1661 flow
[2024-06-14 16:04:34,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:04:34,979 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:04:34,979 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-14 16:04:34,979 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4417989417989418
[2024-06-14 16:04:34,979 INFO  L175             Difference]: Start difference. First operand has 113 places, 140 transitions, 1205 flow. Second operand 9 states and 167 transitions.
[2024-06-14 16:04:34,979 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 174 transitions, 1661 flow
[2024-06-14 16:04:35,004 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 174 transitions, 1581 flow, removed 34 selfloop flow, removed 3 redundant places.
[2024-06-14 16:04:35,006 INFO  L231             Difference]: Finished difference. Result has 121 places, 144 transitions, 1228 flow
[2024-06-14 16:04:35,006 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1228, PETRI_PLACES=121, PETRI_TRANSITIONS=144}
[2024-06-14 16:04:35,006 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places.
[2024-06-14 16:04:35,006 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 144 transitions, 1228 flow
[2024-06-14 16:04:35,007 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:35,007 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:35,007 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:35,007 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 16:04:35,007 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:35,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:35,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -1493971634, now seen corresponding path program 2 times
[2024-06-14 16:04:35,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:35,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79556620]
[2024-06-14 16:04:35,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:35,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:35,047 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:46,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:46,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:46,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79556620]
[2024-06-14 16:04:46,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79556620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:46,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:46,901 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:04:46,901 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39941314]
[2024-06-14 16:04:46,901 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:46,902 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:04:46,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:46,902 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:04:46,902 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:04:47,110 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:04:47,110 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 144 transitions, 1228 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:47,110 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:47,110 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:04:47,110 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:04:48,263 INFO  L124   PetriNetUnfolderBase]: 1541/2376 cut-off events.
[2024-06-14 16:04:48,264 INFO  L125   PetriNetUnfolderBase]: For 47940/47940 co-relation queries the response was YES.
[2024-06-14 16:04:48,273 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14756 conditions, 2376 events. 1541/2376 cut-off events. For 47940/47940 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11757 event pairs, 467 based on Foata normal form. 24/2396 useless extension candidates. Maximal degree in co-relation 14697. Up to 2027 conditions per place. 
[2024-06-14 16:04:48,281 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 131 selfloop transitions, 43 changer transitions 0/179 dead transitions.
[2024-06-14 16:04:48,281 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 179 transitions, 1735 flow
[2024-06-14 16:04:48,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:04:48,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:04:48,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-14 16:04:48,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-14 16:04:48,285 INFO  L175             Difference]: Start difference. First operand has 121 places, 144 transitions, 1228 flow. Second operand 9 states and 176 transitions.
[2024-06-14 16:04:48,285 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 179 transitions, 1735 flow
[2024-06-14 16:04:48,308 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 179 transitions, 1682 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-14 16:04:48,310 INFO  L231             Difference]: Finished difference. Result has 126 places, 146 transitions, 1309 flow
[2024-06-14 16:04:48,310 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1309, PETRI_PLACES=126, PETRI_TRANSITIONS=146}
[2024-06-14 16:04:48,310 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places.
[2024-06-14 16:04:48,310 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 146 transitions, 1309 flow
[2024-06-14 16:04:48,311 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:48,311 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:04:48,311 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:04:48,311 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 16:04:48,311 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:04:48,311 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:04:48,311 INFO  L85        PathProgramCache]: Analyzing trace with hash -1228274354, now seen corresponding path program 3 times
[2024-06-14 16:04:48,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:04:48,311 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948076762]
[2024-06-14 16:04:48,311 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:04:48,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:04:48,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:04:59,220 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:04:59,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:04:59,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948076762]
[2024-06-14 16:04:59,221 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948076762] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:04:59,221 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:04:59,221 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:04:59,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110523504]
[2024-06-14 16:04:59,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:04:59,221 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:04:59,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:04:59,221 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:04:59,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:04:59,398 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:04:59,399 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 146 transitions, 1309 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:04:59,399 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:04:59,399 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:04:59,399 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:00,563 INFO  L124   PetriNetUnfolderBase]: 1558/2403 cut-off events.
[2024-06-14 16:05:00,563 INFO  L125   PetriNetUnfolderBase]: For 48984/48984 co-relation queries the response was YES.
[2024-06-14 16:05:00,571 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15319 conditions, 2403 events. 1558/2403 cut-off events. For 48984/48984 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11948 event pairs, 467 based on Foata normal form. 4/2402 useless extension candidates. Maximal degree in co-relation 15259. Up to 2120 conditions per place. 
[2024-06-14 16:05:00,578 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 109 selfloop transitions, 62 changer transitions 0/176 dead transitions.
[2024-06-14 16:05:00,578 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 176 transitions, 1761 flow
[2024-06-14 16:05:00,581 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:05:00,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:05:00,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 16:05:00,581 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 16:05:00,581 INFO  L175             Difference]: Start difference. First operand has 126 places, 146 transitions, 1309 flow. Second operand 9 states and 171 transitions.
[2024-06-14 16:05:00,581 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 176 transitions, 1761 flow
[2024-06-14 16:05:00,603 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 176 transitions, 1669 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-14 16:05:00,605 INFO  L231             Difference]: Finished difference. Result has 128 places, 148 transitions, 1390 flow
[2024-06-14 16:05:00,605 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1390, PETRI_PLACES=128, PETRI_TRANSITIONS=148}
[2024-06-14 16:05:00,605 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places.
[2024-06-14 16:05:00,605 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 148 transitions, 1390 flow
[2024-06-14 16:05:00,606 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:00,606 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:00,606 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:00,606 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 16:05:00,606 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:00,606 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:00,606 INFO  L85        PathProgramCache]: Analyzing trace with hash -1237471124, now seen corresponding path program 4 times
[2024-06-14 16:05:00,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:00,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152730866]
[2024-06-14 16:05:00,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:00,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:00,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:12,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:12,306 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:12,306 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152730866]
[2024-06-14 16:05:12,306 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152730866] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:12,306 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:12,306 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:05:12,306 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123649428]
[2024-06-14 16:05:12,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:12,307 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:05:12,307 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:12,307 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:05:12,308 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:05:12,463 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:05:12,463 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 148 transitions, 1390 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:12,463 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:12,463 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:05:12,463 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:13,666 INFO  L124   PetriNetUnfolderBase]: 1650/2565 cut-off events.
[2024-06-14 16:05:13,666 INFO  L125   PetriNetUnfolderBase]: For 59513/59513 co-relation queries the response was YES.
[2024-06-14 16:05:13,676 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16501 conditions, 2565 events. 1650/2565 cut-off events. For 59513/59513 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13007 event pairs, 482 based on Foata normal form. 24/2584 useless extension candidates. Maximal degree in co-relation 16440. Up to 2206 conditions per place. 
[2024-06-14 16:05:13,684 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 133 selfloop transitions, 45 changer transitions 0/183 dead transitions.
[2024-06-14 16:05:13,684 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 183 transitions, 1913 flow
[2024-06-14 16:05:13,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:05:13,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:05:13,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-14 16:05:13,687 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46296296296296297
[2024-06-14 16:05:13,687 INFO  L175             Difference]: Start difference. First operand has 128 places, 148 transitions, 1390 flow. Second operand 9 states and 175 transitions.
[2024-06-14 16:05:13,687 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 183 transitions, 1913 flow
[2024-06-14 16:05:13,712 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 183 transitions, 1758 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-14 16:05:13,714 INFO  L231             Difference]: Finished difference. Result has 130 places, 150 transitions, 1381 flow
[2024-06-14 16:05:13,715 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1381, PETRI_PLACES=130, PETRI_TRANSITIONS=150}
[2024-06-14 16:05:13,715 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 87 predicate places.
[2024-06-14 16:05:13,715 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 150 transitions, 1381 flow
[2024-06-14 16:05:13,715 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:13,715 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:13,715 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:13,715 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 16:05:13,716 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-14 16:05:13,716 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:13,716 INFO  L85        PathProgramCache]: Analyzing trace with hash -1227947924, now seen corresponding path program 5 times
[2024-06-14 16:05:13,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:13,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461616680]
[2024-06-14 16:05:13,716 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:13,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:13,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:24,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:24,927 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:24,927 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461616680]
[2024-06-14 16:05:24,927 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461616680] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:24,927 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:24,927 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:05:24,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854784463]
[2024-06-14 16:05:24,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:24,927 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:05:24,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:24,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:05:24,928 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:05:25,204 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:05:25,205 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 150 transitions, 1381 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:25,205 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:25,205 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:05:25,205 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:26,583 INFO  L124   PetriNetUnfolderBase]: 1810/2837 cut-off events.
[2024-06-14 16:05:26,584 INFO  L125   PetriNetUnfolderBase]: For 64888/64888 co-relation queries the response was YES.
[2024-06-14 16:05:26,593 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18342 conditions, 2837 events. 1810/2837 cut-off events. For 64888/64888 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14944 event pairs, 501 based on Foata normal form. 4/2836 useless extension candidates. Maximal degree in co-relation 18280. Up to 2137 conditions per place. 
[2024-06-14 16:05:26,602 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 112 selfloop transitions, 72 changer transitions 0/189 dead transitions.
[2024-06-14 16:05:26,602 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 189 transitions, 2070 flow
[2024-06-14 16:05:26,604 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:05:26,604 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:05:26,605 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-14 16:05:26,605 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46825396825396826
[2024-06-14 16:05:26,605 INFO  L175             Difference]: Start difference. First operand has 130 places, 150 transitions, 1381 flow. Second operand 9 states and 177 transitions.
[2024-06-14 16:05:26,605 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 189 transitions, 2070 flow
[2024-06-14 16:05:26,640 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 189 transitions, 1955 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-14 16:05:26,643 INFO  L231             Difference]: Finished difference. Result has 133 places, 155 transitions, 1562 flow
[2024-06-14 16:05:26,643 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1562, PETRI_PLACES=133, PETRI_TRANSITIONS=155}
[2024-06-14 16:05:26,643 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places.
[2024-06-14 16:05:26,643 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 155 transitions, 1562 flow
[2024-06-14 16:05:26,643 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:26,644 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:26,644 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:26,644 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 16:05:26,644 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:26,644 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:26,644 INFO  L85        PathProgramCache]: Analyzing trace with hash 609593884, now seen corresponding path program 1 times
[2024-06-14 16:05:26,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:26,645 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910490991]
[2024-06-14 16:05:26,645 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:26,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:26,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:37,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:37,870 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:37,870 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910490991]
[2024-06-14 16:05:37,870 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910490991] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:37,870 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:37,870 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:05:37,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965414410]
[2024-06-14 16:05:37,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:37,870 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:05:37,871 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:37,871 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:05:37,871 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:05:38,028 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:05:38,028 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 155 transitions, 1562 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:38,028 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:38,029 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:05:38,029 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:39,329 INFO  L124   PetriNetUnfolderBase]: 1742/2778 cut-off events.
[2024-06-14 16:05:39,329 INFO  L125   PetriNetUnfolderBase]: For 69505/69567 co-relation queries the response was YES.
[2024-06-14 16:05:39,340 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18213 conditions, 2778 events. 1742/2778 cut-off events. For 69505/69567 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 14959 event pairs, 359 based on Foata normal form. 10/2752 useless extension candidates. Maximal degree in co-relation 18149. Up to 2469 conditions per place. 
[2024-06-14 16:05:39,349 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 125 selfloop transitions, 22 changer transitions 0/187 dead transitions.
[2024-06-14 16:05:39,349 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 187 transitions, 1958 flow
[2024-06-14 16:05:39,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:05:39,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:05:39,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-14 16:05:39,352 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-14 16:05:39,352 INFO  L175             Difference]: Start difference. First operand has 133 places, 155 transitions, 1562 flow. Second operand 8 states and 160 transitions.
[2024-06-14 16:05:39,352 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 187 transitions, 1958 flow
[2024-06-14 16:05:39,388 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 187 transitions, 1840 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-14 16:05:39,390 INFO  L231             Difference]: Finished difference. Result has 136 places, 157 transitions, 1521 flow
[2024-06-14 16:05:39,391 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1521, PETRI_PLACES=136, PETRI_TRANSITIONS=157}
[2024-06-14 16:05:39,391 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places.
[2024-06-14 16:05:39,391 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 157 transitions, 1521 flow
[2024-06-14 16:05:39,391 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:39,391 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:39,392 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:39,392 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 16:05:39,392 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:39,392 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:39,392 INFO  L85        PathProgramCache]: Analyzing trace with hash 176291554, now seen corresponding path program 2 times
[2024-06-14 16:05:39,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:39,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454361324]
[2024-06-14 16:05:39,392 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:39,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:39,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:05:49,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:05:49,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:05:49,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454361324]
[2024-06-14 16:05:49,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454361324] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:05:49,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:05:49,773 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:05:49,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556022021]
[2024-06-14 16:05:49,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:05:49,774 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:05:49,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:05:49,774 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:05:49,774 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:05:49,937 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:05:49,938 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 157 transitions, 1521 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:49,938 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:05:49,938 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:05:49,938 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:05:51,453 INFO  L124   PetriNetUnfolderBase]: 1759/2807 cut-off events.
[2024-06-14 16:05:51,453 INFO  L125   PetriNetUnfolderBase]: For 73629/73680 co-relation queries the response was YES.
[2024-06-14 16:05:51,464 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18587 conditions, 2807 events. 1759/2807 cut-off events. For 73629/73680 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15146 event pairs, 466 based on Foata normal form. 8/2777 useless extension candidates. Maximal degree in co-relation 18521. Up to 2520 conditions per place. 
[2024-06-14 16:05:51,472 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 123 selfloop transitions, 25 changer transitions 0/188 dead transitions.
[2024-06-14 16:05:51,472 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 188 transitions, 1921 flow
[2024-06-14 16:05:51,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:05:51,473 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:05:51,473 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-14 16:05:51,473 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-14 16:05:51,473 INFO  L175             Difference]: Start difference. First operand has 136 places, 157 transitions, 1521 flow. Second operand 8 states and 160 transitions.
[2024-06-14 16:05:51,473 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 188 transitions, 1921 flow
[2024-06-14 16:05:51,513 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 188 transitions, 1862 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-06-14 16:05:51,515 INFO  L231             Difference]: Finished difference. Result has 138 places, 159 transitions, 1550 flow
[2024-06-14 16:05:51,515 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1550, PETRI_PLACES=138, PETRI_TRANSITIONS=159}
[2024-06-14 16:05:51,516 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places.
[2024-06-14 16:05:51,516 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 159 transitions, 1550 flow
[2024-06-14 16:05:51,516 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:05:51,516 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:05:51,516 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:05:51,516 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 16:05:51,516 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:05:51,517 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:05:51,517 INFO  L85        PathProgramCache]: Analyzing trace with hash 179093024, now seen corresponding path program 1 times
[2024-06-14 16:05:51,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:05:51,517 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192429868]
[2024-06-14 16:05:51,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:05:51,517 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:05:51,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:03,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:06:03,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:03,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192429868]
[2024-06-14 16:06:03,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192429868] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:03,641 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:03,641 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:06:03,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978175504]
[2024-06-14 16:06:03,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:03,643 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:06:03,643 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:03,643 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:06:03,643 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:06:03,920 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:06:03,921 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 159 transitions, 1550 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:03,921 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:03,921 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:06:03,921 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:05,341 INFO  L124   PetriNetUnfolderBase]: 1871/2940 cut-off events.
[2024-06-14 16:06:05,342 INFO  L125   PetriNetUnfolderBase]: For 78028/78028 co-relation queries the response was YES.
[2024-06-14 16:06:05,354 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19840 conditions, 2940 events. 1871/2940 cut-off events. For 78028/78028 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15506 event pairs, 484 based on Foata normal form. 2/2940 useless extension candidates. Maximal degree in co-relation 19773. Up to 2804 conditions per place. 
[2024-06-14 16:06:05,364 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 168 selfloop transitions, 21 changer transitions 0/194 dead transitions.
[2024-06-14 16:06:05,364 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 194 transitions, 2076 flow
[2024-06-14 16:06:05,366 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:06:05,366 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:06:05,367 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 16:06:05,367 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-14 16:06:05,367 INFO  L175             Difference]: Start difference. First operand has 138 places, 159 transitions, 1550 flow. Second operand 9 states and 170 transitions.
[2024-06-14 16:06:05,367 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 194 transitions, 2076 flow
[2024-06-14 16:06:05,418 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 194 transitions, 2008 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-14 16:06:05,420 INFO  L231             Difference]: Finished difference. Result has 141 places, 162 transitions, 1600 flow
[2024-06-14 16:06:05,420 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1600, PETRI_PLACES=141, PETRI_TRANSITIONS=162}
[2024-06-14 16:06:05,421 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 98 predicate places.
[2024-06-14 16:06:05,421 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 162 transitions, 1600 flow
[2024-06-14 16:06:05,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:05,421 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:05,421 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:06:05,421 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 16:06:05,421 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:06:05,421 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:05,421 INFO  L85        PathProgramCache]: Analyzing trace with hash 460018368, now seen corresponding path program 3 times
[2024-06-14 16:06:05,422 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:05,422 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929122710]
[2024-06-14 16:06:05,422 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:05,422 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:05,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:16,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-14 16:06:16,087 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:16,087 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929122710]
[2024-06-14 16:06:16,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929122710] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:16,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:16,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:06:16,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007134437]
[2024-06-14 16:06:16,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:16,088 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:06:16,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:16,088 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:06:16,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:06:16,264 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:06:16,265 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 162 transitions, 1600 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:16,265 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:16,265 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:06:16,265 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:17,703 INFO  L124   PetriNetUnfolderBase]: 1787/2857 cut-off events.
[2024-06-14 16:06:17,703 INFO  L125   PetriNetUnfolderBase]: For 86542/86597 co-relation queries the response was YES.
[2024-06-14 16:06:17,715 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19653 conditions, 2857 events. 1787/2857 cut-off events. For 86542/86597 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15518 event pairs, 448 based on Foata normal form. 8/2825 useless extension candidates. Maximal degree in co-relation 19585. Up to 2567 conditions per place. 
[2024-06-14 16:06:17,726 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 127 selfloop transitions, 25 changer transitions 0/193 dead transitions.
[2024-06-14 16:06:17,726 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 193 transitions, 2040 flow
[2024-06-14 16:06:17,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:06:17,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:06:17,727 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-14 16:06:17,727 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-14 16:06:17,727 INFO  L175             Difference]: Start difference. First operand has 141 places, 162 transitions, 1600 flow. Second operand 8 states and 157 transitions.
[2024-06-14 16:06:17,727 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 193 transitions, 2040 flow
[2024-06-14 16:06:17,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 193 transitions, 1946 flow, removed 28 selfloop flow, removed 7 redundant places.
[2024-06-14 16:06:17,773 INFO  L231             Difference]: Finished difference. Result has 143 places, 167 transitions, 1645 flow
[2024-06-14 16:06:17,774 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1645, PETRI_PLACES=143, PETRI_TRANSITIONS=167}
[2024-06-14 16:06:17,774 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places.
[2024-06-14 16:06:17,774 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 167 transitions, 1645 flow
[2024-06-14 16:06:17,774 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:17,775 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:17,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-14 16:06:17,775 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 16:06:17,775 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:06:17,775 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:17,775 INFO  L85        PathProgramCache]: Analyzing trace with hash 961838410, now seen corresponding path program 2 times
[2024-06-14 16:06:17,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:17,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720204281]
[2024-06-14 16:06:17,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:17,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:17,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:30,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:06:30,153 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:30,153 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720204281]
[2024-06-14 16:06:30,153 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720204281] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:30,153 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:30,153 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:06:30,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393206864]
[2024-06-14 16:06:30,153 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:30,154 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:06:30,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:30,154 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:06:30,154 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:06:30,439 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:06:30,440 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 167 transitions, 1645 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:30,440 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:30,440 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:06:30,440 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:31,960 INFO  L124   PetriNetUnfolderBase]: 1907/3000 cut-off events.
[2024-06-14 16:06:31,960 INFO  L125   PetriNetUnfolderBase]: For 91554/91554 co-relation queries the response was YES.
[2024-06-14 16:06:31,972 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21036 conditions, 3000 events. 1907/3000 cut-off events. For 91554/91554 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 15895 event pairs, 486 based on Foata normal form. 2/3000 useless extension candidates. Maximal degree in co-relation 20966. Up to 2791 conditions per place. 
[2024-06-14 16:06:31,982 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 161 selfloop transitions, 40 changer transitions 0/206 dead transitions.
[2024-06-14 16:06:31,983 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 206 transitions, 2211 flow
[2024-06-14 16:06:31,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:06:31,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:06:31,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-14 16:06:31,985 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 16:06:31,985 INFO  L175             Difference]: Start difference. First operand has 143 places, 167 transitions, 1645 flow. Second operand 10 states and 190 transitions.
[2024-06-14 16:06:31,985 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 206 transitions, 2211 flow
[2024-06-14 16:06:32,038 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 206 transitions, 2125 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-14 16:06:32,040 INFO  L231             Difference]: Finished difference. Result has 148 places, 170 transitions, 1721 flow
[2024-06-14 16:06:32,040 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1721, PETRI_PLACES=148, PETRI_TRANSITIONS=170}
[2024-06-14 16:06:32,041 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places.
[2024-06-14 16:06:32,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 170 transitions, 1721 flow
[2024-06-14 16:06:32,041 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:32,041 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:32,041 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:06:32,041 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 16:06:32,042 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:06:32,042 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:32,042 INFO  L85        PathProgramCache]: Analyzing trace with hash -1711060988, now seen corresponding path program 1 times
[2024-06-14 16:06:32,042 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:32,042 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270484721]
[2024-06-14 16:06:32,042 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:32,042 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:32,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:06:49,353 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:06:49,353 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:06:49,353 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270484721]
[2024-06-14 16:06:49,353 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270484721] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:06:49,353 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:06:49,353 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:06:49,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125420842]
[2024-06-14 16:06:49,354 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:06:49,354 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:06:49,354 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:06:49,354 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:06:49,354 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:06:49,501 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:06:49,502 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 170 transitions, 1721 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:49,502 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:06:49,502 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:06:49,502 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:06:50,880 INFO  L124   PetriNetUnfolderBase]: 1927/3036 cut-off events.
[2024-06-14 16:06:50,880 INFO  L125   PetriNetUnfolderBase]: For 98588/98588 co-relation queries the response was YES.
[2024-06-14 16:06:50,895 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21725 conditions, 3036 events. 1927/3036 cut-off events. For 98588/98588 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16152 event pairs, 487 based on Foata normal form. 4/3038 useless extension candidates. Maximal degree in co-relation 21654. Up to 2855 conditions per place. 
[2024-06-14 16:06:50,907 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 164 selfloop transitions, 26 changer transitions 0/195 dead transitions.
[2024-06-14 16:06:50,907 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 195 transitions, 2339 flow
[2024-06-14 16:06:50,908 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:06:50,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:06:50,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-14 16:06:50,908 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-14 16:06:50,908 INFO  L175             Difference]: Start difference. First operand has 148 places, 170 transitions, 1721 flow. Second operand 6 states and 122 transitions.
[2024-06-14 16:06:50,908 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 195 transitions, 2339 flow
[2024-06-14 16:06:50,959 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 195 transitions, 2201 flow, removed 31 selfloop flow, removed 8 redundant places.
[2024-06-14 16:06:50,962 INFO  L231             Difference]: Finished difference. Result has 146 places, 176 transitions, 1732 flow
[2024-06-14 16:06:50,962 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1732, PETRI_PLACES=146, PETRI_TRANSITIONS=176}
[2024-06-14 16:06:50,963 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 103 predicate places.
[2024-06-14 16:06:50,963 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 176 transitions, 1732 flow
[2024-06-14 16:06:50,963 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:06:50,963 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:06:50,963 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:06:50,964 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 16:06:50,964 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:06:50,964 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:06:50,964 INFO  L85        PathProgramCache]: Analyzing trace with hash 924840264, now seen corresponding path program 4 times
[2024-06-14 16:06:50,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:06:50,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403541587]
[2024-06-14 16:06:50,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:06:50,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:06:51,026 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:00,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:00,374 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:00,374 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403541587]
[2024-06-14 16:07:00,374 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403541587] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:00,374 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:00,374 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:07:00,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010740241]
[2024-06-14 16:07:00,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:00,374 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:07:00,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:00,375 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:07:00,375 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:07:00,511 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:07:00,511 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 176 transitions, 1732 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:00,512 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:00,512 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:07:00,512 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:01,899 INFO  L124   PetriNetUnfolderBase]: 1808/2891 cut-off events.
[2024-06-14 16:07:01,900 INFO  L125   PetriNetUnfolderBase]: For 104515/104574 co-relation queries the response was YES.
[2024-06-14 16:07:01,914 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20856 conditions, 2891 events. 1808/2891 cut-off events. For 104515/104574 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 15814 event pairs, 451 based on Foata normal form. 8/2856 useless extension candidates. Maximal degree in co-relation 20784. Up to 2562 conditions per place. 
[2024-06-14 16:07:01,925 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 128 selfloop transitions, 35 changer transitions 0/205 dead transitions.
[2024-06-14 16:07:01,925 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 205 transitions, 2190 flow
[2024-06-14 16:07:01,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:07:01,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:07:01,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-14 16:07:01,926 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-14 16:07:01,926 INFO  L175             Difference]: Start difference. First operand has 146 places, 176 transitions, 1732 flow. Second operand 8 states and 157 transitions.
[2024-06-14 16:07:01,926 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 205 transitions, 2190 flow
[2024-06-14 16:07:01,983 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 205 transitions, 2149 flow, removed 14 selfloop flow, removed 2 redundant places.
[2024-06-14 16:07:01,986 INFO  L231             Difference]: Finished difference. Result has 153 places, 181 transitions, 1852 flow
[2024-06-14 16:07:01,986 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1691, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1852, PETRI_PLACES=153, PETRI_TRANSITIONS=181}
[2024-06-14 16:07:01,986 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places.
[2024-06-14 16:07:01,987 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 181 transitions, 1852 flow
[2024-06-14 16:07:01,987 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:01,987 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:01,987 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:07:01,987 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 16:07:01,987 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:07:01,988 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:01,988 INFO  L85        PathProgramCache]: Analyzing trace with hash 931511464, now seen corresponding path program 3 times
[2024-06-14 16:07:01,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:01,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547903663]
[2024-06-14 16:07:01,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:01,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:02,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:15,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:15,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:15,111 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547903663]
[2024-06-14 16:07:15,111 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547903663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:15,111 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:15,111 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:07:15,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806395000]
[2024-06-14 16:07:15,111 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:15,112 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:07:15,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:15,112 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:07:15,112 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:07:15,358 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:07:15,359 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 181 transitions, 1852 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:15,359 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:15,359 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:07:15,359 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:16,797 INFO  L124   PetriNetUnfolderBase]: 1925/3034 cut-off events.
[2024-06-14 16:07:16,797 INFO  L125   PetriNetUnfolderBase]: For 108243/108243 co-relation queries the response was YES.
[2024-06-14 16:07:16,811 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22319 conditions, 3034 events. 1925/3034 cut-off events. For 108243/108243 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16284 event pairs, 485 based on Foata normal form. 2/3032 useless extension candidates. Maximal degree in co-relation 22244. Up to 2781 conditions per place. 
[2024-06-14 16:07:16,822 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 163 selfloop transitions, 44 changer transitions 0/212 dead transitions.
[2024-06-14 16:07:16,822 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 212 transitions, 2419 flow
[2024-06-14 16:07:16,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:07:16,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:07:16,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-14 16:07:16,825 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-14 16:07:16,825 INFO  L175             Difference]: Start difference. First operand has 153 places, 181 transitions, 1852 flow. Second operand 9 states and 172 transitions.
[2024-06-14 16:07:16,825 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 212 transitions, 2419 flow
[2024-06-14 16:07:16,882 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 212 transitions, 2301 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-14 16:07:16,884 INFO  L231             Difference]: Finished difference. Result has 156 places, 184 transitions, 1912 flow
[2024-06-14 16:07:16,884 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1912, PETRI_PLACES=156, PETRI_TRANSITIONS=184}
[2024-06-14 16:07:16,885 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places.
[2024-06-14 16:07:16,885 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 184 transitions, 1912 flow
[2024-06-14 16:07:16,885 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:16,885 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:16,885 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:07:16,885 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 16:07:16,886 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:07:16,886 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:16,886 INFO  L85        PathProgramCache]: Analyzing trace with hash 578192552, now seen corresponding path program 4 times
[2024-06-14 16:07:16,886 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:16,886 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249409323]
[2024-06-14 16:07:16,886 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:16,886 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:16,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:29,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:29,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:29,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249409323]
[2024-06-14 16:07:29,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249409323] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:29,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:29,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:07:29,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772447341]
[2024-06-14 16:07:29,422 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:29,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:07:29,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:29,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:07:29,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:07:29,589 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:07:29,589 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 184 transitions, 1912 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:29,589 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:29,589 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:07:29,589 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:31,015 INFO  L124   PetriNetUnfolderBase]: 1920/3027 cut-off events.
[2024-06-14 16:07:31,015 INFO  L125   PetriNetUnfolderBase]: For 115974/115974 co-relation queries the response was YES.
[2024-06-14 16:07:31,029 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22595 conditions, 3027 events. 1920/3027 cut-off events. For 115974/115974 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16251 event pairs, 485 based on Foata normal form. 2/3025 useless extension candidates. Maximal degree in co-relation 22520. Up to 2697 conditions per place. 
[2024-06-14 16:07:31,041 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 149 selfloop transitions, 69 changer transitions 0/223 dead transitions.
[2024-06-14 16:07:31,042 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 223 transitions, 2527 flow
[2024-06-14 16:07:31,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:07:31,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:07:31,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions.
[2024-06-14 16:07:31,044 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4458874458874459
[2024-06-14 16:07:31,044 INFO  L175             Difference]: Start difference. First operand has 156 places, 184 transitions, 1912 flow. Second operand 11 states and 206 transitions.
[2024-06-14 16:07:31,044 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 223 transitions, 2527 flow
[2024-06-14 16:07:31,163 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 223 transitions, 2373 flow, removed 35 selfloop flow, removed 7 redundant places.
[2024-06-14 16:07:31,165 INFO  L231             Difference]: Finished difference. Result has 161 places, 188 transitions, 2006 flow
[2024-06-14 16:07:31,165 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2006, PETRI_PLACES=161, PETRI_TRANSITIONS=188}
[2024-06-14 16:07:31,166 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 118 predicate places.
[2024-06-14 16:07:31,166 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 188 transitions, 2006 flow
[2024-06-14 16:07:31,166 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:31,166 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:31,166 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:07:31,166 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 16:07:31,166 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:07:31,167 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:31,167 INFO  L85        PathProgramCache]: Analyzing trace with hash -1487501922, now seen corresponding path program 2 times
[2024-06-14 16:07:31,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:31,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290977261]
[2024-06-14 16:07:31,167 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:31,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:31,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:07:49,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:07:49,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:07:49,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290977261]
[2024-06-14 16:07:49,108 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290977261] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:07:49,108 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:07:49,108 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:07:49,108 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171869043]
[2024-06-14 16:07:49,108 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:07:49,108 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:07:49,108 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:07:49,109 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:07:49,109 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:07:49,288 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:07:49,288 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 188 transitions, 2006 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:49,288 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:07:49,288 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:07:49,288 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:07:50,508 INFO  L124   PetriNetUnfolderBase]: 1908/3015 cut-off events.
[2024-06-14 16:07:50,509 INFO  L125   PetriNetUnfolderBase]: For 121009/121009 co-relation queries the response was YES.
[2024-06-14 16:07:50,523 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22856 conditions, 3015 events. 1908/3015 cut-off events. For 121009/121009 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16175 event pairs, 480 based on Foata normal form. 4/3017 useless extension candidates. Maximal degree in co-relation 22779. Up to 2853 conditions per place. 
[2024-06-14 16:07:50,534 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 175 selfloop transitions, 23 changer transitions 0/203 dead transitions.
[2024-06-14 16:07:50,534 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 203 transitions, 2468 flow
[2024-06-14 16:07:50,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 16:07:50,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 16:07:50,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions.
[2024-06-14 16:07:50,535 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-14 16:07:50,535 INFO  L175             Difference]: Start difference. First operand has 161 places, 188 transitions, 2006 flow. Second operand 5 states and 105 transitions.
[2024-06-14 16:07:50,535 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 203 transitions, 2468 flow
[2024-06-14 16:07:50,621 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 203 transitions, 2233 flow, removed 52 selfloop flow, removed 8 redundant places.
[2024-06-14 16:07:50,623 INFO  L231             Difference]: Finished difference. Result has 158 places, 188 transitions, 1835 flow
[2024-06-14 16:07:50,623 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1771, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1835, PETRI_PLACES=158, PETRI_TRANSITIONS=188}
[2024-06-14 16:07:50,623 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places.
[2024-06-14 16:07:50,623 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 188 transitions, 1835 flow
[2024-06-14 16:07:50,624 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:07:50,624 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:07:50,624 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:07:50,624 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 16:07:50,624 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:07:50,624 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:07:50,624 INFO  L85        PathProgramCache]: Analyzing trace with hash 1563297470, now seen corresponding path program 1 times
[2024-06-14 16:07:50,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:07:50,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647229125]
[2024-06-14 16:07:50,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:07:50,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:07:50,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:04,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:04,216 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:04,216 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647229125]
[2024-06-14 16:08:04,216 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647229125] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:04,216 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:04,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:08:04,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023898516]
[2024-06-14 16:08:04,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:04,217 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:08:04,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:04,217 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:08:04,217 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:08:04,337 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:08:04,338 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 188 transitions, 1835 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:04,338 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:04,338 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:08:04,338 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:05,714 INFO  L124   PetriNetUnfolderBase]: 1859/2971 cut-off events.
[2024-06-14 16:08:05,714 INFO  L125   PetriNetUnfolderBase]: For 123812/123868 co-relation queries the response was YES.
[2024-06-14 16:08:05,730 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22449 conditions, 2971 events. 1859/2971 cut-off events. For 123812/123868 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16108 event pairs, 451 based on Foata normal form. 3/2968 useless extension candidates. Maximal degree in co-relation 22371. Up to 2734 conditions per place. 
[2024-06-14 16:08:05,740 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 167 selfloop transitions, 27 changer transitions 0/214 dead transitions.
[2024-06-14 16:08:05,740 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 214 transitions, 2405 flow
[2024-06-14 16:08:05,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:08:05,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:08:05,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-14 16:08:05,741 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-14 16:08:05,741 INFO  L175             Difference]: Start difference. First operand has 158 places, 188 transitions, 1835 flow. Second operand 8 states and 153 transitions.
[2024-06-14 16:08:05,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 214 transitions, 2405 flow
[2024-06-14 16:08:05,819 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 214 transitions, 2359 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-14 16:08:05,821 INFO  L231             Difference]: Finished difference. Result has 162 places, 194 transitions, 1915 flow
[2024-06-14 16:08:05,822 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1915, PETRI_PLACES=162, PETRI_TRANSITIONS=194}
[2024-06-14 16:08:05,822 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places.
[2024-06-14 16:08:05,822 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 194 transitions, 1915 flow
[2024-06-14 16:08:05,822 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:05,822 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:05,822 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:05,822 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 16:08:05,822 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:08:05,823 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:05,823 INFO  L85        PathProgramCache]: Analyzing trace with hash -1664863834, now seen corresponding path program 2 times
[2024-06-14 16:08:05,823 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:05,823 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768729424]
[2024-06-14 16:08:05,823 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:05,823 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:05,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:19,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:19,693 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:19,693 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768729424]
[2024-06-14 16:08:19,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768729424] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:19,693 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:19,694 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:08:19,694 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836278569]
[2024-06-14 16:08:19,694 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:19,694 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:08:19,694 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:19,694 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:08:19,694 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:08:19,888 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:08:19,889 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 194 transitions, 1915 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:19,889 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:19,889 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:08:19,889 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:21,136 INFO  L124   PetriNetUnfolderBase]: 1850/2958 cut-off events.
[2024-06-14 16:08:21,136 INFO  L125   PetriNetUnfolderBase]: For 127943/127999 co-relation queries the response was YES.
[2024-06-14 16:08:21,152 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22698 conditions, 2958 events. 1850/2958 cut-off events. For 127943/127999 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16060 event pairs, 452 based on Foata normal form. 3/2952 useless extension candidates. Maximal degree in co-relation 22619. Up to 2733 conditions per place. 
[2024-06-14 16:08:21,162 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 167 selfloop transitions, 23 changer transitions 0/210 dead transitions.
[2024-06-14 16:08:21,163 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 210 transitions, 2339 flow
[2024-06-14 16:08:21,165 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:08:21,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:08:21,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-14 16:08:21,165 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-14 16:08:21,165 INFO  L175             Difference]: Start difference. First operand has 162 places, 194 transitions, 1915 flow. Second operand 6 states and 122 transitions.
[2024-06-14 16:08:21,165 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 210 transitions, 2339 flow
[2024-06-14 16:08:21,252 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 210 transitions, 2271 flow, removed 23 selfloop flow, removed 4 redundant places.
[2024-06-14 16:08:21,254 INFO  L231             Difference]: Finished difference. Result has 164 places, 194 transitions, 1904 flow
[2024-06-14 16:08:21,254 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1904, PETRI_PLACES=164, PETRI_TRANSITIONS=194}
[2024-06-14 16:08:21,255 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places.
[2024-06-14 16:08:21,255 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 194 transitions, 1904 flow
[2024-06-14 16:08:21,255 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:21,255 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:21,255 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:21,255 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 16:08:21,255 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:08:21,255 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:21,256 INFO  L85        PathProgramCache]: Analyzing trace with hash 392334268, now seen corresponding path program 1 times
[2024-06-14 16:08:21,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:21,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435024363]
[2024-06-14 16:08:21,256 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:21,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:21,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:37,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:37,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:37,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435024363]
[2024-06-14 16:08:37,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435024363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:37,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:37,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:08:37,770 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509673455]
[2024-06-14 16:08:37,770 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:37,770 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:08:37,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:37,770 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:08:37,770 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:08:37,953 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:08:37,953 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 194 transitions, 1904 flow. Second operand  has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:37,953 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:37,953 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:08:37,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:39,135 INFO  L124   PetriNetUnfolderBase]: 1917/3024 cut-off events.
[2024-06-14 16:08:39,135 INFO  L125   PetriNetUnfolderBase]: For 129823/129823 co-relation queries the response was YES.
[2024-06-14 16:08:39,150 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23159 conditions, 3024 events. 1917/3024 cut-off events. For 129823/129823 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16124 event pairs, 481 based on Foata normal form. 2/3024 useless extension candidates. Maximal degree in co-relation 23079. Up to 2916 conditions per place. 
[2024-06-14 16:08:39,160 INFO  L140   encePairwiseOnDemand]: 36/42 looper letters, 185 selfloop transitions, 14 changer transitions 0/204 dead transitions.
[2024-06-14 16:08:39,160 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 204 transitions, 2348 flow
[2024-06-14 16:08:39,160 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 16:08:39,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 16:08:39,161 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions.
[2024-06-14 16:08:39,161 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 16:08:39,161 INFO  L175             Difference]: Start difference. First operand has 164 places, 194 transitions, 1904 flow. Second operand 5 states and 95 transitions.
[2024-06-14 16:08:39,161 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 204 transitions, 2348 flow
[2024-06-14 16:08:39,251 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 204 transitions, 2302 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-06-14 16:08:39,253 INFO  L231             Difference]: Finished difference. Result has 164 places, 196 transitions, 1921 flow
[2024-06-14 16:08:39,253 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1921, PETRI_PLACES=164, PETRI_TRANSITIONS=196}
[2024-06-14 16:08:39,254 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places.
[2024-06-14 16:08:39,254 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 196 transitions, 1921 flow
[2024-06-14 16:08:39,254 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:39,254 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:39,254 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:39,254 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 16:08:39,254 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:08:39,255 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:39,255 INFO  L85        PathProgramCache]: Analyzing trace with hash 375198773, now seen corresponding path program 1 times
[2024-06-14 16:08:39,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:39,255 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963487143]
[2024-06-14 16:08:39,255 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:39,255 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:39,322 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:49,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:49,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:49,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963487143]
[2024-06-14 16:08:49,228 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963487143] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:49,228 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:49,228 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:08:49,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526583657]
[2024-06-14 16:08:49,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:49,229 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:08:49,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:49,229 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:08:49,229 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:08:49,507 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:08:49,508 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 196 transitions, 1921 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:49,508 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:49,508 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:08:49,508 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:51,022 INFO  L124   PetriNetUnfolderBase]: 1934/3051 cut-off events.
[2024-06-14 16:08:51,022 INFO  L125   PetriNetUnfolderBase]: For 137468/137468 co-relation queries the response was YES.
[2024-06-14 16:08:51,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23552 conditions, 3051 events. 1934/3051 cut-off events. For 137468/137468 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 16376 event pairs, 315 based on Foata normal form. 4/3053 useless extension candidates. Maximal degree in co-relation 23471. Up to 2852 conditions per place. 
[2024-06-14 16:08:51,047 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 214 selfloop transitions, 18 changer transitions 0/237 dead transitions.
[2024-06-14 16:08:51,048 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 237 transitions, 2607 flow
[2024-06-14 16:08:51,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:08:51,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:08:51,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 16:08:51,052 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-14 16:08:51,052 INFO  L175             Difference]: Start difference. First operand has 164 places, 196 transitions, 1921 flow. Second operand 9 states and 170 transitions.
[2024-06-14 16:08:51,052 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 237 transitions, 2607 flow
[2024-06-14 16:08:51,139 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 237 transitions, 2560 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-06-14 16:08:51,142 INFO  L231             Difference]: Finished difference. Result has 172 places, 202 transitions, 2061 flow
[2024-06-14 16:08:51,142 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2061, PETRI_PLACES=172, PETRI_TRANSITIONS=202}
[2024-06-14 16:08:51,143 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places.
[2024-06-14 16:08:51,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 202 transitions, 2061 flow
[2024-06-14 16:08:51,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:51,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:51,143 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:51,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 16:08:51,143 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:08:51,143 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:51,143 INFO  L85        PathProgramCache]: Analyzing trace with hash 379008053, now seen corresponding path program 2 times
[2024-06-14 16:08:51,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:51,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400693078]
[2024-06-14 16:08:51,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:51,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:51,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:02,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:02,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:02,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400693078]
[2024-06-14 16:09:02,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400693078] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:02,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:02,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:09:02,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836665374]
[2024-06-14 16:09:02,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:02,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:09:02,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:02,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:09:02,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:09:02,516 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:09:02,517 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 202 transitions, 2061 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:02,517 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:02,517 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:09:02,517 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:04,092 INFO  L124   PetriNetUnfolderBase]: 1951/3078 cut-off events.
[2024-06-14 16:09:04,093 INFO  L125   PetriNetUnfolderBase]: For 144888/144888 co-relation queries the response was YES.
[2024-06-14 16:09:04,107 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24115 conditions, 3078 events. 1951/3078 cut-off events. For 144888/144888 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16502 event pairs, 439 based on Foata normal form. 4/3080 useless extension candidates. Maximal degree in co-relation 24031. Up to 2919 conditions per place. 
[2024-06-14 16:09:04,116 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 212 selfloop transitions, 20 changer transitions 0/237 dead transitions.
[2024-06-14 16:09:04,116 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 237 transitions, 2665 flow
[2024-06-14 16:09:04,118 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:09:04,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:09:04,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 16:09:04,119 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-14 16:09:04,119 INFO  L175             Difference]: Start difference. First operand has 172 places, 202 transitions, 2061 flow. Second operand 9 states and 170 transitions.
[2024-06-14 16:09:04,119 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 237 transitions, 2665 flow
[2024-06-14 16:09:04,216 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 237 transitions, 2537 flow, removed 56 selfloop flow, removed 4 redundant places.
[2024-06-14 16:09:04,218 INFO  L231             Difference]: Finished difference. Result has 177 places, 204 transitions, 2036 flow
[2024-06-14 16:09:04,218 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2036, PETRI_PLACES=177, PETRI_TRANSITIONS=204}
[2024-06-14 16:09:04,219 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places.
[2024-06-14 16:09:04,219 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 204 transitions, 2036 flow
[2024-06-14 16:09:04,219 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:04,219 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:04,219 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:04,219 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 16:09:04,220 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:04,220 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:04,220 INFO  L85        PathProgramCache]: Analyzing trace with hash -313914851, now seen corresponding path program 3 times
[2024-06-14 16:09:04,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:04,220 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867872006]
[2024-06-14 16:09:04,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:04,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:04,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:16,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:16,556 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:16,556 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867872006]
[2024-06-14 16:09:16,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867872006] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:16,556 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:16,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:09:16,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967815229]
[2024-06-14 16:09:16,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:16,557 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:09:16,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:16,557 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:09:16,557 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:09:16,686 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:09:16,687 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 204 transitions, 2036 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:16,687 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:16,687 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:09:16,687 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:18,207 INFO  L124   PetriNetUnfolderBase]: 1968/3105 cut-off events.
[2024-06-14 16:09:18,207 INFO  L125   PetriNetUnfolderBase]: For 152182/152182 co-relation queries the response was YES.
[2024-06-14 16:09:18,222 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24458 conditions, 3105 events. 1968/3105 cut-off events. For 152182/152182 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 16681 event pairs, 432 based on Foata normal form. 4/3107 useless extension candidates. Maximal degree in co-relation 24372. Up to 2905 conditions per place. 
[2024-06-14 16:09:18,233 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 214 selfloop transitions, 23 changer transitions 0/242 dead transitions.
[2024-06-14 16:09:18,233 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 242 transitions, 2700 flow
[2024-06-14 16:09:18,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:09:18,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:09:18,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-14 16:09:18,235 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-14 16:09:18,235 INFO  L175             Difference]: Start difference. First operand has 177 places, 204 transitions, 2036 flow. Second operand 9 states and 172 transitions.
[2024-06-14 16:09:18,236 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 242 transitions, 2700 flow
[2024-06-14 16:09:18,329 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 242 transitions, 2615 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-14 16:09:18,332 INFO  L231             Difference]: Finished difference. Result has 180 places, 208 transitions, 2116 flow
[2024-06-14 16:09:18,332 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2116, PETRI_PLACES=180, PETRI_TRANSITIONS=208}
[2024-06-14 16:09:18,333 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places.
[2024-06-14 16:09:18,333 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 208 transitions, 2116 flow
[2024-06-14 16:09:18,333 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:18,333 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:18,333 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:18,333 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 16:09:18,333 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:18,334 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:18,334 INFO  L85        PathProgramCache]: Analyzing trace with hash -313761029, now seen corresponding path program 1 times
[2024-06-14 16:09:18,334 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:18,334 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476587441]
[2024-06-14 16:09:18,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:18,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:18,402 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:29,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:29,180 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:29,180 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476587441]
[2024-06-14 16:09:29,180 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476587441] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:29,180 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:29,180 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:09:29,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851673799]
[2024-06-14 16:09:29,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:29,180 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:09:29,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:29,181 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:09:29,181 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:09:29,343 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:09:29,344 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 208 transitions, 2116 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:29,344 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:29,344 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:09:29,344 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:30,940 INFO  L124   PetriNetUnfolderBase]: 2026/3203 cut-off events.
[2024-06-14 16:09:30,940 INFO  L125   PetriNetUnfolderBase]: For 170233/170233 co-relation queries the response was YES.
[2024-06-14 16:09:30,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25480 conditions, 3203 events. 2026/3203 cut-off events. For 170233/170233 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17419 event pairs, 445 based on Foata normal form. 16/3217 useless extension candidates. Maximal degree in co-relation 25392. Up to 2961 conditions per place. 
[2024-06-14 16:09:30,969 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 222 selfloop transitions, 22 changer transitions 0/249 dead transitions.
[2024-06-14 16:09:30,969 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 249 transitions, 2798 flow
[2024-06-14 16:09:30,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:09:30,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:09:30,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-14 16:09:30,972 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-14 16:09:30,972 INFO  L175             Difference]: Start difference. First operand has 180 places, 208 transitions, 2116 flow. Second operand 10 states and 189 transitions.
[2024-06-14 16:09:30,972 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 249 transitions, 2798 flow
[2024-06-14 16:09:31,107 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 249 transitions, 2672 flow, removed 46 selfloop flow, removed 6 redundant places.
[2024-06-14 16:09:31,109 INFO  L231             Difference]: Finished difference. Result has 184 places, 209 transitions, 2085 flow
[2024-06-14 16:09:31,110 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2085, PETRI_PLACES=184, PETRI_TRANSITIONS=209}
[2024-06-14 16:09:31,110 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 141 predicate places.
[2024-06-14 16:09:31,110 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 209 transitions, 2085 flow
[2024-06-14 16:09:31,110 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:31,110 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:31,110 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:31,110 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 16:09:31,110 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:31,111 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:31,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -454438995, now seen corresponding path program 4 times
[2024-06-14 16:09:31,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:31,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488563597]
[2024-06-14 16:09:31,111 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:31,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:31,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:43,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:43,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:43,278 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488563597]
[2024-06-14 16:09:43,278 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488563597] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:43,278 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:43,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:09:43,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494378356]
[2024-06-14 16:09:43,279 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:43,279 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:09:43,279 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:43,279 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:09:43,279 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:09:43,450 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:09:43,451 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 209 transitions, 2085 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:43,451 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:43,451 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:09:43,451 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:44,917 INFO  L124   PetriNetUnfolderBase]: 2054/3251 cut-off events.
[2024-06-14 16:09:44,918 INFO  L125   PetriNetUnfolderBase]: For 167546/167546 co-relation queries the response was YES.
[2024-06-14 16:09:44,937 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25761 conditions, 3251 events. 2054/3251 cut-off events. For 167546/167546 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17706 event pairs, 452 based on Foata normal form. 4/3253 useless extension candidates. Maximal degree in co-relation 25672. Up to 3075 conditions per place. 
[2024-06-14 16:09:44,950 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 214 selfloop transitions, 25 changer transitions 0/244 dead transitions.
[2024-06-14 16:09:44,950 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 244 transitions, 2724 flow
[2024-06-14 16:09:44,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:09:44,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:09:44,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-14 16:09:44,953 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4470899470899471
[2024-06-14 16:09:44,953 INFO  L175             Difference]: Start difference. First operand has 184 places, 209 transitions, 2085 flow. Second operand 9 states and 169 transitions.
[2024-06-14 16:09:44,953 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 244 transitions, 2724 flow
[2024-06-14 16:09:45,130 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 244 transitions, 2665 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-14 16:09:45,133 INFO  L231             Difference]: Finished difference. Result has 185 places, 214 transitions, 2170 flow
[2024-06-14 16:09:45,133 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2026, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2170, PETRI_PLACES=185, PETRI_TRANSITIONS=214}
[2024-06-14 16:09:45,137 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places.
[2024-06-14 16:09:45,137 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 214 transitions, 2170 flow
[2024-06-14 16:09:45,138 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:45,138 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:45,138 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:45,138 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 16:09:45,138 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:45,139 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:45,139 INFO  L85        PathProgramCache]: Analyzing trace with hash -195010019, now seen corresponding path program 5 times
[2024-06-14 16:09:45,139 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:45,139 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600916579]
[2024-06-14 16:09:45,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:45,139 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:45,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:55,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:55,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:55,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600916579]
[2024-06-14 16:09:55,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600916579] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:55,962 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:55,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:09:55,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987995434]
[2024-06-14 16:09:55,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:55,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:09:55,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:55,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:09:55,963 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:09:56,247 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:09:56,247 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 214 transitions, 2170 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:56,247 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:56,247 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:09:56,247 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:57,831 INFO  L124   PetriNetUnfolderBase]: 2096/3317 cut-off events.
[2024-06-14 16:09:57,831 INFO  L125   PetriNetUnfolderBase]: For 179198/179198 co-relation queries the response was YES.
[2024-06-14 16:09:57,848 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26674 conditions, 3317 events. 2096/3317 cut-off events. For 179198/179198 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18168 event pairs, 452 based on Foata normal form. 4/3319 useless extension candidates. Maximal degree in co-relation 26584. Up to 3043 conditions per place. 
[2024-06-14 16:09:57,860 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 211 selfloop transitions, 36 changer transitions 0/252 dead transitions.
[2024-06-14 16:09:57,860 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 252 transitions, 3038 flow
[2024-06-14 16:09:57,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:09:57,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:09:57,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-14 16:09:57,862 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603174603174603
[2024-06-14 16:09:57,863 INFO  L175             Difference]: Start difference. First operand has 185 places, 214 transitions, 2170 flow. Second operand 9 states and 174 transitions.
[2024-06-14 16:09:57,863 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 252 transitions, 3038 flow
[2024-06-14 16:09:57,983 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 252 transitions, 2935 flow, removed 34 selfloop flow, removed 5 redundant places.
[2024-06-14 16:09:57,987 INFO  L231             Difference]: Finished difference. Result has 190 places, 219 transitions, 2292 flow
[2024-06-14 16:09:57,987 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2292, PETRI_PLACES=190, PETRI_TRANSITIONS=219}
[2024-06-14 16:09:57,987 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-14 16:09:57,988 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 219 transitions, 2292 flow
[2024-06-14 16:09:57,988 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:09:57,988 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:57,988 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:57,988 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 16:09:57,988 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:57,988 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:57,988 INFO  L85        PathProgramCache]: Analyzing trace with hash 4439641, now seen corresponding path program 6 times
[2024-06-14 16:09:57,989 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:57,989 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94622403]
[2024-06-14 16:09:57,989 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:57,989 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:58,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:09,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:09,681 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:09,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94622403]
[2024-06-14 16:10:09,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94622403] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:09,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:09,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:10:09,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094420160]
[2024-06-14 16:10:09,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:09,681 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:10:09,682 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:09,682 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:10:09,682 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:10:09,935 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:10:09,936 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 219 transitions, 2292 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:09,936 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:09,936 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:10:09,936 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:11,534 INFO  L124   PetriNetUnfolderBase]: 2088/3305 cut-off events.
[2024-06-14 16:10:11,534 INFO  L125   PetriNetUnfolderBase]: For 183374/183374 co-relation queries the response was YES.
[2024-06-14 16:10:11,554 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26680 conditions, 3305 events. 2088/3305 cut-off events. For 183374/183374 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18079 event pairs, 457 based on Foata normal form. 4/3307 useless extension candidates. Maximal degree in co-relation 26588. Up to 3096 conditions per place. 
[2024-06-14 16:10:11,567 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 212 selfloop transitions, 33 changer transitions 0/250 dead transitions.
[2024-06-14 16:10:11,567 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 250 transitions, 2907 flow
[2024-06-14 16:10:11,569 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:10:11,569 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:10:11,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 16:10:11,570 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-14 16:10:11,570 INFO  L175             Difference]: Start difference. First operand has 190 places, 219 transitions, 2292 flow. Second operand 9 states and 170 transitions.
[2024-06-14 16:10:11,570 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 250 transitions, 2907 flow
[2024-06-14 16:10:11,732 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 250 transitions, 2715 flow, removed 78 selfloop flow, removed 5 redundant places.
[2024-06-14 16:10:11,735 INFO  L231             Difference]: Finished difference. Result has 194 places, 220 transitions, 2222 flow
[2024-06-14 16:10:11,735 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2222, PETRI_PLACES=194, PETRI_TRANSITIONS=220}
[2024-06-14 16:10:11,736 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-14 16:10:11,736 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 220 transitions, 2222 flow
[2024-06-14 16:10:11,736 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:11,736 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:11,736 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:11,736 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 16:10:11,737 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:11,737 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:11,737 INFO  L85        PathProgramCache]: Analyzing trace with hash -454433043, now seen corresponding path program 2 times
[2024-06-14 16:10:11,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:11,737 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920216953]
[2024-06-14 16:10:11,737 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:11,737 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:11,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:23,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-14 16:10:23,276 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:23,276 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920216953]
[2024-06-14 16:10:23,276 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920216953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:23,276 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:23,276 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:10:23,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197245382]
[2024-06-14 16:10:23,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:23,276 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:10:23,276 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:23,277 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:10:23,277 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:10:23,600 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:10:23,600 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 220 transitions, 2222 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:23,600 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:23,600 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:10:23,600 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:25,366 INFO  L124   PetriNetUnfolderBase]: 2157/3419 cut-off events.
[2024-06-14 16:10:25,366 INFO  L125   PetriNetUnfolderBase]: For 198544/198544 co-relation queries the response was YES.
[2024-06-14 16:10:25,385 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27278 conditions, 3419 events. 2157/3419 cut-off events. For 198544/198544 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18919 event pairs, 467 based on Foata normal form. 16/3433 useless extension candidates. Maximal degree in co-relation 27184. Up to 3160 conditions per place. 
[2024-06-14 16:10:25,398 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 229 selfloop transitions, 27 changer transitions 0/261 dead transitions.
[2024-06-14 16:10:25,399 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 261 transitions, 2924 flow
[2024-06-14 16:10:25,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:10:25,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:10:25,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-14 16:10:25,402 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-14 16:10:25,402 INFO  L175             Difference]: Start difference. First operand has 194 places, 220 transitions, 2222 flow. Second operand 10 states and 188 transitions.
[2024-06-14 16:10:25,402 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 261 transitions, 2924 flow
[2024-06-14 16:10:25,529 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 261 transitions, 2851 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-14 16:10:25,532 INFO  L231             Difference]: Finished difference. Result has 198 places, 224 transitions, 2270 flow
[2024-06-14 16:10:25,533 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2270, PETRI_PLACES=198, PETRI_TRANSITIONS=224}
[2024-06-14 16:10:25,534 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 155 predicate places.
[2024-06-14 16:10:25,534 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 224 transitions, 2270 flow
[2024-06-14 16:10:25,534 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:25,534 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:25,534 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:25,535 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 16:10:25,535 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:25,535 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:25,535 INFO  L85        PathProgramCache]: Analyzing trace with hash -247779603, now seen corresponding path program 3 times
[2024-06-14 16:10:25,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:25,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768608863]
[2024-06-14 16:10:25,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:25,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:25,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:40,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:40,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:40,691 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768608863]
[2024-06-14 16:10:40,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768608863] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:40,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:40,691 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:10:40,691 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267790644]
[2024-06-14 16:10:40,691 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:40,692 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:10:40,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:40,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:10:40,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:10:41,073 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:10:41,073 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 224 transitions, 2270 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:41,073 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:41,073 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:10:41,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:42,844 INFO  L124   PetriNetUnfolderBase]: 2215/3527 cut-off events.
[2024-06-14 16:10:42,844 INFO  L125   PetriNetUnfolderBase]: For 210132/210132 co-relation queries the response was YES.
[2024-06-14 16:10:42,865 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28292 conditions, 3527 events. 2215/3527 cut-off events. For 210132/210132 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 19730 event pairs, 482 based on Foata normal form. 16/3541 useless extension candidates. Maximal degree in co-relation 28196. Up to 3171 conditions per place. 
[2024-06-14 16:10:42,879 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 212 selfloop transitions, 49 changer transitions 0/266 dead transitions.
[2024-06-14 16:10:42,879 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 266 transitions, 2990 flow
[2024-06-14 16:10:42,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:10:42,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:10:42,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions.
[2024-06-14 16:10:42,886 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4264069264069264
[2024-06-14 16:10:42,887 INFO  L175             Difference]: Start difference. First operand has 198 places, 224 transitions, 2270 flow. Second operand 11 states and 197 transitions.
[2024-06-14 16:10:42,887 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 266 transitions, 2990 flow
[2024-06-14 16:10:43,039 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 266 transitions, 2929 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-14 16:10:43,042 INFO  L231             Difference]: Finished difference. Result has 202 places, 225 transitions, 2365 flow
[2024-06-14 16:10:43,042 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2209, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2365, PETRI_PLACES=202, PETRI_TRANSITIONS=225}
[2024-06-14 16:10:43,042 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 159 predicate places.
[2024-06-14 16:10:43,042 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 225 transitions, 2365 flow
[2024-06-14 16:10:43,042 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:43,043 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:43,043 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:43,043 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 16:10:43,043 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:43,043 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:43,043 INFO  L85        PathProgramCache]: Analyzing trace with hash 1582742389, now seen corresponding path program 4 times
[2024-06-14 16:10:43,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:43,043 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963358169]
[2024-06-14 16:10:43,043 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:43,043 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:43,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:57,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:57,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:57,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963358169]
[2024-06-14 16:10:57,938 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963358169] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:57,938 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:57,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:10:57,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131688153]
[2024-06-14 16:10:57,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:57,938 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:10:57,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:57,938 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:10:57,938 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:10:58,227 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:10:58,227 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 225 transitions, 2365 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:58,227 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:58,227 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:10:58,227 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:00,024 INFO  L124   PetriNetUnfolderBase]: 2317/3711 cut-off events.
[2024-06-14 16:11:00,024 INFO  L125   PetriNetUnfolderBase]: For 231852/231852 co-relation queries the response was YES.
[2024-06-14 16:11:00,050 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30413 conditions, 3711 events. 2317/3711 cut-off events. For 231852/231852 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 21178 event pairs, 507 based on Foata normal form. 12/3721 useless extension candidates. Maximal degree in co-relation 30316. Up to 2795 conditions per place. 
[2024-06-14 16:11:00,063 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 209 selfloop transitions, 55 changer transitions 0/269 dead transitions.
[2024-06-14 16:11:00,063 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 269 transitions, 3345 flow
[2024-06-14 16:11:00,066 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:11:00,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:11:00,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-14 16:11:00,066 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-14 16:11:00,066 INFO  L175             Difference]: Start difference. First operand has 202 places, 225 transitions, 2365 flow. Second operand 10 states and 195 transitions.
[2024-06-14 16:11:00,066 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 269 transitions, 3345 flow
[2024-06-14 16:11:00,234 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 269 transitions, 3231 flow, removed 11 selfloop flow, removed 9 redundant places.
[2024-06-14 16:11:00,237 INFO  L231             Difference]: Finished difference. Result has 203 places, 227 transitions, 2465 flow
[2024-06-14 16:11:00,237 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2465, PETRI_PLACES=203, PETRI_TRANSITIONS=227}
[2024-06-14 16:11:00,238 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places.
[2024-06-14 16:11:00,238 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 227 transitions, 2465 flow
[2024-06-14 16:11:00,238 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:00,238 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:00,238 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:00,238 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 16:11:00,238 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:00,238 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:00,238 INFO  L85        PathProgramCache]: Analyzing trace with hash 1575123829, now seen corresponding path program 5 times
[2024-06-14 16:11:00,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:00,239 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330688446]
[2024-06-14 16:11:00,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:00,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:00,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:12,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:12,334 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:12,334 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330688446]
[2024-06-14 16:11:12,334 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330688446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:12,334 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:12,334 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:11:12,334 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026035263]
[2024-06-14 16:11:12,334 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:12,334 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:11:12,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:12,335 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:11:12,335 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:11:12,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:11:12,623 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 227 transitions, 2465 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:12,623 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:12,623 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:11:12,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:14,454 INFO  L124   PetriNetUnfolderBase]: 2289/3667 cut-off events.
[2024-06-14 16:11:14,455 INFO  L125   PetriNetUnfolderBase]: For 228160/228160 co-relation queries the response was YES.
[2024-06-14 16:11:14,475 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29548 conditions, 3667 events. 2289/3667 cut-off events. For 228160/228160 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 20945 event pairs, 510 based on Foata normal form. 16/3681 useless extension candidates. Maximal degree in co-relation 29450. Up to 3355 conditions per place. 
[2024-06-14 16:11:14,488 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 224 selfloop transitions, 35 changer transitions 0/264 dead transitions.
[2024-06-14 16:11:14,488 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 264 transitions, 3125 flow
[2024-06-14 16:11:14,490 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:11:14,490 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:11:14,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-14 16:11:14,490 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-14 16:11:14,490 INFO  L175             Difference]: Start difference. First operand has 203 places, 227 transitions, 2465 flow. Second operand 10 states and 189 transitions.
[2024-06-14 16:11:14,491 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 264 transitions, 3125 flow
[2024-06-14 16:11:14,678 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 264 transitions, 3037 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-14 16:11:14,681 INFO  L231             Difference]: Finished difference. Result has 207 places, 227 transitions, 2454 flow
[2024-06-14 16:11:14,681 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2377, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2454, PETRI_PLACES=207, PETRI_TRANSITIONS=227}
[2024-06-14 16:11:14,681 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 164 predicate places.
[2024-06-14 16:11:14,682 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 227 transitions, 2454 flow
[2024-06-14 16:11:14,682 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:14,682 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:14,682 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:14,682 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 16:11:14,682 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:14,682 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:14,682 INFO  L85        PathProgramCache]: Analyzing trace with hash -1394722191, now seen corresponding path program 7 times
[2024-06-14 16:11:14,682 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:14,682 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270959615]
[2024-06-14 16:11:14,682 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:14,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:14,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:26,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:26,208 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:26,208 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270959615]
[2024-06-14 16:11:26,208 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270959615] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:26,208 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:26,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:11:26,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341994508]
[2024-06-14 16:11:26,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:26,209 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:11:26,209 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:26,209 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:11:26,209 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:11:26,434 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:11:26,434 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 227 transitions, 2454 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:26,434 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:26,434 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:11:26,434 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:27,912 INFO  L124   PetriNetUnfolderBase]: 2281/3651 cut-off events.
[2024-06-14 16:11:27,912 INFO  L125   PetriNetUnfolderBase]: For 218503/218503 co-relation queries the response was YES.
[2024-06-14 16:11:27,933 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29322 conditions, 3651 events. 2281/3651 cut-off events. For 218503/218503 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20867 event pairs, 497 based on Foata normal form. 4/3651 useless extension candidates. Maximal degree in co-relation 29222. Up to 3323 conditions per place. 
[2024-06-14 16:11:27,945 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 212 selfloop transitions, 46 changer transitions 0/263 dead transitions.
[2024-06-14 16:11:27,945 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 263 transitions, 3228 flow
[2024-06-14 16:11:27,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:11:27,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:11:27,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 16:11:27,948 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 16:11:27,948 INFO  L175             Difference]: Start difference. First operand has 207 places, 227 transitions, 2454 flow. Second operand 9 states and 171 transitions.
[2024-06-14 16:11:27,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 263 transitions, 3228 flow
[2024-06-14 16:11:28,111 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 263 transitions, 3127 flow, removed 11 selfloop flow, removed 9 redundant places.
[2024-06-14 16:11:28,114 INFO  L231             Difference]: Finished difference. Result has 208 places, 234 transitions, 2654 flow
[2024-06-14 16:11:28,115 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2353, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2654, PETRI_PLACES=208, PETRI_TRANSITIONS=234}
[2024-06-14 16:11:28,115 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 165 predicate places.
[2024-06-14 16:11:28,115 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 234 transitions, 2654 flow
[2024-06-14 16:11:28,115 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:28,115 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:28,116 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:28,116 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 16:11:28,116 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:28,116 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:28,116 INFO  L85        PathProgramCache]: Analyzing trace with hash 1058066827, now seen corresponding path program 6 times
[2024-06-14 16:11:28,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:28,116 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830817790]
[2024-06-14 16:11:28,116 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:28,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:28,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:40,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:40,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:40,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830817790]
[2024-06-14 16:11:40,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830817790] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:40,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:40,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:11:40,646 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463086616]
[2024-06-14 16:11:40,646 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:40,647 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:11:40,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:40,647 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:11:40,647 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:11:40,994 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:11:40,994 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 234 transitions, 2654 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:40,994 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:40,994 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:11:40,995 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:42,822 INFO  L124   PetriNetUnfolderBase]: 2383/3825 cut-off events.
[2024-06-14 16:11:42,823 INFO  L125   PetriNetUnfolderBase]: For 252095/252095 co-relation queries the response was YES.
[2024-06-14 16:11:42,846 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31541 conditions, 3825 events. 2383/3825 cut-off events. For 252095/252095 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 22019 event pairs, 498 based on Foata normal form. 12/3833 useless extension candidates. Maximal degree in co-relation 31440. Up to 2582 conditions per place. 
[2024-06-14 16:11:42,861 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 188 selfloop transitions, 84 changer transitions 0/277 dead transitions.
[2024-06-14 16:11:42,861 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 277 transitions, 3666 flow
[2024-06-14 16:11:42,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:11:42,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:11:42,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-14 16:11:42,864 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-14 16:11:42,864 INFO  L175             Difference]: Start difference. First operand has 208 places, 234 transitions, 2654 flow. Second operand 10 states and 195 transitions.
[2024-06-14 16:11:42,864 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 277 transitions, 3666 flow
[2024-06-14 16:11:43,109 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 277 transitions, 3456 flow, removed 83 selfloop flow, removed 5 redundant places.
[2024-06-14 16:11:43,112 INFO  L231             Difference]: Finished difference. Result has 213 places, 236 transitions, 2724 flow
[2024-06-14 16:11:43,113 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2444, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2724, PETRI_PLACES=213, PETRI_TRANSITIONS=236}
[2024-06-14 16:11:43,113 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 170 predicate places.
[2024-06-14 16:11:43,113 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 236 transitions, 2724 flow
[2024-06-14 16:11:43,113 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:43,113 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:43,114 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:43,114 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 16:11:43,114 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:43,114 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:43,114 INFO  L85        PathProgramCache]: Analyzing trace with hash -1187914929, now seen corresponding path program 7 times
[2024-06-14 16:11:43,114 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:43,114 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975031526]
[2024-06-14 16:11:43,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:43,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:43,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:55,920 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:55,920 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:55,920 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975031526]
[2024-06-14 16:11:55,920 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975031526] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:55,920 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:55,920 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:11:55,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389405918]
[2024-06-14 16:11:55,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:55,940 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:11:55,940 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:55,940 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:11:55,941 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:11:56,203 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:11:56,204 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 236 transitions, 2724 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:56,204 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:56,204 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:11:56,204 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:58,091 INFO  L124   PetriNetUnfolderBase]: 2441/3923 cut-off events.
[2024-06-14 16:11:58,091 INFO  L125   PetriNetUnfolderBase]: For 269305/269305 co-relation queries the response was YES.
[2024-06-14 16:11:58,113 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32425 conditions, 3923 events. 2441/3923 cut-off events. For 269305/269305 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 22821 event pairs, 563 based on Foata normal form. 16/3935 useless extension candidates. Maximal degree in co-relation 32324. Up to 3553 conditions per place. 
[2024-06-14 16:11:58,125 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 219 selfloop transitions, 48 changer transitions 0/272 dead transitions.
[2024-06-14 16:11:58,126 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 272 transitions, 3448 flow
[2024-06-14 16:11:58,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:11:58,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:11:58,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions.
[2024-06-14 16:11:58,128 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45476190476190476
[2024-06-14 16:11:58,128 INFO  L175             Difference]: Start difference. First operand has 213 places, 236 transitions, 2724 flow. Second operand 10 states and 191 transitions.
[2024-06-14 16:11:58,128 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 272 transitions, 3448 flow
[2024-06-14 16:11:58,350 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 272 transitions, 3307 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-14 16:11:58,353 INFO  L231             Difference]: Finished difference. Result has 217 places, 237 transitions, 2742 flow
[2024-06-14 16:11:58,354 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2591, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2742, PETRI_PLACES=217, PETRI_TRANSITIONS=237}
[2024-06-14 16:11:58,354 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places.
[2024-06-14 16:11:58,354 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 237 transitions, 2742 flow
[2024-06-14 16:11:58,354 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:58,354 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:58,354 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:58,354 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 16:11:58,354 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:58,355 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:58,355 INFO  L85        PathProgramCache]: Analyzing trace with hash 744367597, now seen corresponding path program 8 times
[2024-06-14 16:11:58,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:58,355 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929340627]
[2024-06-14 16:11:58,355 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:58,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:58,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:11,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:11,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:11,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929340627]
[2024-06-14 16:12:11,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929340627] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:11,337 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:11,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:12:11,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374244707]
[2024-06-14 16:12:11,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:11,337 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:12:11,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:11,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:12:11,338 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:12:11,559 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:12:11,559 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 237 transitions, 2742 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:11,559 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:11,559 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:12:11,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:14,015 INFO  L124   PetriNetUnfolderBase]: 2579/4167 cut-off events.
[2024-06-14 16:12:14,016 INFO  L125   PetriNetUnfolderBase]: For 292276/292276 co-relation queries the response was YES.
[2024-06-14 16:12:14,045 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34978 conditions, 4167 events. 2579/4167 cut-off events. For 292276/292276 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 24723 event pairs, 589 based on Foata normal form. 12/4175 useless extension candidates. Maximal degree in co-relation 34875. Up to 3527 conditions per place. 
[2024-06-14 16:12:14,063 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 194 selfloop transitions, 90 changer transitions 0/289 dead transitions.
[2024-06-14 16:12:14,063 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 289 transitions, 3811 flow
[2024-06-14 16:12:14,065 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:12:14,065 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:12:14,065 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions.
[2024-06-14 16:12:14,065 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4653679653679654
[2024-06-14 16:12:14,066 INFO  L175             Difference]: Start difference. First operand has 217 places, 237 transitions, 2742 flow. Second operand 11 states and 215 transitions.
[2024-06-14 16:12:14,066 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 289 transitions, 3811 flow
[2024-06-14 16:12:14,320 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 289 transitions, 3696 flow, removed 11 selfloop flow, removed 8 redundant places.
[2024-06-14 16:12:14,324 INFO  L231             Difference]: Finished difference. Result has 220 places, 242 transitions, 2926 flow
[2024-06-14 16:12:14,324 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2627, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2926, PETRI_PLACES=220, PETRI_TRANSITIONS=242}
[2024-06-14 16:12:14,324 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places.
[2024-06-14 16:12:14,324 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 242 transitions, 2926 flow
[2024-06-14 16:12:14,324 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:14,324 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:14,324 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:14,324 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 16:12:14,325 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:12:14,325 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:14,325 INFO  L85        PathProgramCache]: Analyzing trace with hash -1388996739, now seen corresponding path program 9 times
[2024-06-14 16:12:14,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:14,325 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379946525]
[2024-06-14 16:12:14,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:14,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:14,391 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:26,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:26,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:26,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379946525]
[2024-06-14 16:12:26,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379946525] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:26,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:26,365 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:12:26,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67846672]
[2024-06-14 16:12:26,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:26,365 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:12:26,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:26,366 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:12:26,366 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:12:26,662 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:12:26,663 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 242 transitions, 2926 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:26,663 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:26,663 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:12:26,663 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:28,589 INFO  L124   PetriNetUnfolderBase]: 2620/4238 cut-off events.
[2024-06-14 16:12:28,589 INFO  L125   PetriNetUnfolderBase]: For 303966/303966 co-relation queries the response was YES.
[2024-06-14 16:12:28,614 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35816 conditions, 4238 events. 2620/4238 cut-off events. For 303966/303966 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 25358 event pairs, 599 based on Foata normal form. 12/4246 useless extension candidates. Maximal degree in co-relation 35712. Up to 3674 conditions per place. 
[2024-06-14 16:12:28,627 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 226 selfloop transitions, 50 changer transitions 0/281 dead transitions.
[2024-06-14 16:12:28,627 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 281 transitions, 3700 flow
[2024-06-14 16:12:28,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:12:28,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:12:28,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-14 16:12:28,630 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4595238095238095
[2024-06-14 16:12:28,630 INFO  L175             Difference]: Start difference. First operand has 220 places, 242 transitions, 2926 flow. Second operand 10 states and 193 transitions.
[2024-06-14 16:12:28,630 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 281 transitions, 3700 flow
[2024-06-14 16:12:28,919 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 281 transitions, 3611 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-14 16:12:28,922 INFO  L231             Difference]: Finished difference. Result has 225 places, 243 transitions, 2995 flow
[2024-06-14 16:12:28,922 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2837, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2995, PETRI_PLACES=225, PETRI_TRANSITIONS=243}
[2024-06-14 16:12:28,923 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places.
[2024-06-14 16:12:28,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 243 transitions, 2995 flow
[2024-06-14 16:12:28,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:28,923 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:28,923 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:28,923 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 16:12:28,923 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-14 16:12:28,923 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:28,923 INFO  L85        PathProgramCache]: Analyzing trace with hash 744100687, now seen corresponding path program 10 times
[2024-06-14 16:12:28,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:28,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764627543]
[2024-06-14 16:12:28,924 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:28,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:29,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:42,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:42,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:42,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764627543]
[2024-06-14 16:12:42,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764627543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:42,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:42,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:12:42,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084902173]
[2024-06-14 16:12:42,064 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:42,064 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:12:42,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:42,065 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:12:42,065 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:12:42,392 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:12:42,392 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 243 transitions, 2995 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:42,392 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:42,392 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:12:42,392 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:44,420 INFO  L124   PetriNetUnfolderBase]: 2592/4194 cut-off events.
[2024-06-14 16:12:44,421 INFO  L125   PetriNetUnfolderBase]: For 299172/299172 co-relation queries the response was YES.
[2024-06-14 16:12:44,446 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34845 conditions, 4194 events. 2592/4194 cut-off events. For 299172/299172 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 25035 event pairs, 598 based on Foata normal form. 16/4206 useless extension candidates. Maximal degree in co-relation 34739. Up to 3719 conditions per place. 
[2024-06-14 16:12:44,461 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 197 selfloop transitions, 76 changer transitions 0/278 dead transitions.
[2024-06-14 16:12:44,461 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 278 transitions, 3677 flow
[2024-06-14 16:12:44,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:12:44,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:12:44,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-14 16:12:44,464 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 16:12:44,464 INFO  L175             Difference]: Start difference. First operand has 225 places, 243 transitions, 2995 flow. Second operand 10 states and 190 transitions.
[2024-06-14 16:12:44,464 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 278 transitions, 3677 flow
[2024-06-14 16:12:44,798 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 278 transitions, 3539 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-14 16:12:44,801 INFO  L231             Difference]: Finished difference. Result has 228 places, 243 transitions, 3016 flow
[2024-06-14 16:12:44,801 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2857, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3016, PETRI_PLACES=228, PETRI_TRANSITIONS=243}
[2024-06-14 16:12:44,801 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-14 16:12:44,801 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 243 transitions, 3016 flow
[2024-06-14 16:12:44,801 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:44,801 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:44,802 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:44,802 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 16:12:44,802 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-14 16:12:44,802 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:44,802 INFO  L85        PathProgramCache]: Analyzing trace with hash -679551335, now seen corresponding path program 11 times
[2024-06-14 16:12:44,802 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:44,802 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273564742]
[2024-06-14 16:12:44,802 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:44,802 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:44,872 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:57,532 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:57,532 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:57,532 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273564742]
[2024-06-14 16:12:57,532 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273564742] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:57,532 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:57,532 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:12:57,532 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056000738]
[2024-06-14 16:12:57,532 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:57,533 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:12:57,533 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:57,533 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:12:57,533 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:12:57,700 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:12:57,701 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 243 transitions, 3016 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:57,701 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:57,701 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:12:57,701 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:59,753 INFO  L124   PetriNetUnfolderBase]: 2625/4263 cut-off events.
[2024-06-14 16:12:59,753 INFO  L125   PetriNetUnfolderBase]: For 301998/301998 co-relation queries the response was YES.
[2024-06-14 16:12:59,781 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35113 conditions, 4263 events. 2625/4263 cut-off events. For 301998/301998 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 25693 event pairs, 611 based on Foata normal form. 16/4275 useless extension candidates. Maximal degree in co-relation 35006. Up to 3868 conditions per place. 
[2024-06-14 16:12:59,796 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 224 selfloop transitions, 50 changer transitions 0/279 dead transitions.
[2024-06-14 16:12:59,796 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 279 transitions, 3752 flow
[2024-06-14 16:12:59,798 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:12:59,798 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:12:59,799 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-14 16:12:59,799 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 16:12:59,799 INFO  L175             Difference]: Start difference. First operand has 228 places, 243 transitions, 3016 flow. Second operand 10 states and 190 transitions.
[2024-06-14 16:12:59,799 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 279 transitions, 3752 flow
[2024-06-14 16:13:00,122 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 279 transitions, 3587 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-14 16:13:00,125 INFO  L231             Difference]: Finished difference. Result has 229 places, 244 transitions, 3012 flow
[2024-06-14 16:13:00,126 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2851, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3012, PETRI_PLACES=229, PETRI_TRANSITIONS=244}
[2024-06-14 16:13:00,126 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places.
[2024-06-14 16:13:00,126 INFO  L495      AbstractCegarLoop]: Abstraction has has 229 places, 244 transitions, 3012 flow
[2024-06-14 16:13:00,126 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:00,126 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:00,126 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:00,126 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 16:13:00,126 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-14 16:13:00,127 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:00,127 INFO  L85        PathProgramCache]: Analyzing trace with hash -679543895, now seen corresponding path program 12 times
[2024-06-14 16:13:00,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:00,127 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344406728]
[2024-06-14 16:13:00,127 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:00,127 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:00,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:10,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:10,838 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:10,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344406728]
[2024-06-14 16:13:10,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344406728] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:10,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:10,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:13:10,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470624639]
[2024-06-14 16:13:10,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:10,839 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:13:10,839 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:10,839 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:13:10,839 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:13:11,170 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:13:11,171 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 244 transitions, 3012 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:11,171 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:11,171 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:13:11,171 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:13,143 INFO  L124   PetriNetUnfolderBase]: 2605/4231 cut-off events.
[2024-06-14 16:13:13,144 INFO  L125   PetriNetUnfolderBase]: For 291128/291128 co-relation queries the response was YES.
[2024-06-14 16:13:13,179 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34261 conditions, 4231 events. 2605/4231 cut-off events. For 291128/291128 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 25452 event pairs, 582 based on Foata normal form. 12/4239 useless extension candidates. Maximal degree in co-relation 34153. Up to 3624 conditions per place. 
[2024-06-14 16:13:13,196 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 223 selfloop transitions, 61 changer transitions 0/289 dead transitions.
[2024-06-14 16:13:13,196 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 289 transitions, 3772 flow
[2024-06-14 16:13:13,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:13:13,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:13:13,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions.
[2024-06-14 16:13:13,199 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4588744588744589
[2024-06-14 16:13:13,199 INFO  L175             Difference]: Start difference. First operand has 229 places, 244 transitions, 3012 flow. Second operand 11 states and 212 transitions.
[2024-06-14 16:13:13,199 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 289 transitions, 3772 flow
[2024-06-14 16:13:13,589 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 289 transitions, 3599 flow, removed 17 selfloop flow, removed 9 redundant places.
[2024-06-14 16:13:13,592 INFO  L231             Difference]: Finished difference. Result has 231 places, 244 transitions, 2967 flow
[2024-06-14 16:13:13,592 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2839, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2967, PETRI_PLACES=231, PETRI_TRANSITIONS=244}
[2024-06-14 16:13:13,592 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places.
[2024-06-14 16:13:13,592 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 244 transitions, 2967 flow
[2024-06-14 16:13:13,593 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:13,593 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:13,593 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:13,593 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 16:13:13,593 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:13,593 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:13,593 INFO  L85        PathProgramCache]: Analyzing trace with hash 1217491922, now seen corresponding path program 1 times
[2024-06-14 16:13:13,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:13,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673226690]
[2024-06-14 16:13:13,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:13,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:13,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:28,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:28,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:28,833 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673226690]
[2024-06-14 16:13:28,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673226690] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:28,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:28,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:13:28,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906020378]
[2024-06-14 16:13:28,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:28,833 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:13:28,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:28,834 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:13:28,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:13:29,102 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:13:29,102 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 244 transitions, 2967 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:29,102 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:29,102 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:13:29,102 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:30,799 INFO  L124   PetriNetUnfolderBase]: 2524/4160 cut-off events.
[2024-06-14 16:13:30,800 INFO  L125   PetriNetUnfolderBase]: For 291354/291355 co-relation queries the response was YES.
[2024-06-14 16:13:30,826 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33769 conditions, 4160 events. 2524/4160 cut-off events. For 291354/291355 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 25528 event pairs, 554 based on Foata normal form. 4/4162 useless extension candidates. Maximal degree in co-relation 33660. Up to 3818 conditions per place. 
[2024-06-14 16:13:30,841 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 220 selfloop transitions, 43 changer transitions 0/283 dead transitions.
[2024-06-14 16:13:30,841 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 283 transitions, 4087 flow
[2024-06-14 16:13:30,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:13:30,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:13:30,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-14 16:13:30,842 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-14 16:13:30,842 INFO  L175             Difference]: Start difference. First operand has 231 places, 244 transitions, 2967 flow. Second operand 9 states and 176 transitions.
[2024-06-14 16:13:30,842 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 283 transitions, 4087 flow
[2024-06-14 16:13:31,181 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 283 transitions, 3882 flow, removed 14 selfloop flow, removed 9 redundant places.
[2024-06-14 16:13:31,184 INFO  L231             Difference]: Finished difference. Result has 233 places, 256 transitions, 3079 flow
[2024-06-14 16:13:31,184 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2762, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3079, PETRI_PLACES=233, PETRI_TRANSITIONS=256}
[2024-06-14 16:13:31,185 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places.
[2024-06-14 16:13:31,185 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 256 transitions, 3079 flow
[2024-06-14 16:13:31,185 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:31,185 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:31,185 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:31,185 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 16:13:31,185 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:31,185 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:31,185 INFO  L85        PathProgramCache]: Analyzing trace with hash -74889554, now seen corresponding path program 2 times
[2024-06-14 16:13:31,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:31,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648415590]
[2024-06-14 16:13:31,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:31,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:31,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:46,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:46,696 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:46,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648415590]
[2024-06-14 16:13:46,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648415590] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:46,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:46,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:13:46,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551392193]
[2024-06-14 16:13:46,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:46,696 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:13:46,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:46,697 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:13:46,697 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:13:46,897 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:13:46,897 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 256 transitions, 3079 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:46,897 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:46,897 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:13:46,898 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:48,616 INFO  L124   PetriNetUnfolderBase]: 2533/4177 cut-off events.
[2024-06-14 16:13:48,617 INFO  L125   PetriNetUnfolderBase]: For 298142/298156 co-relation queries the response was YES.
[2024-06-14 16:13:48,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33987 conditions, 4177 events. 2533/4177 cut-off events. For 298142/298156 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 25664 event pairs, 551 based on Foata normal form. 2/4177 useless extension candidates. Maximal degree in co-relation 33876. Up to 3863 conditions per place. 
[2024-06-14 16:13:48,660 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 224 selfloop transitions, 38 changer transitions 0/282 dead transitions.
[2024-06-14 16:13:48,660 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 282 transitions, 3945 flow
[2024-06-14 16:13:48,662 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:13:48,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:13:48,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 16:13:48,662 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 16:13:48,663 INFO  L175             Difference]: Start difference. First operand has 233 places, 256 transitions, 3079 flow. Second operand 9 states and 171 transitions.
[2024-06-14 16:13:48,663 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 282 transitions, 3945 flow
[2024-06-14 16:13:49,024 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 282 transitions, 3869 flow, removed 29 selfloop flow, removed 3 redundant places.
[2024-06-14 16:13:49,028 INFO  L231             Difference]: Finished difference. Result has 239 places, 259 transitions, 3143 flow
[2024-06-14 16:13:49,028 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3009, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3143, PETRI_PLACES=239, PETRI_TRANSITIONS=259}
[2024-06-14 16:13:49,028 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 196 predicate places.
[2024-06-14 16:13:49,028 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 259 transitions, 3143 flow
[2024-06-14 16:13:49,028 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:49,028 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:49,029 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:49,029 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 16:13:49,029 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:49,029 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:49,029 INFO  L85        PathProgramCache]: Analyzing trace with hash 1221301202, now seen corresponding path program 3 times
[2024-06-14 16:13:49,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:49,029 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478481432]
[2024-06-14 16:13:49,029 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:49,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:49,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:03,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:14:03,941 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:03,941 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478481432]
[2024-06-14 16:14:03,941 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478481432] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:03,941 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:03,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:14:03,942 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849212605]
[2024-06-14 16:14:03,942 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:03,942 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:14:03,942 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:03,942 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:14:03,942 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:14:04,232 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:14:04,233 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 259 transitions, 3143 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:04,233 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:04,233 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:14:04,233 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:06,238 INFO  L124   PetriNetUnfolderBase]: 2526/4163 cut-off events.
[2024-06-14 16:14:06,238 INFO  L125   PetriNetUnfolderBase]: For 300876/300876 co-relation queries the response was YES.
[2024-06-14 16:14:06,264 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33927 conditions, 4163 events. 2526/4163 cut-off events. For 300876/300876 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 25553 event pairs, 556 based on Foata normal form. 3/4161 useless extension candidates. Maximal degree in co-relation 33815. Up to 3846 conditions per place. 
[2024-06-14 16:14:06,279 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 225 selfloop transitions, 37 changer transitions 0/282 dead transitions.
[2024-06-14 16:14:06,279 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 282 transitions, 3961 flow
[2024-06-14 16:14:06,280 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:14:06,280 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:14:06,280 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions.
[2024-06-14 16:14:06,281 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4931972789115646
[2024-06-14 16:14:06,281 INFO  L175             Difference]: Start difference. First operand has 239 places, 259 transitions, 3143 flow. Second operand 7 states and 145 transitions.
[2024-06-14 16:14:06,281 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 282 transitions, 3961 flow
[2024-06-14 16:14:06,698 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 282 transitions, 3823 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-14 16:14:06,702 INFO  L231             Difference]: Finished difference. Result has 239 places, 259 transitions, 3090 flow
[2024-06-14 16:14:06,702 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3005, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3090, PETRI_PLACES=239, PETRI_TRANSITIONS=259}
[2024-06-14 16:14:06,702 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 196 predicate places.
[2024-06-14 16:14:06,703 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 259 transitions, 3090 flow
[2024-06-14 16:14:06,703 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:06,703 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:06,703 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:06,703 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 16:14:06,703 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:06,703 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:06,704 INFO  L85        PathProgramCache]: Analyzing trace with hash 365985876, now seen corresponding path program 1 times
[2024-06-14 16:14:06,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:06,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642712518]
[2024-06-14 16:14:06,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:06,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:06,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:21,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:14:21,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:21,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642712518]
[2024-06-14 16:14:21,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642712518] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:21,593 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:21,593 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:14:21,593 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657569784]
[2024-06-14 16:14:21,593 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:21,593 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:14:21,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:21,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:14:21,594 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:14:21,747 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:14:21,748 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 259 transitions, 3090 flow. Second operand  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:21,748 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:21,748 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:14:21,748 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:23,448 INFO  L124   PetriNetUnfolderBase]: 2625/4268 cut-off events.
[2024-06-14 16:14:23,448 INFO  L125   PetriNetUnfolderBase]: For 303634/303634 co-relation queries the response was YES.
[2024-06-14 16:14:23,476 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34558 conditions, 4268 events. 2625/4268 cut-off events. For 303634/303634 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 25786 event pairs, 592 based on Foata normal form. 1/4267 useless extension candidates. Maximal degree in co-relation 34445. Up to 4087 conditions per place. 
[2024-06-14 16:14:23,493 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 243 selfloop transitions, 22 changer transitions 0/270 dead transitions.
[2024-06-14 16:14:23,494 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 270 transitions, 3650 flow
[2024-06-14 16:14:23,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 16:14:23,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 16:14:23,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions.
[2024-06-14 16:14:23,494 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48095238095238096
[2024-06-14 16:14:23,495 INFO  L175             Difference]: Start difference. First operand has 239 places, 259 transitions, 3090 flow. Second operand 5 states and 101 transitions.
[2024-06-14 16:14:23,495 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 270 transitions, 3650 flow
[2024-06-14 16:14:23,888 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 270 transitions, 3542 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-14 16:14:23,892 INFO  L231             Difference]: Finished difference. Result has 238 places, 259 transitions, 3042 flow
[2024-06-14 16:14:23,892 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2982, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3042, PETRI_PLACES=238, PETRI_TRANSITIONS=259}
[2024-06-14 16:14:23,892 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 195 predicate places.
[2024-06-14 16:14:23,892 INFO  L495      AbstractCegarLoop]: Abstraction has has 238 places, 259 transitions, 3042 flow
[2024-06-14 16:14:23,892 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:23,892 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:23,892 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:23,893 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 16:14:23,893 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-14 16:14:23,893 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:23,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 1854388735, now seen corresponding path program 1 times
[2024-06-14 16:14:23,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:23,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435158335]
[2024-06-14 16:14:23,893 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:23,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:23,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:35,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-14 16:14:35,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:35,860 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435158335]
[2024-06-14 16:14:35,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435158335] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:35,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:35,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:14:35,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994239444]
[2024-06-14 16:14:35,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:35,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:14:35,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:35,861 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:14:35,861 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:14:36,109 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:14:36,109 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 259 transitions, 3042 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:36,109 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:36,109 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:14:36,109 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:38,206 INFO  L124   PetriNetUnfolderBase]: 2642/4291 cut-off events.
[2024-06-14 16:14:38,206 INFO  L125   PetriNetUnfolderBase]: For 317377/317377 co-relation queries the response was YES.
[2024-06-14 16:14:38,233 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34873 conditions, 4291 events. 2642/4291 cut-off events. For 317377/317377 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 25804 event pairs, 445 based on Foata normal form. 4/4293 useless extension candidates. Maximal degree in co-relation 34759. Up to 4019 conditions per place. 
[2024-06-14 16:14:38,247 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 276 selfloop transitions, 20 changer transitions 0/301 dead transitions.
[2024-06-14 16:14:38,247 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 301 transitions, 3814 flow
[2024-06-14 16:14:38,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:14:38,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:14:38,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-14 16:14:38,250 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4452380952380952
[2024-06-14 16:14:38,250 INFO  L175             Difference]: Start difference. First operand has 238 places, 259 transitions, 3042 flow. Second operand 10 states and 187 transitions.
[2024-06-14 16:14:38,250 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 301 transitions, 3814 flow
[2024-06-14 16:14:38,582 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 301 transitions, 3770 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-14 16:14:38,586 INFO  L231             Difference]: Finished difference. Result has 244 places, 261 transitions, 3125 flow
[2024-06-14 16:14:38,586 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2998, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3125, PETRI_PLACES=244, PETRI_TRANSITIONS=261}
[2024-06-14 16:14:38,586 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places.
[2024-06-14 16:14:38,586 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 261 transitions, 3125 flow
[2024-06-14 16:14:38,586 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:38,587 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:38,587 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:38,587 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 16:14:38,587 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-14 16:14:38,587 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:38,587 INFO  L85        PathProgramCache]: Analyzing trace with hash -2038984211, now seen corresponding path program 2 times
[2024-06-14 16:14:38,587 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:38,587 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107161587]
[2024-06-14 16:14:38,587 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:38,587 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:38,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:49,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:14:49,872 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:49,872 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107161587]
[2024-06-14 16:14:49,873 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107161587] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:49,873 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:49,873 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:14:49,873 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37764780]
[2024-06-14 16:14:49,873 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:49,873 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:14:49,873 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:49,873 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:14:49,874 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:14:50,341 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:14:50,341 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 261 transitions, 3125 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:50,341 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:50,341 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:14:50,341 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:52,351 INFO  L124   PetriNetUnfolderBase]: 2683/4362 cut-off events.
[2024-06-14 16:14:52,351 INFO  L125   PetriNetUnfolderBase]: For 341565/341565 co-relation queries the response was YES.
[2024-06-14 16:14:52,378 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35843 conditions, 4362 events. 2683/4362 cut-off events. For 341565/341565 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 26430 event pairs, 562 based on Foata normal form. 12/4372 useless extension candidates. Maximal degree in co-relation 35728. Up to 4084 conditions per place. 
[2024-06-14 16:14:52,393 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 276 selfloop transitions, 21 changer transitions 0/302 dead transitions.
[2024-06-14 16:14:52,393 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 302 transitions, 3893 flow
[2024-06-14 16:14:52,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:14:52,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:14:52,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-14 16:14:52,395 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-14 16:14:52,395 INFO  L175             Difference]: Start difference. First operand has 244 places, 261 transitions, 3125 flow. Second operand 10 states and 188 transitions.
[2024-06-14 16:14:52,395 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 302 transitions, 3893 flow
[2024-06-14 16:14:52,806 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 302 transitions, 3784 flow, removed 36 selfloop flow, removed 8 redundant places.
[2024-06-14 16:14:52,810 INFO  L231             Difference]: Finished difference. Result has 246 places, 262 transitions, 3114 flow
[2024-06-14 16:14:52,810 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3016, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3114, PETRI_PLACES=246, PETRI_TRANSITIONS=262}
[2024-06-14 16:14:52,810 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places.
[2024-06-14 16:14:52,810 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 262 transitions, 3114 flow
[2024-06-14 16:14:52,810 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:52,810 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:52,810 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:52,811 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 16:14:52,811 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:52,811 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:52,811 INFO  L85        PathProgramCache]: Analyzing trace with hash -1141425061, now seen corresponding path program 3 times
[2024-06-14 16:14:52,811 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:52,811 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941530862]
[2024-06-14 16:14:52,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:52,812 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:52,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15