./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 bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/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-bcb38a6-m
[2024-06-04 18:05:33,073 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 18:05:33,146 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 18:05:33,151 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 18:05:33,151 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 18:05:33,174 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 18:05:33,175 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 18:05:33,175 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 18:05:33,176 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 18:05:33,179 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 18:05:33,179 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 18:05:33,179 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 18:05:33,180 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 18:05:33,181 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 18:05:33,181 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 18:05:33,182 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 18:05:33,182 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 18:05:33,182 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 18:05:33,182 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 18:05:33,183 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 18:05:33,183 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 18:05:33,183 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 18:05:33,183 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 18:05:33,184 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 18:05:33,184 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 18:05:33,184 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 18:05:33,184 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 18:05:33,184 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 18:05:33,185 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 18:05:33,185 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 18:05:33,186 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 18:05:33,186 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 18:05:33,186 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:05:33,187 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 18:05:33,187 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 18:05:33,187 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 18:05:33,187 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 18:05:33,187 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 18:05:33,187 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 18:05:33,188 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 18:05:33,188 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 18:05:33,188 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 18:05:33,188 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 18:05:33,188 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-04 18:05:33,392 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 18:05:33,438 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 18:05:33,441 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 18:05:33,441 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 18:05:33,442 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 18:05:33,443 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-04 18:05:33,612 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 18:05:33,612 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 18:05:33,613 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-04 18:05:34,770 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 18:05:35,002 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 18:05:35,003 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-04 18:05:35,024 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472e7d117/c02865719dca4db497dd28eb0446ba86/FLAG094762115
[2024-06-04 18:05:35,037 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472e7d117/c02865719dca4db497dd28eb0446ba86
[2024-06-04 18:05:35,037 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 18:05:35,038 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 18:05:35,040 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 18:05:35,040 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 18:05:35,044 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 18:05:35,045 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:05:33" (1/2) ...
[2024-06-04 18:05:35,045 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58aa0526 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:05:35, skipping insertion in model container
[2024-06-04 18:05:35,045 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:05:33" (1/2) ...
[2024-06-04 18:05:35,046 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7d71330c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:05:35, skipping insertion in model container
[2024-06-04 18:05:35,047 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:05:35" (2/2) ...
[2024-06-04 18:05:35,047 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58aa0526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35, skipping insertion in model container
[2024-06-04 18:05:35,047 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:05:35" (2/2) ...
[2024-06-04 18:05:35,048 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 18:05:35,158 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 18:05:35,159 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-04 18:05:35,160 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-04 18:05:35,161 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-04 18:05:35,161 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 18:05:35,161 INFO  L106   edCorrectnessWitness]: ghost_update [L834-L834] multithreaded = 1;
[2024-06-04 18:05:35,193 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 18:05:35,477 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:05:35,484 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-04 18:05:35,783 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:05:35,812 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 18:05:35,812 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35 WrapperNode
[2024-06-04 18:05:35,812 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 18:05:35,813 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 18:05:35,813 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 18:05:35,813 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 18:05:35,818 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (1/1) ...
[2024-06-04 18:05:35,867 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (1/1) ...
[2024-06-04 18:05:35,995 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126
[2024-06-04 18:05:35,995 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 18:05:35,996 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 18:05:35,996 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 18:05:35,996 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 18:05:36,005 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (1/1) ...
[2024-06-04 18:05:36,006 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (1/1) ...
[2024-06-04 18:05:36,103 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (1/1) ...
[2024-06-04 18:05:36,147 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-04 18:05:36,147 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (1/1) ...
[2024-06-04 18:05:36,147 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (1/1) ...
[2024-06-04 18:05:36,232 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (1/1) ...
[2024-06-04 18:05:36,233 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (1/1) ...
[2024-06-04 18:05:36,244 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (1/1) ...
[2024-06-04 18:05:36,249 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (1/1) ...
[2024-06-04 18:05:36,265 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 18:05:36,266 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 18:05:36,266 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 18:05:36,266 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 18:05:36,267 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (1/1) ...
[2024-06-04 18:05:36,271 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:05:36,278 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 18:05:36,318 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-04 18:05:36,339 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-04 18:05:36,346 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 18:05:36,347 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 18:05:36,347 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 18:05:36,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 18:05:36,347 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 18:05:36,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 18:05:36,347 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 18:05:36,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 18:05:36,348 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 18:05:36,348 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 18:05:36,348 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 18:05:36,348 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 18:05:36,349 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-04 18:05:36,462 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 18:05:36,464 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 18:05:37,758 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 18:05:37,759 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 18:05:37,987 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 18:05:37,988 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 18:05:37,988 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:05:37 BoogieIcfgContainer
[2024-06-04 18:05:37,988 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 18:05:37,990 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 18:05:37,990 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 18:05:37,993 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 18:05:37,993 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:05:33" (1/4) ...
[2024-06-04 18:05:37,994 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716ba9e4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:05:37, skipping insertion in model container
[2024-06-04 18:05:37,994 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 06:05:35" (2/4) ...
[2024-06-04 18:05:37,995 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716ba9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:05:37, skipping insertion in model container
[2024-06-04 18:05:37,995 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:05:35" (3/4) ...
[2024-06-04 18:05:37,995 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716ba9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:05:37, skipping insertion in model container
[2024-06-04 18:05:37,995 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:05:37" (4/4) ...
[2024-06-04 18:05:37,996 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:05:38,009 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 18:05:38,009 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 18:05:38,009 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 18:05:38,145 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 18:05:38,172 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-04 18:05:38,219 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-04 18:05:38,220 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:05:38,221 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-04 18:05:38,221 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-04 18:05:38,224 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-04 18:05:38,235 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 18:05:38,240 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;@5e65bda1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 18:05:38,241 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 18:05:38,250 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 18:05:38,250 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-04 18:05:38,250 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:05:38,250 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:38,251 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:38,251 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:38,255 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:38,255 INFO  L85        PathProgramCache]: Analyzing trace with hash -1623706950, now seen corresponding path program 1 times
[2024-06-04 18:05:38,264 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:38,265 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166280439]
[2024-06-04 18:05:38,265 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:38,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:38,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:44,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:44,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:44,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166280439]
[2024-06-04 18:05:44,266 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166280439] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:44,266 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:44,266 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 18:05:44,268 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602685858]
[2024-06-04 18:05:44,268 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:44,274 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 18:05:44,277 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:44,298 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 18:05:44,298 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 18:05:44,363 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-04 18:05:44,365 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-04 18:05:44,365 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:44,365 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-04 18:05:44,366 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:45,061 INFO  L124   PetriNetUnfolderBase]: 942/1466 cut-off events.
[2024-06-04 18:05:45,062 INFO  L125   PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES.
[2024-06-04 18:05:45,066 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-04 18:05:45,072 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/44 dead transitions.
[2024-06-04 18:05:45,072 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 177 flow
[2024-06-04 18:05:45,073 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 18:05:45,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 18:05:45,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions.
[2024-06-04 18:05:45,081 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.626984126984127
[2024-06-04 18:05:45,082 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 79 transitions.
[2024-06-04 18:05:45,082 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 177 flow
[2024-06-04 18:05:45,084 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 18:05:45,085 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-04 18:05:45,087 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-04 18:05:45,089 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-04 18:05:45,089 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-04 18:05:45,089 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-04 18:05:45,089 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:45,089 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:45,090 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 18:05:45,090 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:45,090 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:45,090 INFO  L85        PathProgramCache]: Analyzing trace with hash -1309217895, now seen corresponding path program 1 times
[2024-06-04 18:05:45,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:45,091 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495635393]
[2024-06-04 18:05:45,091 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:45,091 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:45,142 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:49,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:49,221 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:49,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495635393]
[2024-06-04 18:05:49,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495635393] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:49,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:49,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 18:05:49,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243262489]
[2024-06-04 18:05:49,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:49,224 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 18:05:49,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:49,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 18:05:49,225 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-04 18:05:49,337 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-04 18:05:49,337 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-04 18:05:49,337 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:49,337 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-04 18:05:49,337 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:50,071 INFO  L124   PetriNetUnfolderBase]: 1140/1745 cut-off events.
[2024-06-04 18:05:50,071 INFO  L125   PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES.
[2024-06-04 18:05:50,074 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-04 18:05:50,079 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 43 selfloop transitions, 7 changer transitions 0/56 dead transitions.
[2024-06-04 18:05:50,079 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 258 flow
[2024-06-04 18:05:50,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 18:05:50,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 18:05:50,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions.
[2024-06-04 18:05:50,081 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2024-06-04 18:05:50,081 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 98 transitions.
[2024-06-04 18:05:50,081 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 258 flow
[2024-06-04 18:05:50,082 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 18:05:50,083 INFO  L231             Difference]: Finished difference. Result has 47 places, 42 transitions, 154 flow
[2024-06-04 18:05:50,083 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-04 18:05:50,084 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places.
[2024-06-04 18:05:50,084 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 154 flow
[2024-06-04 18:05:50,084 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-04 18:05:50,084 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:50,084 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:50,085 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 18:05:50,085 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:50,085 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:50,085 INFO  L85        PathProgramCache]: Analyzing trace with hash 267055224, now seen corresponding path program 1 times
[2024-06-04 18:05:50,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:50,086 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367836564]
[2024-06-04 18:05:50,086 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:50,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:50,142 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:55,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:55,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:55,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367836564]
[2024-06-04 18:05:55,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367836564] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:55,407 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:55,407 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-04 18:05:55,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700743936]
[2024-06-04 18:05:55,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:55,407 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-04 18:05:55,408 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:55,408 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-04 18:05:55,408 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-04 18:05:55,519 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-04 18:05:55,519 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-04 18:05:55,519 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:55,519 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-04 18:05:55,519 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:56,414 INFO  L124   PetriNetUnfolderBase]: 1134/1736 cut-off events.
[2024-06-04 18:05:56,415 INFO  L125   PetriNetUnfolderBase]: For 903/911 co-relation queries the response was YES.
[2024-06-04 18:05:56,418 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-04 18:05:56,425 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 50 selfloop transitions, 10 changer transitions 0/66 dead transitions.
[2024-06-04 18:05:56,425 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 340 flow
[2024-06-04 18:05:56,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:05:56,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:05:56,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions.
[2024-06-04 18:05:56,427 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-06-04 18:05:56,427 INFO  L175             Difference]: Start difference. First operand has 47 places, 42 transitions, 154 flow. Second operand 5 states and 120 transitions.
[2024-06-04 18:05:56,427 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 340 flow
[2024-06-04 18:05:56,429 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 338 flow, removed 1 selfloop flow, removed 0 redundant places.
[2024-06-04 18:05:56,430 INFO  L231             Difference]: Finished difference. Result has 52 places, 45 transitions, 200 flow
[2024-06-04 18:05:56,430 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-04 18:05:56,430 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2024-06-04 18:05:56,431 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 200 flow
[2024-06-04 18:05:56,431 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-04 18:05:56,431 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:56,431 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:56,431 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 18:05:56,431 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-04 18:05:56,432 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:56,432 INFO  L85        PathProgramCache]: Analyzing trace with hash -894743445, now seen corresponding path program 1 times
[2024-06-04 18:05:56,432 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:56,432 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018456639]
[2024-06-04 18:05:56,432 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:56,432 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:56,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:05,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:05,076 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:05,077 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018456639]
[2024-06-04 18:06:05,077 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018456639] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:05,077 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:05,077 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:06:05,077 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133052194]
[2024-06-04 18:06:05,077 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:05,078 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:06:05,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:05,078 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:06:05,079 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:06:05,228 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-04 18:06:05,228 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-04 18:06:05,228 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:05,228 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-04 18:06:05,228 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:05,988 INFO  L124   PetriNetUnfolderBase]: 1038/1612 cut-off events.
[2024-06-04 18:06:05,989 INFO  L125   PetriNetUnfolderBase]: For 1709/1709 co-relation queries the response was YES.
[2024-06-04 18:06:05,991 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-04 18:06:05,997 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 42 selfloop transitions, 12 changer transitions 0/64 dead transitions.
[2024-06-04 18:06:05,997 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 372 flow
[2024-06-04 18:06:05,998 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:06:05,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:06:05,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions.
[2024-06-04 18:06:05,999 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4722222222222222
[2024-06-04 18:06:05,999 INFO  L175             Difference]: Start difference. First operand has 52 places, 45 transitions, 200 flow. Second operand 6 states and 119 transitions.
[2024-06-04 18:06:05,999 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 372 flow
[2024-06-04 18:06:06,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 348 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-04 18:06:06,002 INFO  L231             Difference]: Finished difference. Result has 57 places, 53 transitions, 268 flow
[2024-06-04 18:06:06,002 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-04 18:06:06,003 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-04 18:06:06,003 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 268 flow
[2024-06-04 18:06:06,003 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-04 18:06:06,003 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:06,004 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:06,004 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 18:06:06,004 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-04 18:06:06,004 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:06,004 INFO  L85        PathProgramCache]: Analyzing trace with hash -1057930921, now seen corresponding path program 1 times
[2024-06-04 18:06:06,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:06,005 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115021360]
[2024-06-04 18:06:06,005 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:06,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:06,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:10,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:10,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:10,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115021360]
[2024-06-04 18:06:10,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115021360] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:10,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:10,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:06:10,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929712807]
[2024-06-04 18:06:10,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:10,902 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:06:10,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:10,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:06:10,903 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:06:11,027 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-04 18:06:11,027 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-04 18:06:11,028 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:11,028 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-04 18:06:11,028 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:11,969 INFO  L124   PetriNetUnfolderBase]: 1122/1717 cut-off events.
[2024-06-04 18:06:11,970 INFO  L125   PetriNetUnfolderBase]: For 2416/2424 co-relation queries the response was YES.
[2024-06-04 18:06:11,973 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-04 18:06:11,979 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 60 selfloop transitions, 13 changer transitions 0/79 dead transitions.
[2024-06-04 18:06:11,980 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 488 flow
[2024-06-04 18:06:11,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:06:11,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:06:11,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions.
[2024-06-04 18:06:11,982 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5476190476190477
[2024-06-04 18:06:11,983 INFO  L175             Difference]: Start difference. First operand has 57 places, 53 transitions, 268 flow. Second operand 6 states and 138 transitions.
[2024-06-04 18:06:11,983 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 488 flow
[2024-06-04 18:06:11,985 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 474 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-04 18:06:11,986 INFO  L231             Difference]: Finished difference. Result has 60 places, 54 transitions, 297 flow
[2024-06-04 18:06:11,986 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-04 18:06:11,987 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places.
[2024-06-04 18:06:11,987 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 297 flow
[2024-06-04 18:06:11,987 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-04 18:06:11,987 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:11,987 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:11,987 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 18:06:11,988 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:11,988 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:11,988 INFO  L85        PathProgramCache]: Analyzing trace with hash -1967242322, now seen corresponding path program 1 times
[2024-06-04 18:06:11,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:11,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330892598]
[2024-06-04 18:06:11,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:11,989 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:12,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:21,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:21,236 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:21,236 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330892598]
[2024-06-04 18:06:21,236 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330892598] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:21,236 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:21,236 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:06:21,236 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948749836]
[2024-06-04 18:06:21,236 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:21,237 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:06:21,237 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:21,237 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:06:21,238 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:06:21,347 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:06:21,348 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-04 18:06:21,348 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:21,348 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:06:21,348 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:22,311 INFO  L124   PetriNetUnfolderBase]: 1229/1899 cut-off events.
[2024-06-04 18:06:22,312 INFO  L125   PetriNetUnfolderBase]: For 4097/4113 co-relation queries the response was YES.
[2024-06-04 18:06:22,315 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-04 18:06:22,322 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 55 selfloop transitions, 12 changer transitions 0/77 dead transitions.
[2024-06-04 18:06:22,322 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 514 flow
[2024-06-04 18:06:22,323 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:06:22,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:06:22,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions.
[2024-06-04 18:06:22,323 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46825396825396826
[2024-06-04 18:06:22,323 INFO  L175             Difference]: Start difference. First operand has 60 places, 54 transitions, 297 flow. Second operand 6 states and 118 transitions.
[2024-06-04 18:06:22,324 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 514 flow
[2024-06-04 18:06:22,326 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 477 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-04 18:06:22,327 INFO  L231             Difference]: Finished difference. Result has 64 places, 63 transitions, 362 flow
[2024-06-04 18:06:22,327 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-04 18:06:22,331 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places.
[2024-06-04 18:06:22,332 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 362 flow
[2024-06-04 18:06:22,332 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-04 18:06:22,332 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:22,332 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:22,332 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 18:06:22,332 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:22,333 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:22,333 INFO  L85        PathProgramCache]: Analyzing trace with hash -855215188, now seen corresponding path program 1 times
[2024-06-04 18:06:22,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:22,334 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124019028]
[2024-06-04 18:06:22,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:22,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:22,370 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:31,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:31,210 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:31,210 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124019028]
[2024-06-04 18:06:31,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124019028] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:31,210 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:31,211 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:06:31,211 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688750134]
[2024-06-04 18:06:31,211 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:31,211 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:06:31,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:31,211 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:06:31,212 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:06:31,303 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:06:31,303 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-04 18:06:31,303 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:31,303 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:06:31,304 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:32,159 INFO  L124   PetriNetUnfolderBase]: 1263/1942 cut-off events.
[2024-06-04 18:06:32,160 INFO  L125   PetriNetUnfolderBase]: For 5088/5114 co-relation queries the response was YES.
[2024-06-04 18:06:32,165 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-04 18:06:32,172 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 61 selfloop transitions, 14 changer transitions 0/84 dead transitions.
[2024-06-04 18:06:32,173 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 578 flow
[2024-06-04 18:06:32,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:06:32,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:06:32,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-04 18:06:32,174 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-04 18:06:32,174 INFO  L175             Difference]: Start difference. First operand has 64 places, 63 transitions, 362 flow. Second operand 6 states and 122 transitions.
[2024-06-04 18:06:32,174 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 578 flow
[2024-06-04 18:06:32,177 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 572 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-06-04 18:06:32,178 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 414 flow
[2024-06-04 18:06:32,178 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-04 18:06:32,179 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-04 18:06:32,179 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 414 flow
[2024-06-04 18:06:32,179 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-04 18:06:32,180 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:32,180 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:32,180 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 18:06:32,180 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:32,180 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:32,180 INFO  L85        PathProgramCache]: Analyzing trace with hash 603720696, now seen corresponding path program 2 times
[2024-06-04 18:06:32,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:32,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181269679]
[2024-06-04 18:06:32,181 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:32,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:32,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:40,703 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:40,704 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:40,704 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181269679]
[2024-06-04 18:06:40,704 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181269679] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:40,704 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:40,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:06:40,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853164025]
[2024-06-04 18:06:40,705 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:40,705 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:06:40,705 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:40,706 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:06:40,706 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:06:40,852 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:06:40,853 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-04 18:06:40,853 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:40,853 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:06:40,853 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:41,764 INFO  L124   PetriNetUnfolderBase]: 1293/1989 cut-off events.
[2024-06-04 18:06:41,764 INFO  L125   PetriNetUnfolderBase]: For 6899/6926 co-relation queries the response was YES.
[2024-06-04 18:06:41,768 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-04 18:06:41,775 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 61 selfloop transitions, 19 changer transitions 0/89 dead transitions.
[2024-06-04 18:06:41,775 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 666 flow
[2024-06-04 18:06:41,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:06:41,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:06:41,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-04 18:06:41,776 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-04 18:06:41,776 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 414 flow. Second operand 6 states and 122 transitions.
[2024-06-04 18:06:41,776 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 666 flow
[2024-06-04 18:06:41,779 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 632 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-04 18:06:41,780 INFO  L231             Difference]: Finished difference. Result has 72 places, 72 transitions, 492 flow
[2024-06-04 18:06:41,780 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-04 18:06:41,781 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places.
[2024-06-04 18:06:41,781 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 492 flow
[2024-06-04 18:06:41,781 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-04 18:06:41,781 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:41,781 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:41,782 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 18:06:41,782 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:41,782 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:41,782 INFO  L85        PathProgramCache]: Analyzing trace with hash -854969110, now seen corresponding path program 1 times
[2024-06-04 18:06:41,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:41,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232030744]
[2024-06-04 18:06:41,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:41,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:41,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:51,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:51,732 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:51,732 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232030744]
[2024-06-04 18:06:51,732 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232030744] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:51,732 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:51,732 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:06:51,733 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587165621]
[2024-06-04 18:06:51,733 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:51,733 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:06:51,734 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:51,734 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:06:51,735 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:06:51,903 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:06:51,903 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-04 18:06:51,907 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:51,908 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:06:51,908 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:52,910 INFO  L124   PetriNetUnfolderBase]: 1265/1960 cut-off events.
[2024-06-04 18:06:52,910 INFO  L125   PetriNetUnfolderBase]: For 8851/8893 co-relation queries the response was YES.
[2024-06-04 18:06:52,915 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-04 18:06:52,923 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 65 selfloop transitions, 15 changer transitions 0/93 dead transitions.
[2024-06-04 18:06:52,924 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 93 transitions, 712 flow
[2024-06-04 18:06:52,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:06:52,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:06:52,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-04 18:06:52,925 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46258503401360546
[2024-06-04 18:06:52,925 INFO  L175             Difference]: Start difference. First operand has 72 places, 72 transitions, 492 flow. Second operand 7 states and 136 transitions.
[2024-06-04 18:06:52,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 93 transitions, 712 flow
[2024-06-04 18:06:52,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 93 transitions, 668 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-04 18:06:52,930 INFO  L231             Difference]: Finished difference. Result has 76 places, 75 transitions, 506 flow
[2024-06-04 18:06:52,930 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-04 18:06:52,931 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places.
[2024-06-04 18:06:52,931 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 506 flow
[2024-06-04 18:06:52,931 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-04 18:06:52,931 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:52,931 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:52,931 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 18:06:52,932 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:52,932 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:52,932 INFO  L85        PathProgramCache]: Analyzing trace with hash -658749465, now seen corresponding path program 1 times
[2024-06-04 18:06:52,932 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:52,932 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510595631]
[2024-06-04 18:06:52,932 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:52,933 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:52,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:03,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:03,027 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:03,027 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510595631]
[2024-06-04 18:07:03,027 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510595631] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:03,027 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:03,027 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:07:03,027 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657766667]
[2024-06-04 18:07:03,027 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:03,027 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:07:03,028 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:03,029 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:07:03,029 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:07:03,139 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:07:03,140 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-04 18:07:03,146 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:03,146 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:07:03,146 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:04,057 INFO  L124   PetriNetUnfolderBase]: 1364/2086 cut-off events.
[2024-06-04 18:07:04,058 INFO  L125   PetriNetUnfolderBase]: For 9718/9718 co-relation queries the response was YES.
[2024-06-04 18:07:04,063 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-04 18:07:04,070 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 87 selfloop transitions, 15 changer transitions 0/107 dead transitions.
[2024-06-04 18:07:04,070 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 107 transitions, 833 flow
[2024-06-04 18:07:04,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:07:04,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:07:04,072 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-04 18:07:04,072 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45918367346938777
[2024-06-04 18:07:04,073 INFO  L175             Difference]: Start difference. First operand has 76 places, 75 transitions, 506 flow. Second operand 7 states and 135 transitions.
[2024-06-04 18:07:04,073 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 107 transitions, 833 flow
[2024-06-04 18:07:04,077 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 107 transitions, 799 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-04 18:07:04,079 INFO  L231             Difference]: Finished difference. Result has 80 places, 84 transitions, 592 flow
[2024-06-04 18:07:04,079 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-04 18:07:04,080 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places.
[2024-06-04 18:07:04,080 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 592 flow
[2024-06-04 18:07:04,080 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:04,080 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:04,080 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:04,080 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 18:07:04,081 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:04,081 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:04,081 INFO  L85        PathProgramCache]: Analyzing trace with hash -734247795, now seen corresponding path program 2 times
[2024-06-04 18:07:04,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:04,081 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609352111]
[2024-06-04 18:07:04,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:04,081 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:04,115 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:14,242 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:14,242 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:14,242 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609352111]
[2024-06-04 18:07:14,242 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609352111] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:14,242 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:14,242 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:07:14,243 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984571698]
[2024-06-04 18:07:14,243 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:14,243 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:07:14,243 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:14,243 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:07:14,243 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:07:14,416 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:07:14,417 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-04 18:07:14,417 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:14,417 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:07:14,417 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:15,347 INFO  L124   PetriNetUnfolderBase]: 1402/2142 cut-off events.
[2024-06-04 18:07:15,347 INFO  L125   PetriNetUnfolderBase]: For 12377/12377 co-relation queries the response was YES.
[2024-06-04 18:07:15,352 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-04 18:07:15,359 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 85 selfloop transitions, 27 changer transitions 0/117 dead transitions.
[2024-06-04 18:07:15,360 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 988 flow
[2024-06-04 18:07:15,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:07:15,361 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:07:15,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-04 18:07:15,362 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46938775510204084
[2024-06-04 18:07:15,362 INFO  L175             Difference]: Start difference. First operand has 80 places, 84 transitions, 592 flow. Second operand 7 states and 138 transitions.
[2024-06-04 18:07:15,362 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 988 flow
[2024-06-04 18:07:15,368 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 961 flow, removed 10 selfloop flow, removed 2 redundant places.
[2024-06-04 18:07:15,369 INFO  L231             Difference]: Finished difference. Result has 86 places, 93 transitions, 713 flow
[2024-06-04 18:07:15,370 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-04 18:07:15,370 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places.
[2024-06-04 18:07:15,370 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 93 transitions, 713 flow
[2024-06-04 18:07:15,371 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:15,371 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:15,371 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:15,371 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 18:07:15,371 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:15,371 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:15,371 INFO  L85        PathProgramCache]: Analyzing trace with hash -734514705, now seen corresponding path program 3 times
[2024-06-04 18:07:15,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:15,372 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202106440]
[2024-06-04 18:07:15,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:15,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:15,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:24,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:24,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:24,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202106440]
[2024-06-04 18:07:24,706 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202106440] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:24,706 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:24,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:07:24,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052740063]
[2024-06-04 18:07:24,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:24,707 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:07:24,707 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:24,708 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:07:24,708 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:07:24,875 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:07:24,875 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-04 18:07:24,875 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:24,875 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:07:24,876 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:25,857 INFO  L124   PetriNetUnfolderBase]: 1392/2133 cut-off events.
[2024-06-04 18:07:25,858 INFO  L125   PetriNetUnfolderBase]: For 15028/15028 co-relation queries the response was YES.
[2024-06-04 18:07:25,863 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-04 18:07:25,896 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 84 selfloop transitions, 26 changer transitions 0/115 dead transitions.
[2024-06-04 18:07:25,896 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 115 transitions, 995 flow
[2024-06-04 18:07:25,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:07:25,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:07:25,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-04 18:07:25,910 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-04 18:07:25,910 INFO  L175             Difference]: Start difference. First operand has 86 places, 93 transitions, 713 flow. Second operand 7 states and 137 transitions.
[2024-06-04 18:07:25,910 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 115 transitions, 995 flow
[2024-06-04 18:07:25,921 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 115 transitions, 955 flow, removed 16 selfloop flow, removed 2 redundant places.
[2024-06-04 18:07:25,923 INFO  L231             Difference]: Finished difference. Result has 91 places, 93 transitions, 733 flow
[2024-06-04 18:07:25,923 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-04 18:07:25,926 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places.
[2024-06-04 18:07:25,926 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 733 flow
[2024-06-04 18:07:25,926 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:25,926 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:25,926 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:25,927 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 18:07:25,927 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:25,927 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:25,927 INFO  L85        PathProgramCache]: Analyzing trace with hash -733048583, now seen corresponding path program 1 times
[2024-06-04 18:07:25,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:25,927 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107240870]
[2024-06-04 18:07:25,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:25,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:25,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:36,296 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:36,297 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:36,297 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107240870]
[2024-06-04 18:07:36,297 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107240870] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:36,297 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:36,297 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:07:36,297 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682929844]
[2024-06-04 18:07:36,297 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:36,297 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:07:36,298 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:36,299 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:07:36,299 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:07:36,559 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:07:36,560 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-04 18:07:36,560 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:36,560 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:07:36,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:37,463 INFO  L124   PetriNetUnfolderBase]: 1298/2035 cut-off events.
[2024-06-04 18:07:37,464 INFO  L125   PetriNetUnfolderBase]: For 16832/16832 co-relation queries the response was YES.
[2024-06-04 18:07:37,469 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-04 18:07:37,474 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 88 selfloop transitions, 17 changer transitions 0/118 dead transitions.
[2024-06-04 18:07:37,474 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 118 transitions, 1017 flow
[2024-06-04 18:07:37,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:37,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:37,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-04 18:07:37,477 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-04 18:07:37,477 INFO  L175             Difference]: Start difference. First operand has 91 places, 93 transitions, 733 flow. Second operand 8 states and 154 transitions.
[2024-06-04 18:07:37,477 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 118 transitions, 1017 flow
[2024-06-04 18:07:37,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 118 transitions, 932 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-04 18:07:37,486 INFO  L231             Difference]: Finished difference. Result has 92 places, 95 transitions, 709 flow
[2024-06-04 18:07:37,487 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-04 18:07:37,487 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places.
[2024-06-04 18:07:37,487 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 95 transitions, 709 flow
[2024-06-04 18:07:37,487 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-04 18:07:37,487 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:37,488 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:37,488 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 18:07:37,488 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:37,488 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:37,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 920658813, now seen corresponding path program 1 times
[2024-06-04 18:07:37,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:37,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966912922]
[2024-06-04 18:07:37,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:37,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:37,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:46,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:46,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:46,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966912922]
[2024-06-04 18:07:46,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966912922] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:46,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:46,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:07:46,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449898027]
[2024-06-04 18:07:46,159 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:46,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:07:46,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:46,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:07:46,160 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:07:46,390 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:07:46,390 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-04 18:07:46,390 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:46,390 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:07:46,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:47,378 INFO  L124   PetriNetUnfolderBase]: 1332/2061 cut-off events.
[2024-06-04 18:07:47,378 INFO  L125   PetriNetUnfolderBase]: For 19790/19830 co-relation queries the response was YES.
[2024-06-04 18:07:47,384 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-04 18:07:47,390 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 86 selfloop transitions, 19 changer transitions 0/122 dead transitions.
[2024-06-04 18:07:47,390 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 122 transitions, 1015 flow
[2024-06-04 18:07:47,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:07:47,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:07:47,392 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-04 18:07:47,392 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48299319727891155
[2024-06-04 18:07:47,392 INFO  L175             Difference]: Start difference. First operand has 92 places, 95 transitions, 709 flow. Second operand 7 states and 142 transitions.
[2024-06-04 18:07:47,393 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 122 transitions, 1015 flow
[2024-06-04 18:07:47,401 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 122 transitions, 972 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-04 18:07:47,402 INFO  L231             Difference]: Finished difference. Result has 93 places, 98 transitions, 748 flow
[2024-06-04 18:07:47,402 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-04 18:07:47,403 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places.
[2024-06-04 18:07:47,403 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 98 transitions, 748 flow
[2024-06-04 18:07:47,403 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-04 18:07:47,403 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:47,403 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:47,403 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 18:07:47,404 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-04 18:07:47,404 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:47,404 INFO  L85        PathProgramCache]: Analyzing trace with hash -1486151745, now seen corresponding path program 1 times
[2024-06-04 18:07:47,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:47,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987104691]
[2024-06-04 18:07:47,404 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:47,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:47,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:00,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:00,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:00,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987104691]
[2024-06-04 18:08:00,900 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987104691] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:00,900 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:00,900 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:00,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965495173]
[2024-06-04 18:08:00,900 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:00,901 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:00,901 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:00,901 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:00,901 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:01,013 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:08:01,013 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-04 18:08:01,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:01,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:08:01,014 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:02,100 INFO  L124   PetriNetUnfolderBase]: 1398/2141 cut-off events.
[2024-06-04 18:08:02,100 INFO  L125   PetriNetUnfolderBase]: For 21092/21092 co-relation queries the response was YES.
[2024-06-04 18:08:02,107 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-04 18:08:02,112 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 105 selfloop transitions, 19 changer transitions 0/129 dead transitions.
[2024-06-04 18:08:02,113 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 129 transitions, 1100 flow
[2024-06-04 18:08:02,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:02,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:02,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 18:08:02,116 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-04 18:08:02,116 INFO  L175             Difference]: Start difference. First operand has 93 places, 98 transitions, 748 flow. Second operand 8 states and 153 transitions.
[2024-06-04 18:08:02,116 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 129 transitions, 1100 flow
[2024-06-04 18:08:02,125 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 129 transitions, 1044 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-04 18:08:02,126 INFO  L231             Difference]: Finished difference. Result has 96 places, 102 transitions, 777 flow
[2024-06-04 18:08:02,126 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-04 18:08:02,127 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places.
[2024-06-04 18:08:02,127 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 102 transitions, 777 flow
[2024-06-04 18:08:02,127 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:02,127 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:02,127 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:02,127 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 18:08:02,128 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:02,128 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:02,128 INFO  L85        PathProgramCache]: Analyzing trace with hash -1258250595, now seen corresponding path program 2 times
[2024-06-04 18:08:02,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:02,128 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766052620]
[2024-06-04 18:08:02,128 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:02,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:02,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:15,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:15,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:15,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766052620]
[2024-06-04 18:08:15,571 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766052620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:15,571 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:15,571 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:15,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92515580]
[2024-06-04 18:08:15,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:15,571 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:15,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:15,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:15,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:15,714 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:08:15,724 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-04 18:08:15,724 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:15,724 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:08:15,724 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:16,792 INFO  L124   PetriNetUnfolderBase]: 1420/2174 cut-off events.
[2024-06-04 18:08:16,792 INFO  L125   PetriNetUnfolderBase]: For 24489/24489 co-relation queries the response was YES.
[2024-06-04 18:08:16,798 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-04 18:08:16,804 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 97 selfloop transitions, 30 changer transitions 0/132 dead transitions.
[2024-06-04 18:08:16,804 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 132 transitions, 1147 flow
[2024-06-04 18:08:16,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:16,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:16,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-04 18:08:16,807 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-04 18:08:16,807 INFO  L175             Difference]: Start difference. First operand has 96 places, 102 transitions, 777 flow. Second operand 8 states and 155 transitions.
[2024-06-04 18:08:16,807 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 132 transitions, 1147 flow
[2024-06-04 18:08:16,817 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 132 transitions, 1092 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-04 18:08:16,819 INFO  L231             Difference]: Finished difference. Result has 98 places, 106 transitions, 837 flow
[2024-06-04 18:08:16,819 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-04 18:08:16,819 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places.
[2024-06-04 18:08:16,819 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 106 transitions, 837 flow
[2024-06-04 18:08:16,820 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:16,820 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:16,820 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:16,820 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 18:08:16,820 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:16,820 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:16,820 INFO  L85        PathProgramCache]: Analyzing trace with hash -1249976385, now seen corresponding path program 3 times
[2024-06-04 18:08:16,821 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:16,821 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116784871]
[2024-06-04 18:08:16,821 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:16,821 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:16,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:30,187 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:30,188 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:30,188 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116784871]
[2024-06-04 18:08:30,188 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116784871] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:30,188 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:30,188 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:30,188 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078396406]
[2024-06-04 18:08:30,188 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:30,188 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:30,188 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:30,189 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:30,189 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:30,395 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:08:30,395 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-04 18:08:30,395 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:30,395 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:08:30,395 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:31,415 INFO  L124   PetriNetUnfolderBase]: 1442/2206 cut-off events.
[2024-06-04 18:08:31,416 INFO  L125   PetriNetUnfolderBase]: For 28340/28340 co-relation queries the response was YES.
[2024-06-04 18:08:31,421 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-04 18:08:31,427 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 100 selfloop transitions, 31 changer transitions 0/136 dead transitions.
[2024-06-04 18:08:31,427 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 136 transitions, 1229 flow
[2024-06-04 18:08:31,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:31,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:31,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-04 18:08:31,430 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-04 18:08:31,430 INFO  L175             Difference]: Start difference. First operand has 98 places, 106 transitions, 837 flow. Second operand 8 states and 154 transitions.
[2024-06-04 18:08:31,430 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 136 transitions, 1229 flow
[2024-06-04 18:08:31,440 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 136 transitions, 1144 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-04 18:08:31,442 INFO  L231             Difference]: Finished difference. Result has 100 places, 110 transitions, 877 flow
[2024-06-04 18:08:31,442 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-04 18:08:31,443 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places.
[2024-06-04 18:08:31,443 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 110 transitions, 877 flow
[2024-06-04 18:08:31,443 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:31,443 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:31,443 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:31,443 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 18:08:31,443 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:31,444 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:31,444 INFO  L85        PathProgramCache]: Analyzing trace with hash -1249679715, now seen corresponding path program 4 times
[2024-06-04 18:08:31,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:31,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619763176]
[2024-06-04 18:08:31,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:31,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:31,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:41,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:41,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:41,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619763176]
[2024-06-04 18:08:41,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619763176] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:41,469 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:41,469 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:41,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300645398]
[2024-06-04 18:08:41,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:41,469 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:41,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:41,471 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:41,471 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:41,627 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:08:41,627 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-04 18:08:41,627 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:41,627 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:08:41,627 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:42,648 INFO  L124   PetriNetUnfolderBase]: 1437/2204 cut-off events.
[2024-06-04 18:08:42,648 INFO  L125   PetriNetUnfolderBase]: For 32007/32007 co-relation queries the response was YES.
[2024-06-04 18:08:42,654 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-04 18:08:42,661 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 111 selfloop transitions, 38 changer transitions 0/154 dead transitions.
[2024-06-04 18:08:42,661 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 154 transitions, 1424 flow
[2024-06-04 18:08:42,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:42,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:42,663 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-04 18:08:42,664 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494047619047619
[2024-06-04 18:08:42,664 INFO  L175             Difference]: Start difference. First operand has 100 places, 110 transitions, 877 flow. Second operand 8 states and 151 transitions.
[2024-06-04 18:08:42,664 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 154 transitions, 1424 flow
[2024-06-04 18:08:42,677 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 154 transitions, 1292 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-04 18:08:42,679 INFO  L231             Difference]: Finished difference. Result has 105 places, 131 transitions, 1093 flow
[2024-06-04 18:08:42,679 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-04 18:08:42,680 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places.
[2024-06-04 18:08:42,680 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 131 transitions, 1093 flow
[2024-06-04 18:08:42,680 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:42,680 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:42,680 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:42,680 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 18:08:42,680 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:42,681 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:42,681 INFO  L85        PathProgramCache]: Analyzing trace with hash -21877288, now seen corresponding path program 1 times
[2024-06-04 18:08:42,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:42,681 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555711445]
[2024-06-04 18:08:42,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:42,681 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:42,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:52,935 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:52,936 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:52,936 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555711445]
[2024-06-04 18:08:52,936 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555711445] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:52,936 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:52,936 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:52,936 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052397723]
[2024-06-04 18:08:52,937 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:52,938 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:52,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:52,940 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:52,940 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:53,060 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:08:53,060 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-04 18:08:53,060 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:53,060 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:08:53,061 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:54,146 INFO  L124   PetriNetUnfolderBase]: 1432/2201 cut-off events.
[2024-06-04 18:08:54,147 INFO  L125   PetriNetUnfolderBase]: For 34305/34305 co-relation queries the response was YES.
[2024-06-04 18:08:54,153 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-04 18:08:54,161 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 145 selfloop transitions, 18 changer transitions 0/168 dead transitions.
[2024-06-04 18:08:54,161 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 168 transitions, 1593 flow
[2024-06-04 18:08:54,163 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:54,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:54,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 18:08:54,181 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-04 18:08:54,181 INFO  L175             Difference]: Start difference. First operand has 105 places, 131 transitions, 1093 flow. Second operand 8 states and 153 transitions.
[2024-06-04 18:08:54,181 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 168 transitions, 1593 flow
[2024-06-04 18:08:54,201 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 168 transitions, 1541 flow, removed 22 selfloop flow, removed 2 redundant places.
[2024-06-04 18:08:54,203 INFO  L231             Difference]: Finished difference. Result has 113 places, 140 transitions, 1205 flow
[2024-06-04 18:08:54,203 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-04 18:08:54,203 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places.
[2024-06-04 18:08:54,203 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 140 transitions, 1205 flow
[2024-06-04 18:08:54,203 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:54,204 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:54,204 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:54,204 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 18:08:54,204 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:54,204 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:54,204 INFO  L85        PathProgramCache]: Analyzing trace with hash -1376522246, now seen corresponding path program 1 times
[2024-06-04 18:08:54,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:54,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144830678]
[2024-06-04 18:08:54,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:54,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:54,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:04,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:04,482 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:04,482 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144830678]
[2024-06-04 18:09:04,482 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144830678] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:04,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:04,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:04,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981857396]
[2024-06-04 18:09:04,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:04,484 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:04,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:04,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:04,486 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:04,689 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:09:04,689 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-04 18:09:04,689 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:04,689 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:09:04,689 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:05,821 INFO  L124   PetriNetUnfolderBase]: 1449/2233 cut-off events.
[2024-06-04 18:09:05,822 INFO  L125   PetriNetUnfolderBase]: For 38778/38778 co-relation queries the response was YES.
[2024-06-04 18:09:05,829 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-04 18:09:05,835 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 149 selfloop transitions, 20 changer transitions 0/174 dead transitions.
[2024-06-04 18:09:05,835 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 174 transitions, 1661 flow
[2024-06-04 18:09:05,837 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:09:05,837 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:09:05,839 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-04 18:09:05,839 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4417989417989418
[2024-06-04 18:09:05,839 INFO  L175             Difference]: Start difference. First operand has 113 places, 140 transitions, 1205 flow. Second operand 9 states and 167 transitions.
[2024-06-04 18:09:05,839 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 174 transitions, 1661 flow
[2024-06-04 18:09:05,861 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 174 transitions, 1581 flow, removed 34 selfloop flow, removed 3 redundant places.
[2024-06-04 18:09:05,863 INFO  L231             Difference]: Finished difference. Result has 121 places, 144 transitions, 1228 flow
[2024-06-04 18:09:05,864 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-04 18:09:05,864 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places.
[2024-06-04 18:09:05,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 144 transitions, 1228 flow
[2024-06-04 18:09:05,866 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-04 18:09:05,866 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:05,866 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:05,866 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 18:09:05,866 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-04 18:09:05,867 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:05,867 INFO  L85        PathProgramCache]: Analyzing trace with hash -1493971634, now seen corresponding path program 2 times
[2024-06-04 18:09:05,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:05,867 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792340755]
[2024-06-04 18:09:05,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:05,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:05,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:17,650 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:17,651 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:17,651 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792340755]
[2024-06-04 18:09:17,651 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792340755] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:17,651 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:17,651 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:17,651 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022573799]
[2024-06-04 18:09:17,651 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:17,651 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:17,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:17,652 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:17,652 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:17,864 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:09:17,864 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-04 18:09:17,864 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:17,864 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:09:17,864 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:19,013 INFO  L124   PetriNetUnfolderBase]: 1541/2376 cut-off events.
[2024-06-04 18:09:19,013 INFO  L125   PetriNetUnfolderBase]: For 47940/47940 co-relation queries the response was YES.
[2024-06-04 18:09:19,022 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-04 18:09:19,030 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 131 selfloop transitions, 43 changer transitions 0/179 dead transitions.
[2024-06-04 18:09:19,030 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 179 transitions, 1735 flow
[2024-06-04 18:09:19,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:09:19,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:09:19,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-04 18:09:19,033 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-04 18:09:19,033 INFO  L175             Difference]: Start difference. First operand has 121 places, 144 transitions, 1228 flow. Second operand 9 states and 176 transitions.
[2024-06-04 18:09:19,033 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 179 transitions, 1735 flow
[2024-06-04 18:09:19,055 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 179 transitions, 1682 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-04 18:09:19,057 INFO  L231             Difference]: Finished difference. Result has 126 places, 146 transitions, 1309 flow
[2024-06-04 18:09:19,058 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-04 18:09:19,058 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places.
[2024-06-04 18:09:19,058 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 146 transitions, 1309 flow
[2024-06-04 18:09:19,058 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-04 18:09:19,059 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:19,059 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:19,059 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 18:09:19,059 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:19,059 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:19,059 INFO  L85        PathProgramCache]: Analyzing trace with hash -1228274354, now seen corresponding path program 3 times
[2024-06-04 18:09:19,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:19,060 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187606799]
[2024-06-04 18:09:19,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:19,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:19,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:30,215 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:30,216 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:30,216 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187606799]
[2024-06-04 18:09:30,216 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187606799] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:30,216 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:30,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:30,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619722099]
[2024-06-04 18:09:30,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:30,216 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:30,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:30,217 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:30,217 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:30,406 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:09:30,406 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-04 18:09:30,406 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:30,406 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:09:30,406 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:31,606 INFO  L124   PetriNetUnfolderBase]: 1558/2403 cut-off events.
[2024-06-04 18:09:31,606 INFO  L125   PetriNetUnfolderBase]: For 48984/48984 co-relation queries the response was YES.
[2024-06-04 18:09:31,615 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-04 18:09:31,624 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 109 selfloop transitions, 62 changer transitions 0/176 dead transitions.
[2024-06-04 18:09:31,625 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 176 transitions, 1761 flow
[2024-06-04 18:09:31,627 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:09:31,627 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:09:31,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-04 18:09:31,627 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 18:09:31,627 INFO  L175             Difference]: Start difference. First operand has 126 places, 146 transitions, 1309 flow. Second operand 9 states and 171 transitions.
[2024-06-04 18:09:31,627 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 176 transitions, 1761 flow
[2024-06-04 18:09:31,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 176 transitions, 1669 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-04 18:09:31,655 INFO  L231             Difference]: Finished difference. Result has 128 places, 148 transitions, 1390 flow
[2024-06-04 18:09:31,655 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-04 18:09:31,655 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places.
[2024-06-04 18:09:31,655 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 148 transitions, 1390 flow
[2024-06-04 18:09:31,656 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-04 18:09:31,656 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:31,656 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:31,656 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 18:09:31,656 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:31,656 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:31,656 INFO  L85        PathProgramCache]: Analyzing trace with hash -1237471124, now seen corresponding path program 4 times
[2024-06-04 18:09:31,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:31,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303277497]
[2024-06-04 18:09:31,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:31,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:31,699 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:43,445 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:43,446 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:43,446 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303277497]
[2024-06-04 18:09:43,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303277497] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:43,446 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:43,446 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:43,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447376902]
[2024-06-04 18:09:43,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:43,447 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:43,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:43,447 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:43,447 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:43,602 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:09:43,603 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-04 18:09:43,603 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:43,603 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:09:43,603 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:44,806 INFO  L124   PetriNetUnfolderBase]: 1650/2565 cut-off events.
[2024-06-04 18:09:44,806 INFO  L125   PetriNetUnfolderBase]: For 59513/59513 co-relation queries the response was YES.
[2024-06-04 18:09:44,816 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-04 18:09:44,825 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 133 selfloop transitions, 45 changer transitions 0/183 dead transitions.
[2024-06-04 18:09:44,826 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 183 transitions, 1913 flow
[2024-06-04 18:09:44,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:09:44,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:09:44,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-04 18:09:44,828 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46296296296296297
[2024-06-04 18:09:44,828 INFO  L175             Difference]: Start difference. First operand has 128 places, 148 transitions, 1390 flow. Second operand 9 states and 175 transitions.
[2024-06-04 18:09:44,828 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 183 transitions, 1913 flow
[2024-06-04 18:09:44,856 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 183 transitions, 1758 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-04 18:09:44,858 INFO  L231             Difference]: Finished difference. Result has 130 places, 150 transitions, 1381 flow
[2024-06-04 18:09:44,859 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-04 18:09:44,859 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 87 predicate places.
[2024-06-04 18:09:44,859 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 150 transitions, 1381 flow
[2024-06-04 18:09:44,859 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-04 18:09:44,859 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:44,860 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:44,860 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 18:09:44,860 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:44,860 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:44,860 INFO  L85        PathProgramCache]: Analyzing trace with hash -1227947924, now seen corresponding path program 5 times
[2024-06-04 18:09:44,860 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:44,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763070734]
[2024-06-04 18:09:44,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:44,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:44,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:55,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:55,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:55,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763070734]
[2024-06-04 18:09:55,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763070734] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:55,940 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:55,940 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:55,941 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419700543]
[2024-06-04 18:09:55,941 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:55,942 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:55,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:55,947 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:55,947 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:56,263 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:09:56,263 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-04 18:09:56,263 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:56,263 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:09:56,263 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:57,680 INFO  L124   PetriNetUnfolderBase]: 1810/2837 cut-off events.
[2024-06-04 18:09:57,681 INFO  L125   PetriNetUnfolderBase]: For 64888/64888 co-relation queries the response was YES.
[2024-06-04 18:09:57,706 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-04 18:09:57,715 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 112 selfloop transitions, 72 changer transitions 0/189 dead transitions.
[2024-06-04 18:09:57,715 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 189 transitions, 2070 flow
[2024-06-04 18:09:57,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:09:57,717 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:09:57,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-04 18:09:57,718 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46825396825396826
[2024-06-04 18:09:57,718 INFO  L175             Difference]: Start difference. First operand has 130 places, 150 transitions, 1381 flow. Second operand 9 states and 177 transitions.
[2024-06-04 18:09:57,718 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 189 transitions, 2070 flow
[2024-06-04 18:09:57,754 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 189 transitions, 1955 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-04 18:09:57,756 INFO  L231             Difference]: Finished difference. Result has 133 places, 155 transitions, 1562 flow
[2024-06-04 18:09:57,756 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-04 18:09:57,757 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places.
[2024-06-04 18:09:57,757 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 155 transitions, 1562 flow
[2024-06-04 18:09:57,757 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-04 18:09:57,757 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:57,757 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:57,757 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 18:09:57,758 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:57,758 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:57,758 INFO  L85        PathProgramCache]: Analyzing trace with hash 609593884, now seen corresponding path program 1 times
[2024-06-04 18:09:57,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:57,758 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5479056]
[2024-06-04 18:09:57,758 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:57,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:57,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:08,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:08,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:08,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5479056]
[2024-06-04 18:10:08,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5479056] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:08,807 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:08,807 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:10:08,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544108972]
[2024-06-04 18:10:08,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:08,807 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:10:08,807 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:08,808 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:10:08,808 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:10:08,961 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:10:08,962 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-04 18:10:08,962 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:08,962 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:10:08,962 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:10,263 INFO  L124   PetriNetUnfolderBase]: 1742/2778 cut-off events.
[2024-06-04 18:10:10,263 INFO  L125   PetriNetUnfolderBase]: For 69505/69567 co-relation queries the response was YES.
[2024-06-04 18:10:10,274 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-04 18:10:10,283 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 125 selfloop transitions, 22 changer transitions 0/187 dead transitions.
[2024-06-04 18:10:10,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 187 transitions, 1958 flow
[2024-06-04 18:10:10,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:10:10,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:10:10,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-04 18:10:10,286 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-04 18:10:10,286 INFO  L175             Difference]: Start difference. First operand has 133 places, 155 transitions, 1562 flow. Second operand 8 states and 160 transitions.
[2024-06-04 18:10:10,286 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 187 transitions, 1958 flow
[2024-06-04 18:10:10,323 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 187 transitions, 1840 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-04 18:10:10,325 INFO  L231             Difference]: Finished difference. Result has 136 places, 157 transitions, 1521 flow
[2024-06-04 18:10:10,325 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-04 18:10:10,326 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places.
[2024-06-04 18:10:10,326 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 157 transitions, 1521 flow
[2024-06-04 18:10:10,326 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-04 18:10:10,326 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:10,326 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:10,327 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 18:10:10,327 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:10,327 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:10,327 INFO  L85        PathProgramCache]: Analyzing trace with hash 176291554, now seen corresponding path program 2 times
[2024-06-04 18:10:10,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:10,327 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138845426]
[2024-06-04 18:10:10,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:10,328 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:10,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:20,785 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:20,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:20,785 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138845426]
[2024-06-04 18:10:20,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138845426] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:20,785 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:20,785 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:10:20,785 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957195164]
[2024-06-04 18:10:20,785 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:20,787 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:10:20,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:20,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:10:20,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:10:20,970 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:10:20,970 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-04 18:10:20,970 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:20,970 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:10:20,970 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:22,416 INFO  L124   PetriNetUnfolderBase]: 1759/2807 cut-off events.
[2024-06-04 18:10:22,417 INFO  L125   PetriNetUnfolderBase]: For 73629/73680 co-relation queries the response was YES.
[2024-06-04 18:10:22,430 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-04 18:10:22,441 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 123 selfloop transitions, 25 changer transitions 0/188 dead transitions.
[2024-06-04 18:10:22,441 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 188 transitions, 1921 flow
[2024-06-04 18:10:22,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:10:22,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:10:22,442 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-04 18:10:22,442 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-04 18:10:22,442 INFO  L175             Difference]: Start difference. First operand has 136 places, 157 transitions, 1521 flow. Second operand 8 states and 160 transitions.
[2024-06-04 18:10:22,443 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 188 transitions, 1921 flow
[2024-06-04 18:10:22,489 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 188 transitions, 1862 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-06-04 18:10:22,491 INFO  L231             Difference]: Finished difference. Result has 138 places, 159 transitions, 1550 flow
[2024-06-04 18:10:22,491 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-04 18:10:22,492 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places.
[2024-06-04 18:10:22,492 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 159 transitions, 1550 flow
[2024-06-04 18:10:22,492 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-04 18:10:22,492 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:22,492 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:22,492 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 18:10:22,493 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:22,493 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:22,493 INFO  L85        PathProgramCache]: Analyzing trace with hash 179093024, now seen corresponding path program 1 times
[2024-06-04 18:10:22,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:22,493 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583781300]
[2024-06-04 18:10:22,493 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:22,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:22,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:34,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:34,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:34,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583781300]
[2024-06-04 18:10:34,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583781300] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:34,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:34,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:10:34,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000053929]
[2024-06-04 18:10:34,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:34,591 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:10:34,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:34,592 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:10:34,593 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:10:34,878 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:10:34,879 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-04 18:10:34,879 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:34,879 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:10:34,879 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:36,327 INFO  L124   PetriNetUnfolderBase]: 1871/2940 cut-off events.
[2024-06-04 18:10:36,327 INFO  L125   PetriNetUnfolderBase]: For 78028/78028 co-relation queries the response was YES.
[2024-06-04 18:10:36,338 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-04 18:10:36,347 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 168 selfloop transitions, 21 changer transitions 0/194 dead transitions.
[2024-06-04 18:10:36,348 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 194 transitions, 2076 flow
[2024-06-04 18:10:36,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:10:36,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:10:36,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-04 18:10:36,350 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-04 18:10:36,350 INFO  L175             Difference]: Start difference. First operand has 138 places, 159 transitions, 1550 flow. Second operand 9 states and 170 transitions.
[2024-06-04 18:10:36,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 194 transitions, 2076 flow
[2024-06-04 18:10:36,400 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 194 transitions, 2008 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-04 18:10:36,402 INFO  L231             Difference]: Finished difference. Result has 141 places, 162 transitions, 1600 flow
[2024-06-04 18:10:36,403 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-04 18:10:36,403 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 98 predicate places.
[2024-06-04 18:10:36,403 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 162 transitions, 1600 flow
[2024-06-04 18:10:36,403 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-04 18:10:36,403 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:36,404 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:36,404 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 18:10:36,404 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:36,404 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:36,404 INFO  L85        PathProgramCache]: Analyzing trace with hash 460018368, now seen corresponding path program 3 times
[2024-06-04 18:10:36,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:36,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707986991]
[2024-06-04 18:10:36,405 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:36,405 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:36,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:46,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-04 18:10:46,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:46,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707986991]
[2024-06-04 18:10:46,543 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707986991] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:46,543 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:46,543 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:10:46,543 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370429054]
[2024-06-04 18:10:46,543 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:46,544 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:10:46,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:46,545 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:10:46,545 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:10:46,715 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:10:46,716 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-04 18:10:46,716 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:46,716 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:10:46,716 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:48,137 INFO  L124   PetriNetUnfolderBase]: 1787/2857 cut-off events.
[2024-06-04 18:10:48,138 INFO  L125   PetriNetUnfolderBase]: For 86542/86597 co-relation queries the response was YES.
[2024-06-04 18:10:48,151 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-04 18:10:48,162 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 127 selfloop transitions, 25 changer transitions 0/193 dead transitions.
[2024-06-04 18:10:48,163 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 193 transitions, 2040 flow
[2024-06-04 18:10:48,163 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:10:48,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:10:48,163 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-04 18:10:48,164 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-04 18:10:48,164 INFO  L175             Difference]: Start difference. First operand has 141 places, 162 transitions, 1600 flow. Second operand 8 states and 157 transitions.
[2024-06-04 18:10:48,164 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 193 transitions, 2040 flow
[2024-06-04 18:10:48,212 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 193 transitions, 1946 flow, removed 28 selfloop flow, removed 7 redundant places.
[2024-06-04 18:10:48,215 INFO  L231             Difference]: Finished difference. Result has 143 places, 167 transitions, 1645 flow
[2024-06-04 18:10:48,215 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-04 18:10:48,215 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places.
[2024-06-04 18:10:48,215 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 167 transitions, 1645 flow
[2024-06-04 18:10:48,216 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-04 18:10:48,216 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:48,216 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:48,216 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 18:10:48,216 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:48,216 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:48,217 INFO  L85        PathProgramCache]: Analyzing trace with hash 961838410, now seen corresponding path program 2 times
[2024-06-04 18:10:48,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:48,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90248941]
[2024-06-04 18:10:48,217 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:48,217 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:48,278 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:00,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:00,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:00,256 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90248941]
[2024-06-04 18:11:00,257 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90248941] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:00,257 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:00,257 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:11:00,257 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678549038]
[2024-06-04 18:11:00,257 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:00,257 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:11:00,257 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:00,258 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:11:00,258 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:11:00,534 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:11:00,535 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-04 18:11:00,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:00,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:11:00,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:02,038 INFO  L124   PetriNetUnfolderBase]: 1907/3000 cut-off events.
[2024-06-04 18:11:02,038 INFO  L125   PetriNetUnfolderBase]: For 91554/91554 co-relation queries the response was YES.
[2024-06-04 18:11:02,053 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-04 18:11:02,064 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 161 selfloop transitions, 40 changer transitions 0/206 dead transitions.
[2024-06-04 18:11:02,065 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 206 transitions, 2211 flow
[2024-06-04 18:11:02,067 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:11:02,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:11:02,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-04 18:11:02,067 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 18:11:02,067 INFO  L175             Difference]: Start difference. First operand has 143 places, 167 transitions, 1645 flow. Second operand 10 states and 190 transitions.
[2024-06-04 18:11:02,068 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 206 transitions, 2211 flow
[2024-06-04 18:11:02,127 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 206 transitions, 2125 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-04 18:11:02,129 INFO  L231             Difference]: Finished difference. Result has 148 places, 170 transitions, 1721 flow
[2024-06-04 18:11:02,129 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-04 18:11:02,130 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places.
[2024-06-04 18:11:02,130 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 170 transitions, 1721 flow
[2024-06-04 18:11:02,130 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-04 18:11:02,130 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:02,130 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:02,131 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 18:11:02,131 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:02,131 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:02,131 INFO  L85        PathProgramCache]: Analyzing trace with hash -1711060988, now seen corresponding path program 1 times
[2024-06-04 18:11:02,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:02,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488903517]
[2024-06-04 18:11:02,131 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:02,132 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:02,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:19,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:19,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:19,048 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488903517]
[2024-06-04 18:11:19,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488903517] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:19,048 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:19,048 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:11:19,048 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008666786]
[2024-06-04 18:11:19,048 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:19,049 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:11:19,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:19,049 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:11:19,049 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:11:19,199 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:11:19,200 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-04 18:11:19,200 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:19,201 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:11:19,201 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:20,553 INFO  L124   PetriNetUnfolderBase]: 1927/3036 cut-off events.
[2024-06-04 18:11:20,553 INFO  L125   PetriNetUnfolderBase]: For 98588/98588 co-relation queries the response was YES.
[2024-06-04 18:11:20,566 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-04 18:11:20,575 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 164 selfloop transitions, 26 changer transitions 0/195 dead transitions.
[2024-06-04 18:11:20,576 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 195 transitions, 2339 flow
[2024-06-04 18:11:20,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:11:20,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:11:20,577 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-04 18:11:20,577 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-04 18:11:20,577 INFO  L175             Difference]: Start difference. First operand has 148 places, 170 transitions, 1721 flow. Second operand 6 states and 122 transitions.
[2024-06-04 18:11:20,577 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 195 transitions, 2339 flow
[2024-06-04 18:11:20,626 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 195 transitions, 2201 flow, removed 31 selfloop flow, removed 8 redundant places.
[2024-06-04 18:11:20,629 INFO  L231             Difference]: Finished difference. Result has 146 places, 176 transitions, 1732 flow
[2024-06-04 18:11:20,629 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-04 18:11:20,630 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 103 predicate places.
[2024-06-04 18:11:20,630 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 176 transitions, 1732 flow
[2024-06-04 18:11:20,630 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:20,630 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:20,630 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:20,630 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 18:11:20,630 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:20,631 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:20,631 INFO  L85        PathProgramCache]: Analyzing trace with hash 924840264, now seen corresponding path program 4 times
[2024-06-04 18:11:20,631 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:20,631 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352555581]
[2024-06-04 18:11:20,631 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:20,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:20,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:30,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:30,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:30,056 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352555581]
[2024-06-04 18:11:30,056 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352555581] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:30,056 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:30,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:11:30,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245058625]
[2024-06-04 18:11:30,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:30,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:11:30,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:30,057 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:11:30,057 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:11:30,188 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:11:30,189 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-04 18:11:30,189 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:30,189 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:11:30,189 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:31,500 INFO  L124   PetriNetUnfolderBase]: 1808/2891 cut-off events.
[2024-06-04 18:11:31,501 INFO  L125   PetriNetUnfolderBase]: For 104515/104574 co-relation queries the response was YES.
[2024-06-04 18:11:31,514 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-04 18:11:31,526 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 128 selfloop transitions, 35 changer transitions 0/205 dead transitions.
[2024-06-04 18:11:31,526 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 205 transitions, 2190 flow
[2024-06-04 18:11:31,526 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:11:31,527 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:11:31,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-04 18:11:31,527 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-04 18:11:31,527 INFO  L175             Difference]: Start difference. First operand has 146 places, 176 transitions, 1732 flow. Second operand 8 states and 157 transitions.
[2024-06-04 18:11:31,527 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 205 transitions, 2190 flow
[2024-06-04 18:11:31,584 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 205 transitions, 2149 flow, removed 14 selfloop flow, removed 2 redundant places.
[2024-06-04 18:11:31,587 INFO  L231             Difference]: Finished difference. Result has 153 places, 181 transitions, 1852 flow
[2024-06-04 18:11:31,587 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-04 18:11:31,587 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places.
[2024-06-04 18:11:31,587 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 181 transitions, 1852 flow
[2024-06-04 18:11:31,588 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-04 18:11:31,588 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:31,588 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:31,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 18:11:31,588 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:31,588 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:31,588 INFO  L85        PathProgramCache]: Analyzing trace with hash 931511464, now seen corresponding path program 3 times
[2024-06-04 18:11:31,589 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:31,589 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691586074]
[2024-06-04 18:11:31,589 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:31,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:31,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:44,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:44,053 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:44,054 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691586074]
[2024-06-04 18:11:44,054 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691586074] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:44,054 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:44,054 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:11:44,054 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252310712]
[2024-06-04 18:11:44,055 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:44,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:11:44,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:44,059 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:11:44,059 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:11:44,301 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:11:44,302 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-04 18:11:44,302 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:44,302 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:11:44,302 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:45,745 INFO  L124   PetriNetUnfolderBase]: 1925/3034 cut-off events.
[2024-06-04 18:11:45,745 INFO  L125   PetriNetUnfolderBase]: For 108243/108243 co-relation queries the response was YES.
[2024-06-04 18:11:45,760 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-04 18:11:45,770 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 163 selfloop transitions, 44 changer transitions 0/212 dead transitions.
[2024-06-04 18:11:45,771 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 212 transitions, 2419 flow
[2024-06-04 18:11:45,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:11:45,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:11:45,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-04 18:11:45,773 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-04 18:11:45,774 INFO  L175             Difference]: Start difference. First operand has 153 places, 181 transitions, 1852 flow. Second operand 9 states and 172 transitions.
[2024-06-04 18:11:45,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 212 transitions, 2419 flow
[2024-06-04 18:11:45,834 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 212 transitions, 2301 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-04 18:11:45,836 INFO  L231             Difference]: Finished difference. Result has 156 places, 184 transitions, 1912 flow
[2024-06-04 18:11:45,837 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-04 18:11:45,838 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places.
[2024-06-04 18:11:45,838 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 184 transitions, 1912 flow
[2024-06-04 18:11:45,838 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-04 18:11:45,838 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:45,838 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:45,839 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 18:11:45,839 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:45,839 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:45,839 INFO  L85        PathProgramCache]: Analyzing trace with hash 578192552, now seen corresponding path program 4 times
[2024-06-04 18:11:45,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:45,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490631589]
[2024-06-04 18:11:45,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:45,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:45,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:57,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:57,580 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:57,580 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490631589]
[2024-06-04 18:11:57,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490631589] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:57,581 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:57,581 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:11:57,581 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354347445]
[2024-06-04 18:11:57,581 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:57,581 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:11:57,581 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:57,582 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:11:57,582 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:11:57,767 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:11:57,768 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-04 18:11:57,768 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:57,768 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:11:57,768 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:59,149 INFO  L124   PetriNetUnfolderBase]: 1920/3027 cut-off events.
[2024-06-04 18:11:59,150 INFO  L125   PetriNetUnfolderBase]: For 115974/115974 co-relation queries the response was YES.
[2024-06-04 18:11:59,163 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-04 18:11:59,174 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 149 selfloop transitions, 69 changer transitions 0/223 dead transitions.
[2024-06-04 18:11:59,175 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 223 transitions, 2527 flow
[2024-06-04 18:11:59,177 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:11:59,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:11:59,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions.
[2024-06-04 18:11:59,177 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4458874458874459
[2024-06-04 18:11:59,178 INFO  L175             Difference]: Start difference. First operand has 156 places, 184 transitions, 1912 flow. Second operand 11 states and 206 transitions.
[2024-06-04 18:11:59,178 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 223 transitions, 2527 flow
[2024-06-04 18:11:59,244 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 223 transitions, 2373 flow, removed 35 selfloop flow, removed 7 redundant places.
[2024-06-04 18:11:59,247 INFO  L231             Difference]: Finished difference. Result has 161 places, 188 transitions, 2006 flow
[2024-06-04 18:11:59,247 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-04 18:11:59,247 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 118 predicate places.
[2024-06-04 18:11:59,247 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 188 transitions, 2006 flow
[2024-06-04 18:11:59,248 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-04 18:11:59,248 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:59,248 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:59,248 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 18:11:59,248 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-04 18:11:59,248 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:59,248 INFO  L85        PathProgramCache]: Analyzing trace with hash -1487501922, now seen corresponding path program 2 times
[2024-06-04 18:11:59,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:59,249 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287471532]
[2024-06-04 18:11:59,249 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:59,249 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:59,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:16,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:16,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:16,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287471532]
[2024-06-04 18:12:16,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287471532] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:16,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:16,819 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:12:16,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023498606]
[2024-06-04 18:12:16,819 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:16,820 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:12:16,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:16,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:12:16,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:12:17,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:12:17,010 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-04 18:12:17,010 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:17,010 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:12:17,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:18,263 INFO  L124   PetriNetUnfolderBase]: 1908/3015 cut-off events.
[2024-06-04 18:12:18,264 INFO  L125   PetriNetUnfolderBase]: For 121009/121009 co-relation queries the response was YES.
[2024-06-04 18:12:18,278 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-04 18:12:18,288 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 175 selfloop transitions, 23 changer transitions 0/203 dead transitions.
[2024-06-04 18:12:18,288 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 203 transitions, 2468 flow
[2024-06-04 18:12:18,289 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:12:18,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:12:18,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions.
[2024-06-04 18:12:18,289 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-04 18:12:18,290 INFO  L175             Difference]: Start difference. First operand has 161 places, 188 transitions, 2006 flow. Second operand 5 states and 105 transitions.
[2024-06-04 18:12:18,290 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 203 transitions, 2468 flow
[2024-06-04 18:12:18,374 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 203 transitions, 2233 flow, removed 52 selfloop flow, removed 8 redundant places.
[2024-06-04 18:12:18,376 INFO  L231             Difference]: Finished difference. Result has 158 places, 188 transitions, 1835 flow
[2024-06-04 18:12:18,376 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-04 18:12:18,377 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places.
[2024-06-04 18:12:18,377 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 188 transitions, 1835 flow
[2024-06-04 18:12:18,377 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:18,377 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:18,377 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:18,377 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 18:12:18,377 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-04 18:12:18,378 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:18,378 INFO  L85        PathProgramCache]: Analyzing trace with hash 1563297470, now seen corresponding path program 1 times
[2024-06-04 18:12:18,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:18,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139475654]
[2024-06-04 18:12:18,378 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:18,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:18,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:31,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-04 18:12:31,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:31,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139475654]
[2024-06-04 18:12:31,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139475654] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:31,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:31,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:31,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18753573]
[2024-06-04 18:12:31,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:31,862 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:31,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:31,863 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:31,863 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:31,979 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:12:31,980 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-04 18:12:31,980 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:31,980 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:12:31,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:33,312 INFO  L124   PetriNetUnfolderBase]: 1859/2971 cut-off events.
[2024-06-04 18:12:33,312 INFO  L125   PetriNetUnfolderBase]: For 123812/123868 co-relation queries the response was YES.
[2024-06-04 18:12:33,328 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-04 18:12:33,339 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 167 selfloop transitions, 27 changer transitions 0/214 dead transitions.
[2024-06-04 18:12:33,339 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 214 transitions, 2405 flow
[2024-06-04 18:12:33,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:12:33,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:12:33,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 18:12:33,345 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-04 18:12:33,345 INFO  L175             Difference]: Start difference. First operand has 158 places, 188 transitions, 1835 flow. Second operand 8 states and 153 transitions.
[2024-06-04 18:12:33,345 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 214 transitions, 2405 flow
[2024-06-04 18:12:33,427 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 214 transitions, 2359 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-04 18:12:33,429 INFO  L231             Difference]: Finished difference. Result has 162 places, 194 transitions, 1915 flow
[2024-06-04 18:12:33,430 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-04 18:12:33,430 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places.
[2024-06-04 18:12:33,430 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 194 transitions, 1915 flow
[2024-06-04 18:12:33,430 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-04 18:12:33,430 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:33,432 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:33,433 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 18:12:33,433 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-04 18:12:33,434 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:33,434 INFO  L85        PathProgramCache]: Analyzing trace with hash -1664863834, now seen corresponding path program 2 times
[2024-06-04 18:12:33,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:33,434 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27509160]
[2024-06-04 18:12:33,435 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:33,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:33,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:46,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:46,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:46,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27509160]
[2024-06-04 18:12:46,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27509160] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:46,830 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:46,830 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:46,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273753797]
[2024-06-04 18:12:46,830 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:46,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:46,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:46,831 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:46,831 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:47,025 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:12:47,025 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-04 18:12:47,026 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:47,026 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:12:47,026 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:48,278 INFO  L124   PetriNetUnfolderBase]: 1850/2958 cut-off events.
[2024-06-04 18:12:48,278 INFO  L125   PetriNetUnfolderBase]: For 127943/127999 co-relation queries the response was YES.
[2024-06-04 18:12:48,292 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-04 18:12:48,302 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 167 selfloop transitions, 23 changer transitions 0/210 dead transitions.
[2024-06-04 18:12:48,302 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 210 transitions, 2339 flow
[2024-06-04 18:12:48,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:12:48,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:12:48,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-04 18:12:48,303 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-04 18:12:48,303 INFO  L175             Difference]: Start difference. First operand has 162 places, 194 transitions, 1915 flow. Second operand 6 states and 122 transitions.
[2024-06-04 18:12:48,303 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 210 transitions, 2339 flow
[2024-06-04 18:12:48,384 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 210 transitions, 2271 flow, removed 23 selfloop flow, removed 4 redundant places.
[2024-06-04 18:12:48,387 INFO  L231             Difference]: Finished difference. Result has 164 places, 194 transitions, 1904 flow
[2024-06-04 18:12:48,387 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-04 18:12:48,387 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places.
[2024-06-04 18:12:48,388 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 194 transitions, 1904 flow
[2024-06-04 18:12:48,388 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-04 18:12:48,388 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:48,388 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:48,388 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 18:12:48,388 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-04 18:12:48,388 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:48,389 INFO  L85        PathProgramCache]: Analyzing trace with hash 392334268, now seen corresponding path program 1 times
[2024-06-04 18:12:48,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:48,389 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168050128]
[2024-06-04 18:12:48,389 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:48,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:48,424 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:03,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:03,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:03,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168050128]
[2024-06-04 18:13:03,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168050128] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:03,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:03,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:13:03,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432622139]
[2024-06-04 18:13:03,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:03,959 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:13:03,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:03,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:13:03,960 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:13:04,134 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:04,134 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-04 18:13:04,134 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:04,135 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:04,135 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:05,260 INFO  L124   PetriNetUnfolderBase]: 1917/3024 cut-off events.
[2024-06-04 18:13:05,261 INFO  L125   PetriNetUnfolderBase]: For 129823/129823 co-relation queries the response was YES.
[2024-06-04 18:13:05,277 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-04 18:13:05,288 INFO  L140   encePairwiseOnDemand]: 36/42 looper letters, 185 selfloop transitions, 14 changer transitions 0/204 dead transitions.
[2024-06-04 18:13:05,289 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 204 transitions, 2348 flow
[2024-06-04 18:13:05,289 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:13:05,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:13:05,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions.
[2024-06-04 18:13:05,290 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 18:13:05,290 INFO  L175             Difference]: Start difference. First operand has 164 places, 194 transitions, 1904 flow. Second operand 5 states and 95 transitions.
[2024-06-04 18:13:05,290 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 204 transitions, 2348 flow
[2024-06-04 18:13:05,388 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 204 transitions, 2302 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-06-04 18:13:05,391 INFO  L231             Difference]: Finished difference. Result has 164 places, 196 transitions, 1921 flow
[2024-06-04 18:13:05,391 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-04 18:13:05,392 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places.
[2024-06-04 18:13:05,392 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 196 transitions, 1921 flow
[2024-06-04 18:13:05,392 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-04 18:13:05,392 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:05,393 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:05,393 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 18:13:05,393 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:05,393 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:05,393 INFO  L85        PathProgramCache]: Analyzing trace with hash 375198773, now seen corresponding path program 1 times
[2024-06-04 18:13:05,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:05,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887639104]
[2024-06-04 18:13:05,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:05,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:05,457 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:15,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:15,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:15,141 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887639104]
[2024-06-04 18:13:15,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887639104] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:15,142 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:15,142 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:13:15,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612679546]
[2024-06-04 18:13:15,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:15,165 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:13:15,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:15,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:13:15,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:13:15,488 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:15,488 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-04 18:13:15,488 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:15,488 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:15,488 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:16,959 INFO  L124   PetriNetUnfolderBase]: 1934/3051 cut-off events.
[2024-06-04 18:13:16,960 INFO  L125   PetriNetUnfolderBase]: For 137468/137468 co-relation queries the response was YES.
[2024-06-04 18:13:16,976 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-04 18:13:16,988 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 214 selfloop transitions, 18 changer transitions 0/237 dead transitions.
[2024-06-04 18:13:16,988 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 237 transitions, 2607 flow
[2024-06-04 18:13:16,990 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:13:16,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:13:17,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-04 18:13:17,012 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-04 18:13:17,012 INFO  L175             Difference]: Start difference. First operand has 164 places, 196 transitions, 1921 flow. Second operand 9 states and 170 transitions.
[2024-06-04 18:13:17,012 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 237 transitions, 2607 flow
[2024-06-04 18:13:17,115 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 237 transitions, 2560 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-06-04 18:13:17,118 INFO  L231             Difference]: Finished difference. Result has 172 places, 202 transitions, 2061 flow
[2024-06-04 18:13:17,118 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-04 18:13:17,118 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places.
[2024-06-04 18:13:17,118 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 202 transitions, 2061 flow
[2024-06-04 18:13:17,119 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-04 18:13:17,119 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:17,119 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:17,119 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 18:13:17,119 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-04 18:13:17,119 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:17,119 INFO  L85        PathProgramCache]: Analyzing trace with hash 379008053, now seen corresponding path program 2 times
[2024-06-04 18:13:17,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:17,120 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739746454]
[2024-06-04 18:13:17,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:17,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:17,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:27,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:27,907 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:27,907 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739746454]
[2024-06-04 18:13:27,907 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739746454] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:27,907 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:27,907 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:13:27,908 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172043176]
[2024-06-04 18:13:27,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:27,908 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:13:27,908 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:27,908 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:13:27,908 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:13:28,041 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:28,041 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-04 18:13:28,041 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:28,041 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:28,041 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:29,623 INFO  L124   PetriNetUnfolderBase]: 1951/3078 cut-off events.
[2024-06-04 18:13:29,623 INFO  L125   PetriNetUnfolderBase]: For 144888/144888 co-relation queries the response was YES.
[2024-06-04 18:13:29,639 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-04 18:13:29,650 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 212 selfloop transitions, 20 changer transitions 0/237 dead transitions.
[2024-06-04 18:13:29,650 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 237 transitions, 2665 flow
[2024-06-04 18:13:29,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:13:29,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:13:29,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-04 18:13:29,653 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-04 18:13:29,653 INFO  L175             Difference]: Start difference. First operand has 172 places, 202 transitions, 2061 flow. Second operand 9 states and 170 transitions.
[2024-06-04 18:13:29,653 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 237 transitions, 2665 flow
[2024-06-04 18:13:29,762 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 237 transitions, 2537 flow, removed 56 selfloop flow, removed 4 redundant places.
[2024-06-04 18:13:29,765 INFO  L231             Difference]: Finished difference. Result has 177 places, 204 transitions, 2036 flow
[2024-06-04 18:13:29,765 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-04 18:13:29,765 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places.
[2024-06-04 18:13:29,766 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 204 transitions, 2036 flow
[2024-06-04 18:13:29,766 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-04 18:13:29,766 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:29,766 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:29,766 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 18:13:29,766 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-04 18:13:29,767 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:29,767 INFO  L85        PathProgramCache]: Analyzing trace with hash -313914851, now seen corresponding path program 3 times
[2024-06-04 18:13:29,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:29,767 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120652812]
[2024-06-04 18:13:29,767 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:29,767 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:29,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:41,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:41,647 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:41,647 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120652812]
[2024-06-04 18:13:41,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120652812] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:41,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:41,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:13:41,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425438695]
[2024-06-04 18:13:41,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:41,648 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:13:41,648 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:41,648 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:13:41,648 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:13:41,785 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:41,786 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-04 18:13:41,786 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:41,786 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:41,786 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:43,330 INFO  L124   PetriNetUnfolderBase]: 1968/3105 cut-off events.
[2024-06-04 18:13:43,330 INFO  L125   PetriNetUnfolderBase]: For 152182/152182 co-relation queries the response was YES.
[2024-06-04 18:13:43,346 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-04 18:13:43,356 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 214 selfloop transitions, 23 changer transitions 0/242 dead transitions.
[2024-06-04 18:13:43,357 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 242 transitions, 2700 flow
[2024-06-04 18:13:43,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:13:43,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:13:43,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-04 18:13:43,360 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-04 18:13:43,360 INFO  L175             Difference]: Start difference. First operand has 177 places, 204 transitions, 2036 flow. Second operand 9 states and 172 transitions.
[2024-06-04 18:13:43,360 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 242 transitions, 2700 flow
[2024-06-04 18:13:43,454 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 242 transitions, 2615 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-04 18:13:43,457 INFO  L231             Difference]: Finished difference. Result has 180 places, 208 transitions, 2116 flow
[2024-06-04 18:13:43,457 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-04 18:13:43,458 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places.
[2024-06-04 18:13:43,458 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 208 transitions, 2116 flow
[2024-06-04 18:13:43,458 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-04 18:13:43,458 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:43,458 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:43,458 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 18:13:43,458 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-04 18:13:43,459 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:43,459 INFO  L85        PathProgramCache]: Analyzing trace with hash -313761029, now seen corresponding path program 1 times
[2024-06-04 18:13:43,459 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:43,459 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648530852]
[2024-06-04 18:13:43,459 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:43,459 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:43,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:54,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:54,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:54,099 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648530852]
[2024-06-04 18:13:54,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648530852] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:54,099 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:54,099 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:13:54,100 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001048018]
[2024-06-04 18:13:54,100 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:54,100 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:13:54,100 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:54,100 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:13:54,100 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:13:54,262 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:54,263 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-04 18:13:54,263 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:54,263 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:54,263 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:55,855 INFO  L124   PetriNetUnfolderBase]: 2026/3203 cut-off events.
[2024-06-04 18:13:55,855 INFO  L125   PetriNetUnfolderBase]: For 170233/170233 co-relation queries the response was YES.
[2024-06-04 18:13:55,874 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-04 18:13:55,886 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 222 selfloop transitions, 22 changer transitions 0/249 dead transitions.
[2024-06-04 18:13:55,886 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 249 transitions, 2798 flow
[2024-06-04 18:13:55,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:13:55,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:13:55,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-04 18:13:55,889 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-04 18:13:55,889 INFO  L175             Difference]: Start difference. First operand has 180 places, 208 transitions, 2116 flow. Second operand 10 states and 189 transitions.
[2024-06-04 18:13:55,889 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 249 transitions, 2798 flow
[2024-06-04 18:13:56,038 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 249 transitions, 2672 flow, removed 46 selfloop flow, removed 6 redundant places.
[2024-06-04 18:13:56,041 INFO  L231             Difference]: Finished difference. Result has 184 places, 209 transitions, 2085 flow
[2024-06-04 18:13:56,041 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-04 18:13:56,041 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 141 predicate places.
[2024-06-04 18:13:56,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 209 transitions, 2085 flow
[2024-06-04 18:13:56,042 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-04 18:13:56,042 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:56,042 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:56,042 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 18:13:56,042 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-04 18:13:56,042 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:56,042 INFO  L85        PathProgramCache]: Analyzing trace with hash -454438995, now seen corresponding path program 4 times
[2024-06-04 18:13:56,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:56,043 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019405686]
[2024-06-04 18:13:56,043 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:56,043 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:56,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:08,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:08,351 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:08,351 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019405686]
[2024-06-04 18:14:08,351 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019405686] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:08,351 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:08,351 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:14:08,351 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519475479]
[2024-06-04 18:14:08,351 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:08,351 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:14:08,351 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:08,352 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:14:08,352 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:14:08,522 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:14:08,523 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-04 18:14:08,523 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:08,523 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:14:08,523 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:10,016 INFO  L124   PetriNetUnfolderBase]: 2054/3251 cut-off events.
[2024-06-04 18:14:10,017 INFO  L125   PetriNetUnfolderBase]: For 167546/167546 co-relation queries the response was YES.
[2024-06-04 18:14:10,034 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-04 18:14:10,046 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 214 selfloop transitions, 25 changer transitions 0/244 dead transitions.
[2024-06-04 18:14:10,046 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 244 transitions, 2724 flow
[2024-06-04 18:14:10,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:14:10,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:14:10,049 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-04 18:14:10,049 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4470899470899471
[2024-06-04 18:14:10,049 INFO  L175             Difference]: Start difference. First operand has 184 places, 209 transitions, 2085 flow. Second operand 9 states and 169 transitions.
[2024-06-04 18:14:10,049 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 244 transitions, 2724 flow
[2024-06-04 18:14:10,182 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 244 transitions, 2665 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-04 18:14:10,185 INFO  L231             Difference]: Finished difference. Result has 185 places, 214 transitions, 2170 flow
[2024-06-04 18:14:10,185 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-04 18:14:10,185 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places.
[2024-06-04 18:14:10,185 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 214 transitions, 2170 flow
[2024-06-04 18:14:10,186 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-04 18:14:10,186 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:10,186 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:10,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 18:14:10,186 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:10,186 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:10,186 INFO  L85        PathProgramCache]: Analyzing trace with hash -195010019, now seen corresponding path program 5 times
[2024-06-04 18:14:10,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:10,187 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351406567]
[2024-06-04 18:14:10,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:10,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:10,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:21,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:21,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:21,072 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351406567]
[2024-06-04 18:14:21,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351406567] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:21,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:21,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:14:21,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215664667]
[2024-06-04 18:14:21,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:21,072 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:14:21,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:21,073 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:14:21,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:14:21,350 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:14:21,350 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-04 18:14:21,350 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:21,350 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:14:21,350 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:22,986 INFO  L124   PetriNetUnfolderBase]: 2096/3317 cut-off events.
[2024-06-04 18:14:22,986 INFO  L125   PetriNetUnfolderBase]: For 179198/179198 co-relation queries the response was YES.
[2024-06-04 18:14:23,003 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-04 18:14:23,014 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 211 selfloop transitions, 36 changer transitions 0/252 dead transitions.
[2024-06-04 18:14:23,014 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 252 transitions, 3038 flow
[2024-06-04 18:14:23,016 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:14:23,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:14:23,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-04 18:14:23,017 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603174603174603
[2024-06-04 18:14:23,017 INFO  L175             Difference]: Start difference. First operand has 185 places, 214 transitions, 2170 flow. Second operand 9 states and 174 transitions.
[2024-06-04 18:14:23,017 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 252 transitions, 3038 flow
[2024-06-04 18:14:23,139 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 252 transitions, 2935 flow, removed 34 selfloop flow, removed 5 redundant places.
[2024-06-04 18:14:23,142 INFO  L231             Difference]: Finished difference. Result has 190 places, 219 transitions, 2292 flow
[2024-06-04 18:14:23,142 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-04 18:14:23,142 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-04 18:14:23,142 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 219 transitions, 2292 flow
[2024-06-04 18:14:23,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-04 18:14:23,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:23,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-04 18:14:23,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 18:14:23,143 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:23,143 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:23,143 INFO  L85        PathProgramCache]: Analyzing trace with hash 4439641, now seen corresponding path program 6 times
[2024-06-04 18:14:23,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:23,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808165361]
[2024-06-04 18:14:23,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:23,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:23,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:34,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:34,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:34,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808165361]
[2024-06-04 18:14:34,496 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808165361] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:34,496 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:34,496 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:14:34,496 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097612035]
[2024-06-04 18:14:34,496 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:34,497 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:14:34,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:34,497 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:14:34,497 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:14:34,745 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:14:34,745 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-04 18:14:34,745 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:34,745 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:14:34,745 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:36,334 INFO  L124   PetriNetUnfolderBase]: 2088/3305 cut-off events.
[2024-06-04 18:14:36,334 INFO  L125   PetriNetUnfolderBase]: For 183374/183374 co-relation queries the response was YES.
[2024-06-04 18:14:36,353 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-04 18:14:36,366 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 212 selfloop transitions, 33 changer transitions 0/250 dead transitions.
[2024-06-04 18:14:36,366 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 250 transitions, 2907 flow
[2024-06-04 18:14:36,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:14:36,368 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:14:36,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-04 18:14:36,369 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-04 18:14:36,369 INFO  L175             Difference]: Start difference. First operand has 190 places, 219 transitions, 2292 flow. Second operand 9 states and 170 transitions.
[2024-06-04 18:14:36,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 250 transitions, 2907 flow
[2024-06-04 18:14:36,519 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 250 transitions, 2715 flow, removed 78 selfloop flow, removed 5 redundant places.
[2024-06-04 18:14:36,522 INFO  L231             Difference]: Finished difference. Result has 194 places, 220 transitions, 2222 flow
[2024-06-04 18:14:36,523 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-04 18:14:36,523 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-04 18:14:36,523 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 220 transitions, 2222 flow
[2024-06-04 18:14:36,523 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-04 18:14:36,523 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:36,523 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:36,524 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 18:14:36,524 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:36,524 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:36,524 INFO  L85        PathProgramCache]: Analyzing trace with hash -454433043, now seen corresponding path program 2 times
[2024-06-04 18:14:36,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:36,524 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070412875]
[2024-06-04 18:14:36,524 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:36,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:36,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:47,626 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:47,627 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:47,627 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070412875]
[2024-06-04 18:14:47,627 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070412875] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:47,627 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:47,627 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:14:47,627 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297377657]
[2024-06-04 18:14:47,627 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:47,628 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:14:47,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:47,630 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:14:47,630 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:14:47,952 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:14:47,952 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-04 18:14:47,952 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:47,952 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:14:47,952 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:49,711 INFO  L124   PetriNetUnfolderBase]: 2157/3419 cut-off events.
[2024-06-04 18:14:49,712 INFO  L125   PetriNetUnfolderBase]: For 198544/198544 co-relation queries the response was YES.
[2024-06-04 18:14:49,733 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-04 18:14:49,745 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 229 selfloop transitions, 27 changer transitions 0/261 dead transitions.
[2024-06-04 18:14:49,746 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 261 transitions, 2924 flow
[2024-06-04 18:14:49,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:14:49,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:14:49,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-04 18:14:49,748 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-04 18:14:49,748 INFO  L175             Difference]: Start difference. First operand has 194 places, 220 transitions, 2222 flow. Second operand 10 states and 188 transitions.
[2024-06-04 18:14:49,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 261 transitions, 2924 flow
[2024-06-04 18:14:49,882 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 261 transitions, 2851 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-04 18:14:49,885 INFO  L231             Difference]: Finished difference. Result has 198 places, 224 transitions, 2270 flow
[2024-06-04 18:14:49,885 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-04 18:14:49,886 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 155 predicate places.
[2024-06-04 18:14:49,886 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 224 transitions, 2270 flow
[2024-06-04 18:14:49,886 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-04 18:14:49,886 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:49,886 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:49,886 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 18:14:49,887 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:49,887 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:49,887 INFO  L85        PathProgramCache]: Analyzing trace with hash -247779603, now seen corresponding path program 3 times
[2024-06-04 18:14:49,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:49,887 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234701062]
[2024-06-04 18:14:49,887 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:49,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:49,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:04,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-04 18:15:04,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:04,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234701062]
[2024-06-04 18:15:04,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234701062] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:04,337 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:04,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:15:04,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795724169]
[2024-06-04 18:15:04,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:04,337 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:15:04,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:04,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:15:04,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:15:04,713 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-04 18:15:04,714 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-04 18:15:04,714 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:04,714 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-04 18:15:04,714 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:06,434 INFO  L124   PetriNetUnfolderBase]: 2215/3527 cut-off events.
[2024-06-04 18:15:06,435 INFO  L125   PetriNetUnfolderBase]: For 210132/210132 co-relation queries the response was YES.
[2024-06-04 18:15:06,460 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-04 18:15:06,473 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 212 selfloop transitions, 49 changer transitions 0/266 dead transitions.
[2024-06-04 18:15:06,474 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 266 transitions, 2990 flow
[2024-06-04 18:15:06,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:15:06,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:15:06,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions.
[2024-06-04 18:15:06,476 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4264069264069264
[2024-06-04 18:15:06,476 INFO  L175             Difference]: Start difference. First operand has 198 places, 224 transitions, 2270 flow. Second operand 11 states and 197 transitions.
[2024-06-04 18:15:06,476 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 266 transitions, 2990 flow
[2024-06-04 18:15:06,637 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 266 transitions, 2929 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-04 18:15:06,640 INFO  L231             Difference]: Finished difference. Result has 202 places, 225 transitions, 2365 flow
[2024-06-04 18:15:06,641 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-04 18:15:06,641 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 159 predicate places.
[2024-06-04 18:15:06,641 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 225 transitions, 2365 flow
[2024-06-04 18:15:06,641 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:06,641 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:06,641 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:06,642 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 18:15:06,642 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:06,642 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:06,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 1582742389, now seen corresponding path program 4 times
[2024-06-04 18:15:06,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:06,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68929553]
[2024-06-04 18:15:06,642 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:06,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:06,767 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:20,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:20,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:20,565 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68929553]
[2024-06-04 18:15:20,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68929553] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:20,565 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:20,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:15:20,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016009454]
[2024-06-04 18:15:20,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:20,565 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:15:20,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:20,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:15:20,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:15:20,865 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:15:20,865 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-04 18:15:20,865 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:20,866 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:15:20,866 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:22,568 INFO  L124   PetriNetUnfolderBase]: 2317/3711 cut-off events.
[2024-06-04 18:15:22,569 INFO  L125   PetriNetUnfolderBase]: For 231852/231852 co-relation queries the response was YES.
[2024-06-04 18:15:22,591 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-04 18:15:22,605 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 209 selfloop transitions, 55 changer transitions 0/269 dead transitions.
[2024-06-04 18:15:22,606 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 269 transitions, 3345 flow
[2024-06-04 18:15:22,608 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:15:22,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:15:22,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-04 18:15:22,608 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-04 18:15:22,609 INFO  L175             Difference]: Start difference. First operand has 202 places, 225 transitions, 2365 flow. Second operand 10 states and 195 transitions.
[2024-06-04 18:15:22,609 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 269 transitions, 3345 flow
[2024-06-04 18:15:22,783 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 269 transitions, 3231 flow, removed 11 selfloop flow, removed 9 redundant places.
[2024-06-04 18:15:22,786 INFO  L231             Difference]: Finished difference. Result has 203 places, 227 transitions, 2465 flow
[2024-06-04 18:15:22,786 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-04 18:15:22,787 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places.
[2024-06-04 18:15:22,787 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 227 transitions, 2465 flow
[2024-06-04 18:15:22,787 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-04 18:15:22,787 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:22,787 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:22,787 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 18:15:22,787 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:22,788 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:22,788 INFO  L85        PathProgramCache]: Analyzing trace with hash 1575123829, now seen corresponding path program 5 times
[2024-06-04 18:15:22,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:22,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346013061]
[2024-06-04 18:15:22,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:22,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:22,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:34,197 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:34,197 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:34,197 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346013061]
[2024-06-04 18:15:34,198 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346013061] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:34,198 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:34,198 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:15:34,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895703331]
[2024-06-04 18:15:34,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:34,198 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:15:34,198 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:34,199 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:15:34,199 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:15:34,496 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:15:34,497 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-04 18:15:34,497 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:34,497 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:15:34,497 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:36,267 INFO  L124   PetriNetUnfolderBase]: 2289/3667 cut-off events.
[2024-06-04 18:15:36,267 INFO  L125   PetriNetUnfolderBase]: For 228160/228160 co-relation queries the response was YES.
[2024-06-04 18:15:36,288 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-04 18:15:36,299 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 224 selfloop transitions, 35 changer transitions 0/264 dead transitions.
[2024-06-04 18:15:36,300 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 264 transitions, 3125 flow
[2024-06-04 18:15:36,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:15:36,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:15:36,302 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-04 18:15:36,302 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-04 18:15:36,302 INFO  L175             Difference]: Start difference. First operand has 203 places, 227 transitions, 2465 flow. Second operand 10 states and 189 transitions.
[2024-06-04 18:15:36,303 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 264 transitions, 3125 flow
[2024-06-04 18:15:36,494 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 264 transitions, 3037 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-04 18:15:36,498 INFO  L231             Difference]: Finished difference. Result has 207 places, 227 transitions, 2454 flow
[2024-06-04 18:15:36,498 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-04 18:15:36,498 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 164 predicate places.
[2024-06-04 18:15:36,498 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 227 transitions, 2454 flow
[2024-06-04 18:15:36,498 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-04 18:15:36,499 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:36,499 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:36,499 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 18:15:36,499 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:36,499 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:36,499 INFO  L85        PathProgramCache]: Analyzing trace with hash -1394722191, now seen corresponding path program 7 times
[2024-06-04 18:15:36,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:36,500 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753668078]
[2024-06-04 18:15:36,500 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:36,500 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:36,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:47,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:47,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:47,495 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753668078]
[2024-06-04 18:15:47,495 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753668078] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:47,495 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:47,495 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:47,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095617916]
[2024-06-04 18:15:47,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:47,496 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:47,496 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:47,496 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:47,496 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:47,726 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:15:47,726 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-04 18:15:47,726 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:47,726 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:15:47,727 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:49,247 INFO  L124   PetriNetUnfolderBase]: 2281/3651 cut-off events.
[2024-06-04 18:15:49,247 INFO  L125   PetriNetUnfolderBase]: For 218503/218503 co-relation queries the response was YES.
[2024-06-04 18:15:49,269 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-04 18:15:49,283 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 212 selfloop transitions, 46 changer transitions 0/263 dead transitions.
[2024-06-04 18:15:49,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 263 transitions, 3228 flow
[2024-06-04 18:15:49,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:15:49,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:15:49,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-04 18:15:49,286 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 18:15:49,286 INFO  L175             Difference]: Start difference. First operand has 207 places, 227 transitions, 2454 flow. Second operand 9 states and 171 transitions.
[2024-06-04 18:15:49,286 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 263 transitions, 3228 flow
[2024-06-04 18:15:49,462 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 263 transitions, 3127 flow, removed 11 selfloop flow, removed 9 redundant places.
[2024-06-04 18:15:49,465 INFO  L231             Difference]: Finished difference. Result has 208 places, 234 transitions, 2654 flow
[2024-06-04 18:15:49,466 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-04 18:15:49,466 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 165 predicate places.
[2024-06-04 18:15:49,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 234 transitions, 2654 flow
[2024-06-04 18:15:49,466 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:49,467 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:49,467 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:49,467 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 18:15:49,467 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:49,467 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:49,467 INFO  L85        PathProgramCache]: Analyzing trace with hash 1058066827, now seen corresponding path program 6 times
[2024-06-04 18:15:49,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:49,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199683026]
[2024-06-04 18:15:49,468 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:49,468 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:49,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:01,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:01,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:01,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199683026]
[2024-06-04 18:16:01,428 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199683026] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:01,429 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:01,429 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:16:01,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424976512]
[2024-06-04 18:16:01,429 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:01,429 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:16:01,429 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:01,430 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:16:01,430 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:16:01,765 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:16:01,766 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-04 18:16:01,766 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:01,766 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:16:01,766 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:03,681 INFO  L124   PetriNetUnfolderBase]: 2383/3825 cut-off events.
[2024-06-04 18:16:03,682 INFO  L125   PetriNetUnfolderBase]: For 252095/252095 co-relation queries the response was YES.
[2024-06-04 18:16:03,703 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-04 18:16:03,715 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 188 selfloop transitions, 84 changer transitions 0/277 dead transitions.
[2024-06-04 18:16:03,716 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 277 transitions, 3666 flow
[2024-06-04 18:16:03,718 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:16:03,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:16:03,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-04 18:16:03,718 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-04 18:16:03,718 INFO  L175             Difference]: Start difference. First operand has 208 places, 234 transitions, 2654 flow. Second operand 10 states and 195 transitions.
[2024-06-04 18:16:03,718 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 277 transitions, 3666 flow
[2024-06-04 18:16:03,944 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 277 transitions, 3456 flow, removed 83 selfloop flow, removed 5 redundant places.
[2024-06-04 18:16:03,947 INFO  L231             Difference]: Finished difference. Result has 213 places, 236 transitions, 2724 flow
[2024-06-04 18:16:03,948 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-04 18:16:03,948 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 170 predicate places.
[2024-06-04 18:16:03,948 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 236 transitions, 2724 flow
[2024-06-04 18:16:03,948 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-04 18:16:03,948 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:03,948 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:03,949 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 18:16:03,949 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:03,949 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:03,949 INFO  L85        PathProgramCache]: Analyzing trace with hash -1187914929, now seen corresponding path program 7 times
[2024-06-04 18:16:03,949 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:03,949 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82375955]
[2024-06-04 18:16:03,949 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:03,949 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:04,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:16,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:16,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:16,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82375955]
[2024-06-04 18:16:16,122 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82375955] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:16,122 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:16,122 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:16:16,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806594732]
[2024-06-04 18:16:16,123 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:16,123 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:16:16,123 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:16,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:16:16,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:16:16,381 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:16:16,384 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-04 18:16:16,385 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:16,385 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:16:16,385 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:18,220 INFO  L124   PetriNetUnfolderBase]: 2441/3923 cut-off events.
[2024-06-04 18:16:18,221 INFO  L125   PetriNetUnfolderBase]: For 269305/269305 co-relation queries the response was YES.
[2024-06-04 18:16:18,247 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-04 18:16:18,261 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 219 selfloop transitions, 48 changer transitions 0/272 dead transitions.
[2024-06-04 18:16:18,262 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 272 transitions, 3448 flow
[2024-06-04 18:16:18,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:16:18,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:16:18,264 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions.
[2024-06-04 18:16:18,264 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45476190476190476
[2024-06-04 18:16:18,264 INFO  L175             Difference]: Start difference. First operand has 213 places, 236 transitions, 2724 flow. Second operand 10 states and 191 transitions.
[2024-06-04 18:16:18,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 272 transitions, 3448 flow
[2024-06-04 18:16:18,521 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 272 transitions, 3307 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-04 18:16:18,524 INFO  L231             Difference]: Finished difference. Result has 217 places, 237 transitions, 2742 flow
[2024-06-04 18:16:18,524 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-04 18:16:18,525 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places.
[2024-06-04 18:16:18,525 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 237 transitions, 2742 flow
[2024-06-04 18:16:18,525 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-04 18:16:18,525 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:18,525 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:18,525 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 18:16:18,525 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:18,526 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:18,526 INFO  L85        PathProgramCache]: Analyzing trace with hash 744367597, now seen corresponding path program 8 times
[2024-06-04 18:16:18,526 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:18,526 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028937104]
[2024-06-04 18:16:18,526 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:18,526 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:18,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:30,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:30,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:30,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028937104]
[2024-06-04 18:16:30,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028937104] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:30,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:30,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:16:30,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136615798]
[2024-06-04 18:16:30,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:30,590 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:16:30,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:30,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:16:30,590 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:16:30,795 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:16:30,795 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-04 18:16:30,795 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:30,795 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:16:30,795 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:32,878 INFO  L124   PetriNetUnfolderBase]: 2579/4167 cut-off events.
[2024-06-04 18:16:32,878 INFO  L125   PetriNetUnfolderBase]: For 292276/292276 co-relation queries the response was YES.
[2024-06-04 18:16:32,903 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-04 18:16:32,917 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 194 selfloop transitions, 90 changer transitions 0/289 dead transitions.
[2024-06-04 18:16:32,917 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 289 transitions, 3811 flow
[2024-06-04 18:16:32,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:16:32,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:16:32,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions.
[2024-06-04 18:16:32,920 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4653679653679654
[2024-06-04 18:16:32,920 INFO  L175             Difference]: Start difference. First operand has 217 places, 237 transitions, 2742 flow. Second operand 11 states and 215 transitions.
[2024-06-04 18:16:32,920 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 289 transitions, 3811 flow
[2024-06-04 18:16:33,179 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 289 transitions, 3696 flow, removed 11 selfloop flow, removed 8 redundant places.
[2024-06-04 18:16:33,182 INFO  L231             Difference]: Finished difference. Result has 220 places, 242 transitions, 2926 flow
[2024-06-04 18:16:33,182 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-04 18:16:33,183 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places.
[2024-06-04 18:16:33,183 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 242 transitions, 2926 flow
[2024-06-04 18:16:33,183 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-04 18:16:33,183 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:33,183 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:33,183 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 18:16:33,183 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:33,184 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:33,184 INFO  L85        PathProgramCache]: Analyzing trace with hash -1388996739, now seen corresponding path program 9 times
[2024-06-04 18:16:33,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:33,184 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879463489]
[2024-06-04 18:16:33,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:33,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:33,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:44,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:44,451 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:44,451 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879463489]
[2024-06-04 18:16:44,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879463489] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:44,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:44,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:16:44,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107186010]
[2024-06-04 18:16:44,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:44,453 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:16:44,453 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:44,454 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:16:44,454 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:16:44,741 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:16:44,742 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-04 18:16:44,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:44,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:16:44,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:46,611 INFO  L124   PetriNetUnfolderBase]: 2620/4238 cut-off events.
[2024-06-04 18:16:46,612 INFO  L125   PetriNetUnfolderBase]: For 303966/303966 co-relation queries the response was YES.
[2024-06-04 18:16:46,643 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-04 18:16:46,661 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 226 selfloop transitions, 50 changer transitions 0/281 dead transitions.
[2024-06-04 18:16:46,661 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 281 transitions, 3700 flow
[2024-06-04 18:16:46,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:16:46,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:16:46,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-04 18:16:46,664 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4595238095238095
[2024-06-04 18:16:46,664 INFO  L175             Difference]: Start difference. First operand has 220 places, 242 transitions, 2926 flow. Second operand 10 states and 193 transitions.
[2024-06-04 18:16:46,664 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 281 transitions, 3700 flow
[2024-06-04 18:16:46,994 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 281 transitions, 3611 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-04 18:16:46,997 INFO  L231             Difference]: Finished difference. Result has 225 places, 243 transitions, 2995 flow
[2024-06-04 18:16:46,998 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-04 18:16:46,998 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places.
[2024-06-04 18:16:46,998 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 243 transitions, 2995 flow
[2024-06-04 18:16:46,998 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-04 18:16:46,998 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:46,998 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:46,999 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 18:16:46,999 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-04 18:16:46,999 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:46,999 INFO  L85        PathProgramCache]: Analyzing trace with hash 744100687, now seen corresponding path program 10 times
[2024-06-04 18:16:46,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:46,999 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538963045]
[2024-06-04 18:16:46,999 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:47,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:47,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:59,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:59,563 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:59,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538963045]
[2024-06-04 18:16:59,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538963045] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:59,564 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:59,564 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:16:59,564 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129384432]
[2024-06-04 18:16:59,564 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:59,564 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:16:59,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:59,565 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:16:59,565 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:16:59,895 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:16:59,896 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-04 18:16:59,896 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:59,896 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:16:59,896 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:01,896 INFO  L124   PetriNetUnfolderBase]: 2592/4194 cut-off events.
[2024-06-04 18:17:01,897 INFO  L125   PetriNetUnfolderBase]: For 299172/299172 co-relation queries the response was YES.
[2024-06-04 18:17:01,924 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-04 18:17:01,940 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 197 selfloop transitions, 76 changer transitions 0/278 dead transitions.
[2024-06-04 18:17:01,941 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 278 transitions, 3677 flow
[2024-06-04 18:17:01,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:17:01,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:17:01,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-04 18:17:01,944 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 18:17:01,944 INFO  L175             Difference]: Start difference. First operand has 225 places, 243 transitions, 2995 flow. Second operand 10 states and 190 transitions.
[2024-06-04 18:17:01,944 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 278 transitions, 3677 flow
[2024-06-04 18:17:02,319 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 278 transitions, 3539 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-04 18:17:02,323 INFO  L231             Difference]: Finished difference. Result has 228 places, 243 transitions, 3016 flow
[2024-06-04 18:17:02,323 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-04 18:17:02,323 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-04 18:17:02,323 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 243 transitions, 3016 flow
[2024-06-04 18:17:02,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-04 18:17:02,324 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:02,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-04 18:17:02,324 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 18:17:02,324 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:02,324 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:02,324 INFO  L85        PathProgramCache]: Analyzing trace with hash -679551335, now seen corresponding path program 11 times
[2024-06-04 18:17:02,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:02,325 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810211396]
[2024-06-04 18:17:02,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:02,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:02,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:14,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:14,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:14,307 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810211396]
[2024-06-04 18:17:14,308 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810211396] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:14,308 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:14,308 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:17:14,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603097357]
[2024-06-04 18:17:14,308 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:14,308 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:17:14,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:14,309 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:17:14,309 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:17:14,466 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:17:14,467 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-04 18:17:14,467 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:14,467 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:17:14,467 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:16,479 INFO  L124   PetriNetUnfolderBase]: 2625/4263 cut-off events.
[2024-06-04 18:17:16,480 INFO  L125   PetriNetUnfolderBase]: For 301998/301998 co-relation queries the response was YES.
[2024-06-04 18:17:16,507 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-04 18:17:16,522 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 224 selfloop transitions, 50 changer transitions 0/279 dead transitions.
[2024-06-04 18:17:16,522 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 279 transitions, 3752 flow
[2024-06-04 18:17:16,525 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:17:16,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:17:16,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-04 18:17:16,525 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 18:17:16,525 INFO  L175             Difference]: Start difference. First operand has 228 places, 243 transitions, 3016 flow. Second operand 10 states and 190 transitions.
[2024-06-04 18:17:16,525 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 279 transitions, 3752 flow
[2024-06-04 18:17:16,866 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 279 transitions, 3587 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-04 18:17:16,870 INFO  L231             Difference]: Finished difference. Result has 229 places, 244 transitions, 3012 flow
[2024-06-04 18:17:16,870 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-04 18:17:16,870 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places.
[2024-06-04 18:17:16,870 INFO  L495      AbstractCegarLoop]: Abstraction has has 229 places, 244 transitions, 3012 flow
[2024-06-04 18:17:16,871 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-04 18:17:16,871 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:16,871 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:16,871 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 18:17:16,871 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:16,871 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:16,871 INFO  L85        PathProgramCache]: Analyzing trace with hash -679543895, now seen corresponding path program 12 times
[2024-06-04 18:17:16,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:16,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923010040]
[2024-06-04 18:17:16,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:16,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:16,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:27,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:27,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:27,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923010040]
[2024-06-04 18:17:27,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923010040] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:27,570 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:27,570 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:17:27,570 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11912332]
[2024-06-04 18:17:27,570 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:27,570 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:17:27,570 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:27,571 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:17:27,571 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:17:27,891 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:17:27,892 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-04 18:17:27,892 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:27,892 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:17:27,892 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:29,843 INFO  L124   PetriNetUnfolderBase]: 2605/4231 cut-off events.
[2024-06-04 18:17:29,843 INFO  L125   PetriNetUnfolderBase]: For 291128/291128 co-relation queries the response was YES.
[2024-06-04 18:17:29,870 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-04 18:17:29,884 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 223 selfloop transitions, 61 changer transitions 0/289 dead transitions.
[2024-06-04 18:17:29,884 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 289 transitions, 3772 flow
[2024-06-04 18:17:29,886 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:17:29,886 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:17:29,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions.
[2024-06-04 18:17:29,887 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4588744588744589
[2024-06-04 18:17:29,887 INFO  L175             Difference]: Start difference. First operand has 229 places, 244 transitions, 3012 flow. Second operand 11 states and 212 transitions.
[2024-06-04 18:17:29,887 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 289 transitions, 3772 flow
[2024-06-04 18:17:30,269 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 289 transitions, 3599 flow, removed 17 selfloop flow, removed 9 redundant places.
[2024-06-04 18:17:30,273 INFO  L231             Difference]: Finished difference. Result has 231 places, 244 transitions, 2967 flow
[2024-06-04 18:17:30,273 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-04 18:17:30,273 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places.
[2024-06-04 18:17:30,273 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 244 transitions, 2967 flow
[2024-06-04 18:17:30,273 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-04 18:17:30,273 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:30,274 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:30,274 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 18:17:30,274 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-04 18:17:30,274 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:30,274 INFO  L85        PathProgramCache]: Analyzing trace with hash 1217491922, now seen corresponding path program 1 times
[2024-06-04 18:17:30,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:30,275 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028211352]
[2024-06-04 18:17:30,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:30,275 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:30,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:44,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:44,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:44,599 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028211352]
[2024-06-04 18:17:44,599 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028211352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:44,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:44,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:44,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473358428]
[2024-06-04 18:17:44,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:44,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:44,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:44,600 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:44,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:44,869 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:17:44,869 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-04 18:17:44,869 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:44,869 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:17:44,870 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:46,534 INFO  L124   PetriNetUnfolderBase]: 2524/4160 cut-off events.
[2024-06-04 18:17:46,535 INFO  L125   PetriNetUnfolderBase]: For 291354/291355 co-relation queries the response was YES.
[2024-06-04 18:17:46,561 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-04 18:17:46,575 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 220 selfloop transitions, 43 changer transitions 0/283 dead transitions.
[2024-06-04 18:17:46,576 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 283 transitions, 4087 flow
[2024-06-04 18:17:46,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:46,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:46,576 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-04 18:17:46,577 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-04 18:17:46,577 INFO  L175             Difference]: Start difference. First operand has 231 places, 244 transitions, 2967 flow. Second operand 9 states and 176 transitions.
[2024-06-04 18:17:46,577 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 283 transitions, 4087 flow
[2024-06-04 18:17:46,919 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 283 transitions, 3882 flow, removed 14 selfloop flow, removed 9 redundant places.
[2024-06-04 18:17:46,923 INFO  L231             Difference]: Finished difference. Result has 233 places, 256 transitions, 3079 flow
[2024-06-04 18:17:46,923 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-04 18:17:46,923 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places.
[2024-06-04 18:17:46,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 256 transitions, 3079 flow
[2024-06-04 18:17:46,924 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-04 18:17:46,924 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:46,924 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:46,924 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 18:17:46,924 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-04 18:17:46,924 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:46,924 INFO  L85        PathProgramCache]: Analyzing trace with hash -74889554, now seen corresponding path program 2 times
[2024-06-04 18:17:46,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:46,925 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759824863]
[2024-06-04 18:17:46,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:46,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:46,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:01,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:01,649 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:01,649 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759824863]
[2024-06-04 18:18:01,649 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759824863] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:01,649 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:01,649 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:18:01,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85822421]
[2024-06-04 18:18:01,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:01,650 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:18:01,650 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:01,650 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:18:01,650 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:18:01,843 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:18:01,843 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-04 18:18:01,843 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:01,843 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:18:01,843 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:03,686 INFO  L124   PetriNetUnfolderBase]: 2533/4177 cut-off events.
[2024-06-04 18:18:03,686 INFO  L125   PetriNetUnfolderBase]: For 298142/298156 co-relation queries the response was YES.
[2024-06-04 18:18:03,712 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-04 18:18:03,728 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 224 selfloop transitions, 38 changer transitions 0/282 dead transitions.
[2024-06-04 18:18:03,728 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 282 transitions, 3945 flow
[2024-06-04 18:18:03,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:18:03,731 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:18:03,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-04 18:18:03,731 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 18:18:03,731 INFO  L175             Difference]: Start difference. First operand has 233 places, 256 transitions, 3079 flow. Second operand 9 states and 171 transitions.
[2024-06-04 18:18:03,731 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 282 transitions, 3945 flow
[2024-06-04 18:18:04,099 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 282 transitions, 3869 flow, removed 29 selfloop flow, removed 3 redundant places.
[2024-06-04 18:18:04,102 INFO  L231             Difference]: Finished difference. Result has 239 places, 259 transitions, 3143 flow
[2024-06-04 18:18:04,103 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-04 18:18:04,103 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 196 predicate places.
[2024-06-04 18:18:04,103 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 259 transitions, 3143 flow
[2024-06-04 18:18:04,103 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-04 18:18:04,103 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:04,104 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:04,104 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 18:18:04,104 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-04 18:18:04,106 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:04,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 1221301202, now seen corresponding path program 3 times
[2024-06-04 18:18:04,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:04,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630563005]
[2024-06-04 18:18:04,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:04,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:04,152 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:18,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-04 18:18:18,748 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:18,748 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630563005]
[2024-06-04 18:18:18,748 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630563005] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:18,748 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:18,748 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:18:18,749 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935913235]
[2024-06-04 18:18:18,749 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:18,749 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:18:18,749 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:18,749 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:18:18,749 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:18:19,012 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:18:19,013 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-04 18:18:19,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:19,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:18:19,013 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:20,889 INFO  L124   PetriNetUnfolderBase]: 2526/4163 cut-off events.
[2024-06-04 18:18:20,890 INFO  L125   PetriNetUnfolderBase]: For 300876/300876 co-relation queries the response was YES.
[2024-06-04 18:18:20,916 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-04 18:18:20,930 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 225 selfloop transitions, 37 changer transitions 0/282 dead transitions.
[2024-06-04 18:18:20,930 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 282 transitions, 3961 flow
[2024-06-04 18:18:20,931 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:18:20,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:18:20,931 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions.
[2024-06-04 18:18:20,932 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4931972789115646
[2024-06-04 18:18:20,932 INFO  L175             Difference]: Start difference. First operand has 239 places, 259 transitions, 3143 flow. Second operand 7 states and 145 transitions.
[2024-06-04 18:18:20,932 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 282 transitions, 3961 flow
[2024-06-04 18:18:21,315 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 282 transitions, 3823 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-04 18:18:21,319 INFO  L231             Difference]: Finished difference. Result has 239 places, 259 transitions, 3090 flow
[2024-06-04 18:18:21,319 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-04 18:18:21,319 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 196 predicate places.
[2024-06-04 18:18:21,319 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 259 transitions, 3090 flow
[2024-06-04 18:18:21,319 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-04 18:18:21,320 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:21,320 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:21,320 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 18:18:21,320 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-04 18:18:21,320 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:21,320 INFO  L85        PathProgramCache]: Analyzing trace with hash 365985876, now seen corresponding path program 1 times
[2024-06-04 18:18:21,320 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:21,321 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496031881]
[2024-06-04 18:18:21,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:21,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:21,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:34,781 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:34,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:34,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496031881]
[2024-06-04 18:18:34,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496031881] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:34,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:34,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:34,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760333709]
[2024-06-04 18:18:34,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:34,782 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:34,782 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:34,782 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:34,782 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:34,934 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:18:34,935 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-04 18:18:34,935 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:34,935 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:18:34,935 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:36,446 INFO  L124   PetriNetUnfolderBase]: 2625/4268 cut-off events.
[2024-06-04 18:18:36,447 INFO  L125   PetriNetUnfolderBase]: For 303634/303634 co-relation queries the response was YES.
[2024-06-04 18:18:36,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-04 18:18:36,491 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 243 selfloop transitions, 22 changer transitions 0/270 dead transitions.
[2024-06-04 18:18:36,491 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 270 transitions, 3650 flow
[2024-06-04 18:18:36,492 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:18:36,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:18:36,492 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions.
[2024-06-04 18:18:36,492 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48095238095238096
[2024-06-04 18:18:36,492 INFO  L175             Difference]: Start difference. First operand has 239 places, 259 transitions, 3090 flow. Second operand 5 states and 101 transitions.
[2024-06-04 18:18:36,492 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 270 transitions, 3650 flow
[2024-06-04 18:18:36,896 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 270 transitions, 3542 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-04 18:18:36,899 INFO  L231             Difference]: Finished difference. Result has 238 places, 259 transitions, 3042 flow
[2024-06-04 18:18:36,899 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-04 18:18:36,900 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 195 predicate places.
[2024-06-04 18:18:36,900 INFO  L495      AbstractCegarLoop]: Abstraction has has 238 places, 259 transitions, 3042 flow
[2024-06-04 18:18:36,900 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-04 18:18:36,900 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:36,900 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-04 18:18:36,900 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 18:18:36,900 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:36,901 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:36,901 INFO  L85        PathProgramCache]: Analyzing trace with hash 1854388735, now seen corresponding path program 1 times
[2024-06-04 18:18:36,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:36,901 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144776156]
[2024-06-04 18:18:36,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:36,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:36,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:47,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:47,924 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:47,924 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144776156]
[2024-06-04 18:18:47,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144776156] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:47,924 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:47,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:18:47,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113439400]
[2024-06-04 18:18:47,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:47,925 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:18:47,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:47,925 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:18:47,925 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:18:48,159 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:18:48,159 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-04 18:18:48,159 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:48,159 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:18:48,159 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:50,098 INFO  L124   PetriNetUnfolderBase]: 2642/4291 cut-off events.
[2024-06-04 18:18:50,098 INFO  L125   PetriNetUnfolderBase]: For 317377/317377 co-relation queries the response was YES.
[2024-06-04 18:18:50,129 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-04 18:18:50,146 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 276 selfloop transitions, 20 changer transitions 0/301 dead transitions.
[2024-06-04 18:18:50,146 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 301 transitions, 3814 flow
[2024-06-04 18:18:50,148 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:18:50,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:18:50,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-04 18:18:50,149 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4452380952380952
[2024-06-04 18:18:50,149 INFO  L175             Difference]: Start difference. First operand has 238 places, 259 transitions, 3042 flow. Second operand 10 states and 187 transitions.
[2024-06-04 18:18:50,149 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 301 transitions, 3814 flow
[2024-06-04 18:18:50,521 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 301 transitions, 3770 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-04 18:18:50,524 INFO  L231             Difference]: Finished difference. Result has 244 places, 261 transitions, 3125 flow
[2024-06-04 18:18:50,524 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-04 18:18:50,525 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places.
[2024-06-04 18:18:50,525 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 261 transitions, 3125 flow
[2024-06-04 18:18:50,525 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-04 18:18:50,525 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:50,525 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-04 18:18:50,525 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-04 18:18:50,525 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:50,526 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:50,526 INFO  L85        PathProgramCache]: Analyzing trace with hash -2038984211, now seen corresponding path program 2 times
[2024-06-04 18:18:50,526 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:50,526 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387844631]
[2024-06-04 18:18:50,526 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:50,526 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:50,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:01,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:01,649 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:01,649 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387844631]
[2024-06-04 18:19:01,649 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387844631] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:01,649 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:01,649 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:19:01,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823056772]
[2024-06-04 18:19:01,650 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:01,650 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:19:01,650 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:01,650 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:19:01,650 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:19:02,050 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:19:02,051 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-04 18:19:02,051 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:02,051 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:19:02,051 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:04,002 INFO  L124   PetriNetUnfolderBase]: 2683/4362 cut-off events.
[2024-06-04 18:19:04,002 INFO  L125   PetriNetUnfolderBase]: For 341565/341565 co-relation queries the response was YES.
[2024-06-04 18:19:04,034 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-04 18:19:04,050 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 276 selfloop transitions, 21 changer transitions 0/302 dead transitions.
[2024-06-04 18:19:04,051 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 302 transitions, 3893 flow
[2024-06-04 18:19:04,053 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:19:04,053 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:19:04,053 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-04 18:19:04,053 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-04 18:19:04,053 INFO  L175             Difference]: Start difference. First operand has 244 places, 261 transitions, 3125 flow. Second operand 10 states and 188 transitions.
[2024-06-04 18:19:04,053 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 302 transitions, 3893 flow
[2024-06-04 18:19:04,533 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 302 transitions, 3784 flow, removed 36 selfloop flow, removed 8 redundant places.
[2024-06-04 18:19:04,536 INFO  L231             Difference]: Finished difference. Result has 246 places, 262 transitions, 3114 flow
[2024-06-04 18:19:04,536 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-04 18:19:04,537 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places.
[2024-06-04 18:19:04,537 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 262 transitions, 3114 flow
[2024-06-04 18:19:04,537 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-04 18:19:04,537 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:04,537 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-04 18:19:04,537 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-04 18:19:04,537 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:04,538 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:04,538 INFO  L85        PathProgramCache]: Analyzing trace with hash -1141425061, now seen corresponding path program 3 times
[2024-06-04 18:19:04,538 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:04,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650632885]
[2024-06-04 18:19:04,538 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:04,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:04,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:16,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:16,948 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:16,948 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650632885]
[2024-06-04 18:19:16,948 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650632885] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:16,948 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:16,948 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:19:16,948 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441712278]
[2024-06-04 18:19:16,949 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:16,949 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:19:16,949 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:16,949 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:19:16,949 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:19:17,271 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:19:17,271 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 262 transitions, 3114 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-04 18:19:17,271 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:17,271 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:19:17,271 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:19,332 INFO  L124   PetriNetUnfolderBase]: 2724/4433 cut-off events.
[2024-06-04 18:19:19,340 INFO  L125   PetriNetUnfolderBase]: For 358636/358636 co-relation queries the response was YES.
[2024-06-04 18:19:19,370 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36411 conditions, 4433 events. 2724/4433 cut-off events. For 358636/358636 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 26998 event pairs, 565 based on Foata normal form. 12/4443 useless extension candidates. Maximal degree in co-relation 36295. Up to 4114 conditions per place. 
[2024-06-04 18:19:19,385 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 275 selfloop transitions, 24 changer transitions 0/304 dead transitions.
[2024-06-04 18:19:19,386 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 304 transitions, 3896 flow
[2024-06-04 18:19:19,388 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:19:19,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:19:19,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-04 18:19:19,388 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 18:19:19,388 INFO  L175             Difference]: Start difference. First operand has 246 places, 262 transitions, 3114 flow. Second operand 10 states and 190 transitions.
[2024-06-04 18:19:19,388 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 304 transitions, 3896 flow
[2024-06-04 18:19:19,857 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 304 transitions, 3830 flow, removed 13 selfloop flow, removed 8 redundant places.
[2024-06-04 18:19:19,861 INFO  L231             Difference]: Finished difference. Result has 248 places, 263 transitions, 3160 flow
[2024-06-04 18:19:19,861 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3048, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3160, PETRI_PLACES=248, PETRI_TRANSITIONS=263}
[2024-06-04 18:19:19,862 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 205 predicate places.
[2024-06-04 18:19:19,862 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 263 transitions, 3160 flow
[2024-06-04 18:19:19,862 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-04 18:19:19,862 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:19,862 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-04 18:19:19,862 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-04 18:19:19,862 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:19,863 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:19,863 INFO  L85        PathProgramCache]: Analyzing trace with hash -303842185, now seen corresponding path program 4 times
[2024-06-04 18:19:19,863 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:19,863 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548051397]
[2024-06-04 18:19:19,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:19,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:19,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:30,713 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:30,713 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:30,713 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548051397]
[2024-06-04 18:19:30,713 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548051397] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:30,713 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:30,713 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:19:30,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621175305]
[2024-06-04 18:19:30,714 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:30,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:19:30,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:30,714 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:19:30,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:19:30,881 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:19:30,882 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 263 transitions, 3160 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-04 18:19:30,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:30,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:19:30,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:32,889 INFO  L124   PetriNetUnfolderBase]: 2765/4504 cut-off events.
[2024-06-04 18:19:32,889 INFO  L125   PetriNetUnfolderBase]: For 369295/369295 co-relation queries the response was YES.
[2024-06-04 18:19:32,919 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37020 conditions, 4504 events. 2765/4504 cut-off events. For 369295/369295 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 27529 event pairs, 592 based on Foata normal form. 12/4514 useless extension candidates. Maximal degree in co-relation 36903. Up to 4214 conditions per place. 
[2024-06-04 18:19:32,935 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 270 selfloop transitions, 26 changer transitions 0/301 dead transitions.
[2024-06-04 18:19:32,935 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 301 transitions, 3918 flow
[2024-06-04 18:19:32,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:19:32,937 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:19:32,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-04 18:19:32,937 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4452380952380952
[2024-06-04 18:19:32,937 INFO  L175             Difference]: Start difference. First operand has 248 places, 263 transitions, 3160 flow. Second operand 10 states and 187 transitions.
[2024-06-04 18:19:32,937 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 301 transitions, 3918 flow
[2024-06-04 18:19:33,386 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 301 transitions, 3838 flow, removed 17 selfloop flow, removed 8 redundant places.
[2024-06-04 18:19:33,390 INFO  L231             Difference]: Finished difference. Result has 250 places, 264 transitions, 3190 flow
[2024-06-04 18:19:33,390 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3080, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3190, PETRI_PLACES=250, PETRI_TRANSITIONS=264}
[2024-06-04 18:19:33,390 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 207 predicate places.
[2024-06-04 18:19:33,390 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 264 transitions, 3190 flow
[2024-06-04 18:19:33,390 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-04 18:19:33,391 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:33,391 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-04 18:19:33,391 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-04 18:19:33,391 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:33,391 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:33,391 INFO  L85        PathProgramCache]: Analyzing trace with hash -1750342565, now seen corresponding path program 5 times
[2024-06-04 18:19:33,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:33,391 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428576894]
[2024-06-04 18:19:33,391 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:33,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:33,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15